The book treats four mathematical concepts which play a fundamental role in many different areas of mathematics: symbolic sums, recurrence (difference) equations, generating functions, and asymptotic estimates. Their key features, in isolation or in combination, their mastery by paper and pencil or by computer programs, and their applications to problems in pure mathematics or to "real world problems" (e.g. the analysis of algorithms) are studied. The book is intended as an algorithmic supplement to the bestselling "Concrete Mathematics" by Graham, Knuth and Patashnik.

This book reflects the progress made in the forty years since the appearance of Abraham Robinson 's revolutionary book Nonstandard Analysis in the foundations of mathematics and logic, number theory, statistics and probability, in ordinary, partial and stochastic differential equations and in education. The contributions are clear and essentially self-contained.

A principal ingredient in the proof of the Moonshine Theorem, connecting the Monster group to modular forms, is the infinite dimensional Lie algebra of physical states of a chiral string on an orbifold of a 26 dimensional torus, called the Monster Lie algebra. It is a Borcherds-Kac-Moody Lie algebra with Lorentzian root lattice; and has an associated automorphic form having a product expansion describing its structure. Lie superalgebras are generalizations of Lie algebras, useful for depicting supersymmetry the symmetry relating fermions and bosons. Most known examples of Lie superalgebras with a related automorphic form such as the Fake Monster Lie algebra whose reflection group is given by the Leech lattice arise from (super)string theory and can be derived from lattice vertex algebras. The No-Ghost Theorem from dual resonance theory and a conjecture of Berger-Li-Sarnak on the eigenvalues of the hyperbolic Laplacian provide strong evidence that they are of rank at most 26.

The aim of this book is to give the reader the tools to understand the ongoing classification and construction project of this class of Lie superalgebras and is ideal for a graduate course. The necessary background is given within chapters or in appendices. "

Number Theory: Tradition and Modernization is a collection of survey and research papers on various topics in number theory. Though the topics and descriptive details appear varied, they are unified by two underlying principles: first, making everything readable as a book, and second, making a smooth transition from traditional approaches to modern ones by providing a rich array of examples.

The chapters are presented in quite different in depth and cover a variety of descriptive details, but the underlying editorial principle enables the reader to have a unified glimpse of the developments of number theory. Thus, on the one hand, the traditional approach is presented in great detail, and on the other, the modernization of the methods in number theory is elaborated. The book emphasizes a few common features such as functional equations for various zeta-functions, modular forms, congruence conditions, exponential sums, and algorithmic aspects.

A book on any mathematical subject beyond the textbook level is of little value unless it contains new ideas and new perspectives. It helps to include new results, provided that they give the reader new insights and are presented along with known old results in a clear exposition. It is with this philosophy that the author writes this volume. The two subjects, Dirichlet series and modular forms, are traditional subjects, but here they are treated in both orthodox and unorthodox ways. Regardless of the unorthodox treatment, the author has made the book accessible to those who are not familiar with such topics by including plenty of expository material.

The central theme of this book is the solution of Diophantine equations, i.e., equations or systems of polynomial equations which must be solved in integers, rational numbers or more generally in algebraic numbers. This theme, in particular, is the central motivation for the modern theory of arithmetic algebraic geometry. In this text, this is considered through three of its most basic aspects. The book contains more than 350 exercises and the text is largely self-contained. Much more sophisticated techniques have been brought to bear on the subject of Diophantine equations, and for this reason, the author has included five appendices on these techniques.

This textbook illuminates the field of discrete mathematics with examples, theory, and applications of the discrete volume of a polytope. The authors have weaved a unifying thread through basic yet deep ideas in discrete geometry, combinatorics, and number theory. We encounter here a friendly invitation to the field of "counting integer points in polytopes," and its various connections to elementary finite Fourier analysis, generating functions, the Frobenius coin-exchange problem, solid angles, magic squares, Dedekind sums, computational geometry, and more. With 250 exercises and open problems, the reader feels like an active participant.

The book deals with algorithmic problems related to binary quadratic forms. It uniquely focuses on the algorithmic aspects of the theory. The book introduces the reader to important areas of number theory such as diophantine equations, reduction theory of quadratic forms, geometry of numbers and algebraic number theory. The book explains applications to cryptography and requires only basic mathematical knowledge. The author is a world leader in number theory.

For a long time the techniques of solving linear optimization (LP) problems improved only marginally. Fifteen years ago, however, a revolutionary discovery changed everything. A new `golden age' for optimization started, which is continuing up to the current time. What is the cause of the excitement? Techniques of linear programming formed previously an isolated body of knowledge. Then suddenly a tunnel was built linking it with a rich and promising land, part of which was already cultivated, part of which was completely unexplored. These revolutionary new techniques are now applied to solve conic linear problems. This makes it possible to model and solve large classes of essentially nonlinear optimization problems as efficiently as LP problems. This volume gives an overview of the latest developments of such `High Performance Optimization Techniques'. The first part is a thorough treatment of interior point methods for semidefinite programming problems. The second part reviews today's most exciting research topics and results in the area of convex optimization. Audience: This volume is for graduate students and researchers who are interested in modern optimization techniques.

