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 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.

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

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.

Recently there has been considerable interest in developing techniques based on number theory to attack problems of 3-manifolds; Contains many examples and lots of problems; Brings together much of the existing literature of Kleinian groups in a clear and concise way; At present no such text exists

Als mehrbandiges Nachschlagewerk ist das Springer-Handbuch der Mathematik in erster Linie fur wissenschaftliche Bibliotheken, akademische Institutionen und Firmen sowie interessierte Individualkunden in Forschung und Lehregedacht. Es erganzt das einbandige themenumfassende Springer-Taschenbuch der Mathematik (ehemaliger Titel Teubner-Taschenbuch der Mathematik), das sich in seiner begrenzten Stoffauswahl besonders an Studierende richtet.Teil IV des Springer-Handbuchs enthalt die folgenden Zusatzkapitel zum Springer-Taschenbuch: Hohere Analysis, Lineare sowie Nichtlineare Funktionalanalysis und ihre Anwendungen, Dynamische Systeme, Nichtlineare partielle Differentialgleichungen, Mannigfaltigkeiten, Riemannsche Geometrie und allgemeine Relativitatstheorie, Liegruppen, Liealgebren und Elementarteilchen, Topologie, Krummung und Analysis.

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.

While the theory of transcendental numbers is a fundamental and important branch of number theory, most mathematicians know only its most elementary results. The aim of "Making Transcendence Transparent" is to provide the reader with an understanding of the basic principles and tools of transcendence theory and an intuitive framework within which the major results can be appreciated and their proofs can be understood. The book includes big picture overviews of the over-arching ideas, and general points of attack in particular arguments, so the reader will enjoy and appreciate the panoramic view of transcendence. It is designed to appeal to interested mathematicians, graduate students, and advanced undergraduates.

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 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 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.

In his Master Plan Cai Chen (1167-1230) created an original divination manual based on the Yijing and keyed it to an intricate series of 81 matrixes with the properties of "magic squares." Previously unrecognized, Cai's work is a milestone in the history of mathematics, and, in introducing it, this book dramatically expands our understanding of the Chinese number theory practiced by the "Image and Number" school within Confucian philosophy. Thinkers of that leaning devised graphic arrays of the binary figures called "trigrams" and "hexagrams" in the Yijing as a way of exploring the relationship between the random draws of divination and the classic's readings. Cai adapted this perspective to his 81 matrix series, which he saw as tracing the recurring temporal cycles of the natural world. The architecture of the matrix series is echoed in the language of his divination texts, which he called "number names"-hence, the book's title. This book will appeal to those interested in philosophy, the history of science and mathematics, and Chinese intellectual history. The divination text has significant literary as well as philosophical dimensions, and its audience lies both among specialists in these fields and with a general readership interested in recreational mathematics and topics like divination, Taiji, and Fengshui.

This volume mainly deals with the dynamics of finitely valued sequences, and more specifically, of sequences generated by substitutions and automata. Those sequences demonstrate fairly simple combinatorical and arithmetical properties and naturally appear in various domains. As the title suggests, the aim of the initial version of this book was the spectral study of the associated dynamical systems: the first chapters consisted in a detailed introduction to the mathematical notions involved, and the description of the spectral invariants followed in the closing chapters.

This approach, combined with new material added to the new edition, results in a nearly self-contained book on the subject. New tools - which have also proven helpful in other contexts - had to be developed for this study. Moreover, its findings can be concretely applied, the method providing an algorithm to exhibit the spectral measures and the spectral multiplicity, as is demonstrated in several examples. Beyond this advanced analysis, many readers will benefit from the introductory chapters on the spectral theory of dynamical systems; others will find complements on the spectral study of bounded sequences; finally, a very basic presentation of substitutions, together with some recent findings and questions, rounds out the book.

[Hilbert's] style has not the terseness of many of our modem authors in mathematics, which is based on the assumption that printer's labor and paper are costly but the reader's effort and time are not. H. Weyl [143] The purpose of this book is to describe the classical problems in additive number theory and to introduce the circle method and the sieve method, which are the basic analytical and combinatorial tools used to attack these problems. This book is intended for students who want to lel?Ill additive number theory, not for experts who already know it. For this reason, proofs include many "unnecessary" and "obvious" steps; this is by design. The archetypical theorem in additive number theory is due to Lagrange: Every nonnegative integer is the sum of four squares. In general, the set A of nonnegative integers is called an additive basis of order h if every nonnegative integer can be written as the sum of h not necessarily distinct elements of A. Lagrange 's theorem is the statement that the squares are a basis of order four. The set A is called a basis offinite order if A is a basis of order h for some positive integer h. Additive number theory is in large part the study of bases of finite order. The classical bases are the squares, cubes, and higher powers; the polygonal numbers; and the prime numbers. The classical questions associated with these bases are Waring's problem and the Goldbach conjecture.

In [Hardy and Williams, 1986] the authors exploited a very simple idea to obtain a linear congruence involving class numbers of imaginary quadratic fields modulo a certain power of 2. Their congruence provided a unified setting for many congruences proved previously by other authors using various means. The Hardy-Williams idea was as follows. Let d be the discriminant of a quadratic field. Suppose that d is odd and let d = PIP2* . . Pn be its unique decomposition into prime discriminants. Then, for any positive integer k coprime with d, the congruence holds trivially as each Legendre-Jacobi-Kronecker symbol (~) has the value + 1 or -1. Expanding this product gives ~ eld e:=l (mod4) where e runs through the positive and negative divisors of d and v (e) denotes the number of distinct prime factors of e. Summing this congruence for o < k < Idl/8, gcd(k, d) = 1, gives ~ (-It(e) ~ (~) =:O(mod2n). eld o

The method of exponential sums is a general method enabling the solution of a wide range of problems in the theory of numbers and its applications. This volume presents an exposition of the fundamentals of the theory with the help of examples which show how exponential sums arise and how they are applied in problems of number theory and its applications. The material is divided into three chapters which embrace the classical results of Gauss, and the methods of Weyl, Mordell and Vinogradov; the traditional applications of exponential sums to the distribution of fractional parts, the estimation of the Riemann zeta function; and the theory of congruences and Diophantine equations. Some new applications of exponential sums are also included. It is assumed that the reader has a knowledge of the fundamentals of mathematical analysis and of elementary number theory.