Compared to other popular math books, there is more algebraic manipulation, and more applications of algebra in number theory and geometry

Presents an exciting variety of topics to motivate beginning students

May be used as an introductory course or as background reading

This graduate-level textbook provides an elementary exposition of the theory of automorphic representations and L-functions for the general linear group in an adelic setting. Definitions are kept to a minimum and repeated when reintroduced so that the book is accessible from any entry point, and with no prior knowledge of representation theory. The book includes concrete examples of global and local representations of GL(n), and presents their associated L-functions. In Volume 1, the theory is developed from first principles for GL(1), then carefully extended to GL(2) with complete detailed proofs of key theorems. Several proofs are presented for the first time, including Jacquet's simple and elegant proof of the tensor product theorem. In Volume 2, the higher rank situation of GL(n) is given a detailed treatment. Containing numerous exercises by Xander Faber, this book will motivate students and researchers to begin working in this fertile field of research.

Arithmetic Geometry can be defined as the part of Algebraic Geometry connected with the study of algebraic varieties through arbitrary rings, in particular through non-algebraically closed fields. It lies at the intersection between classical algebraic geometry and number theory. A C.I.M.E. Summer School devoted to arithmetic geometry was held in Cetraro, Italy in September 2007, and presented some of the most interesting new developments in arithmetic geometry. This book collects the lecture notes which were written up by the speakers. The main topics concern diophantine equations, local-global principles, diophantine approximation and its relations to Nevanlinna theory, and rationally connected varieties. The book is divided into three parts, corresponding to the courses given by J-L Colliot-Thelene, Peter Swinnerton Dyer and Paul Vojta.

Absolute values and their completions -like the p-adic number fields- play an important role in number theory. Krull's generalization of absolute values to valuations made applications in other branches of mathematics, such as algebraic geometry, possible. In valuation theory, the notion of a completion has to be replaced by that of the so-called Henselization.

In this book, the theory of valuations as well as of Henselizations is developed. The presentation is based on the knowledge acquired in a standard graduate course in algebra. The last chapter presents three applications of the general theory -for instance to Artin's Conjecture on the p-adic number fields- that could not be obtained by the use of absolute values alone.

This edition has been called startlingly up-to-date, and in this corrected second printing you can be sure that it 's even more contemporaneous. It surveys from a unified point of view both the modern state and the trends of continuing development in various branches of number theory. Illuminated by elementary problems, the central ideas of modern theories are laid bare. Some topics covered include non-Abelian generalizations of class field theory, recursive computability and Diophantine equations, zeta- and L-functions. This substantially revised and expanded new edition contains several new sections, such as Wiles' proof of Fermat's Last Theorem, and relevant techniques coming from a synthesis of various theories.

An elegantly dramatized and illustrated dialog on the square root of two and the whole concept of irrational numbers.

Triangular arrays are a unifying thread throughout various areas of discrete mathematics such as number theory and combinatorics. They can be used to sharpen a variety of mathematical skills and tools, such as pattern recognition, conjecturing, proof-techniques, and problem-solving techniques.
While a good deal of research exists concerning triangular arrays and their applications, the information is scattered in various journals and is inaccessible to many mathematicians. This is the first text that will collect and organize the information and present it in a clear and comprehensive introduction to the topic. An invaluable resource book, it gives a historical introduction to Pascal's triangle and covers application topics such as binomial coefficients, figurate numbers, Fibonacci and Lucas numbers, Pell and Pell-Lucas numbers, graph theory, Fibonomial and tribinomial coefficients and Fibonacci and Lucas polynomials, amongst others. The book also features the historical development of triangular arrays, including short biographies of prominent mathematicians, along with the name and affiliation of every discoverer and year of discovery. The book is intended for mathematicians as well as computer scientists, math and science teachers, advanced high school students, and those with mathematical curiosity and maturity.

This book started with "Lattice Theory, First Concepts," in 1971. Then came "General Lattice Theory," First Edition, in 1978, and the Second Edition twenty years later. Since the publication of the first edition in 1978, "General Lattice Theory" has become the authoritative introduction to lattice theory for graduate students and the standard reference for researchers. The First Edition set out to introduce and survey lattice theory. Some 12,000 papers have been published in the field since then; so "Lattice Theory: Foundation" focuses on introducing the field, laying the foundation for special topics and applications. "Lattice Theory: Foundation," based on the previous three books, covers the fundamental concepts and results. The main topics are distributivity, congruences, constructions, modularity and semimodularity, varieties, and free products. The chapter on constructions is new, all the other chapters are revised and expanded versions from the earlier volumes. Almost 40 diamond sections, many written by leading specialists in these fields, provide a brief glimpse into special topics beyond the basics. Lattice theory has come a long way... For those who appreciate lattice theory, or who are curious about its techniques and intriguing internal problems, Professor Gratzer's lucid new book provides a most valuable guide to many recent developments. Even a cursory reading should provide those few who may still believe that lattice theory is superficial or naive, with convincing evidence of its technical depth and sophistication. "Bulletin of the American Mathematical Society" Gratzer s book General Lattice Theory has become the lattice theorist s bible. "Mathematical Reviews"

"This book is the first volume of a two-volume textbook for undergraduates and is indeed the crystallization of a course offered by the author at the California Institute of Technology to undergraduates without any previous knowledge of number theory. For this reason, the book starts with the most elementary properties of the natural integers. Nevertheless, the text succeeds in presenting an enormous amount of material in little more than 300 pages."- MATHEMATICAL REVIEWS

Designed as a self-contained account of a number of key algorithmic problems and their solutions for linear algebraic groups, this book combines in one single text both an introduction to the basic theory of linear algebraic groups and a substantial collection of useful algorithms. Computation with Linear Algebraic Groups offers an invaluable guide to graduate students and researchers working in algebraic groups, computational algebraic geometry, and computational group theory, as well as those looking for a concise introduction to the theory of linear algebraic groups.

A description of 148 algorithms fundamental to number-theoretic computations, in particular for computations related to algebraic number theory, elliptic curves, primality testing and factoring. The first seven chapters guide readers to the heart of current research in computational algebraic number theory, including recent algorithms for computing class groups and units, as well as elliptic curve computations, while the last three chapters survey factoring and primality testing methods, including a detailed description of the number field sieve algorithm. The whole is rounded off with a description of available computer packages and some useful tables, backed by numerous exercises. Written by an authority in the field, and one with great practical and teaching experience, this is certain to become the standard and indispensable reference on the subject.

The worthy purpose of this text is to provide a complete, self-contained development of the trace formula and theta inversion formula for SL(2, Z i])\SL(2, C). Unlike other treatments of the theory, the approach taken here is to begin with the heat kernel on SL(2, C) associated to the invariant Laplacian, which is derived using spherical inversion. The heat kernel on the quotient space SL(2, Z i])\SL(2, C) is arrived at through periodization, and further expanded in an eigenfunction expansion. A theta inversion formula is obtained by studying the trace of the heat kernel. Following the author's previous work, the inversion formula then leads to zeta functions through the Gauss transform.

An Introduction to Mathematical Cryptography provides an introduction to public key cryptography and underlying mathematics that is required for the subject. Each of the eight chapters expands on a specific area of mathematical cryptography and provides an extensive list of exercises.

It is a suitable text for advanced students in pure and applied mathematics and computer science, or the book may be used as a self-study. This book also provides a self-contained treatment of mathematical cryptography for the reader with limited mathematical background.

From the reviews: "This is a textbook in cryptography with emphasis on algebraic methods. It is supported by many exercises (with answers) making it appropriate for a course in mathematics or computer science. ...] Overall, this is an excellent expository text, and will be very useful to both the student and researcher." Mathematical Reviews

This is a book about prime numbers, congruences, secret messages, and elliptic curves that you can read cover to cover. It grew out of undergr- uate courses that the author taught at Harvard, UC San Diego, and the University of Washington. The systematic study of number theory was initiated around 300B. C. when Euclid proved that there are in?nitely many prime numbers, and also cleverly deduced the fundamental theorem of arithmetic, which asserts that every positive integer factors uniquely as a product of primes. Over a thousand years later (around 972A. D. ) Arab mathematicians formulated the congruent number problem that asks for a way to decide whether or not a given positive integer n is the area of a right triangle, all three of whose sides are rational numbers. Then another thousand years later (in 1976), Di?e and Hellman introduced the ?rst ever public-key cryptosystem, which enabled two people to communicate secretely over a public communications channel with no predetermined secret; this invention and the ones that followed it revolutionized the world of digital communication. In the 1980s and 1990s, elliptic curves revolutionized number theory, providing striking new insights into the congruent number problem, primality testing, publ- key cryptography, attacks on public-key systems, and playing a central role in Andrew Wiles' resolution of Fermat's Last Theorem.

This book gives an account of theoretical and algorithmic developments on the integral closure of algebraic structures. It gives a comprehensive treatment of Rees algebras and multiplicity theory while pointing to applications in many other problem areas. Its main goal is to provide complexity estimates by tracking numerically invariants of the structures that may occur.