This book presents methods of solving problems in three areas of elementary combinatorial mathematics: classical combinatorics, combinatorial arithmetic, and combinatorial geometry. In each topic, brief theoretical discussions are immediately followed by carefully worked-out examples of increasing degrees of difficulty, and by exercises that range from routine to rather challenging. While this book emphasizes some methods that are not usually covered in beginning university courses, it nevertheless teaches techniques and skills that are useful not only in the specific topics covered here. There are approximately 310 examples and 650 exercises. Jiri Herman is the headmaster of a prestigious secondary school (Gymnazium) in Brno, Radan Kucera is Associate Professor of Mathematics at Masaryk University in Brno, and Jaromir Simsa is a researcher at the Mathematical Institute of the Academy of Sciences of the Czech Republic. The translator, Karl Dilcher, is Professor of Mathematics at Dalhousie University in Canada. This book can be seen as a continuation of the previous book by the same authors and also translated by Karl Dilcher, Equations and Inequalities: Elementary Problems and Theorems in Algebra and Number Theory (Springer-Verlag 2000).

Lattices are discrete subgroups of maximal rank in a Euclidean space. To each such geometrical object, we can attach a canonical sphere packing which, assuming some regularity, has a density. The question of estimating the highest possible density of a sphere packing in a given dimension is a fascinating and difficult problem: the answer is known only up to dimension 3. This book thus discusses a beautiful and central problem in mathematics, which involves geometry, number theory, coding theory and group theory, centering on the study of extreme lattices, i.e. those on which the density attains a local maximum, and on the so-called perfection property. Written by a leader in the field, it is closely related to, though disjoint in content from, the classic book by J.H. Conway and N.J.A. Sloane, Sphere Packings, Lattices and Groups, published in the same series as vol. 290. Every chapter except the first and the last contains numerous exercises. For simplicity those chapters involving heavy computational methods contain only few exercises. It includes appendices on Semi-Simple Algebras and Quaternions and Strongly Perfect Lattices.

From the reviews "This book gives a thorough introduction to several theories that are fundamental to research on modular forms. Most of the material, despite its importance, had previously been unavailable in textbook form. Complete and readable proofs are given... In conclusion, this book is a welcome addition to the literature for the growing number of students and mathematicians in other fields who want to understand the recent developments in the theory of modular forms."
#"Mathematical Reviews"#
"This book will certainly be indispensable to all those wishing to get an up-to-date initiation to the theory of modular forms."
#"Publicationes Mathematicae"#

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.

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.

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 text originated as a lecture delivered November 20, 1984, at Queen's University, in the undergraduate colloquim series established to honor Professors A. J. Coleman and H. W. Ellis and to acknow ledge their long lasting interest in the quality of teaching under graduate students. In another colloquim lecture, my colleague Morris Orzech, who had consulted the latest edition of the Guilllless Book oj Records, remainded me very gently that the most "innumerate" people of the world are of a certain tribe in Mato Grosso, Brazil. They do not even have a word to express the number "two" or the concept of plurality. "Yes Morris, I'm from Brazil, but my book will contain numbers different from 'one.' " He added that the most boring 800-page book is by two Japanese mathematicians (whom I'll not name), and consists of about 16 million digits of the number 11. "I assure you Morris, that in spite of the beauty of the apparent randomness of the decimal digits of 11, I'll be sure that my text will include also some words." Acknowledgment. The manuscript of this book was prepared on the word processor by Linda Nuttall. I wish to express my appreciation for the great care, speed, and competence of her work."

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

This monograph treats one case of a series of conjectures by S. Kudla, whose goal is to show that Fourier of Eisenstein series encode information about the Arakelov intersection theory of special cycles on Shimura varieties of orthogonal and unitary type. Here, the Eisenstein series is a Hilbert modular form of weight one over a real quadratic field, the Shimura variety is a classical Hilbert modular surface, and the special cycles are complex multiplication points and the Hirzebruch-Zagier divisors. By developing new techniques in deformation theory, the authors successfully compute the Arakelov intersection multiplicities of these divisors, and show that they agree with the Fourier coefficients of derivatives of Eisenstein series.

7 Les Houches Number theory, or arithmetic, sometimes referred to as the queen of mathematics, is often considered as the purest branch of mathematics. It also has the false repu tation of being without any application to other areas of knowledge. Nevertheless, throughout their history, physical and natural sciences have experienced numerous unexpected relationships to number theory. The book entitled Number Theory in Science and Communication, by M.R. Schroeder (Springer Series in Information Sciences, Vol. 7, 1984) provides plenty of examples of cross-fertilization between number theory and a large variety of scientific topics. The most recent developments of theoretical physics have involved more and more questions related to number theory, and in an increasingly direct way. This new trend is especially visible in two broad families of physical problems. The first class, dynamical systems and quasiperiodicity, includes classical and quantum chaos, the stability of orbits in dynamical systems, K.A.M. theory, and problems with "small denominators", as well as the study of incommensurate structures, aperiodic tilings, and quasicrystals. The second class, which includes the string theory of fundamental interactions, completely integrable models, and conformally invariant two-dimensional field theories, seems to involve modular forms and p adic numbers in a remarkable way.

In this volume we study the value distribution of arithmetic functions, allowing unbounded renormalisations. The methods involve a synthesis of Probability and Number Theory; sums of independent infinitesimal random variables playing an important role. A central problem is to decide when an additive arithmetic function fin) admits a renormalisation by real functions a(x) and {3(x) > 0 so that asx ~ 00 the frequencies vx(n;f (n) - a(x) :s;; z {3 (x) ) converge weakly; (see Notation). In contrast to volume one we allow {3(x) to become unbounded with x. In particular, we investigate to what extent one can simulate the behaviour of additive arithmetic functions by that of sums of suit ably defined independent random variables. This fruiful point of view was intro duced in a 1939 paper of Erdos and Kac. We obtain their (now classical) result in Chapter 12. Subsequent methods involve both Fourier analysis on the line, and the appli cation of Dirichlet series. Many additional topics are considered. We mention only: a problem of Hardy and Ramanujan; local properties of additive arithmetic functions; the rate of convergence of certain arithmetic frequencies to the normal law; the arithmetic simulation of all stable laws. As in Volume I the historical background of various results is discussed, forming an integral part of the text. In Chapters 12 and 19 these considerations are quite extensive, and an author often speaks for himself.

Diophantine geometry has been studied by number theorists for thousands of years, since the time of Pythagoras, and has continued to be a rich area of ideas such as Fermat's Last Theorem, and most recently the ABC conjecture. This monograph is a bridge between the classical theory and modern approach via arithmetic geometry. The authors provide a clear path through the subject for graduate students and researchers. They have re-examined many results and much of the literature, and give a thorough account of several topics at a level not seen before in book form. The treatment is largely self-contained, with proofs given in full detail. Many results appear here for the first time. The book concludes with a comprehensive bibliography. It is destined to be a definitive reference on modern diophantine geometry, bringing a new standard of rigor and elegance to the field.

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.

to Number Theory Translated from the Chinese by Peter Shiu With 14 Figures Springer-Verlag Berlin Heidelberg New York 1982 HuaLooKeng Institute of Mathematics Academia Sinica Beijing The People's Republic of China PeterShlu Department of Mathematics University of Technology Loughborough Leicestershire LE 11 3 TU United Kingdom ISBN -13 : 978-3-642-68132-5 e-ISBN -13 : 978-3-642-68130-1 DOl: 10.1007/978-3-642-68130-1 Library of Congress Cataloging in Publication Data. Hua, Loo-Keng, 1910 -. Introduc- tion to number theory. Translation of: Shu lun tao yin. Bibliography: p. Includes index. 1. Numbers, Theory of. I. Title. QA241.H7513.5 12'.7.82-645. ISBN-13:978-3-642-68132-5 (U.S.). AACR2 This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically those of translation, reprinting, reuse of illustra- tions, broadcasting, reproductiOli by photocopying machine or similar means, and storage in data banks. Under 54 of the German Copyright Law where copies are made for other than private use a fee is payable to "VerwertungsgeselIschaft Wort", Munich. (c) Springer-Verlag Berlin Heidelberg 1982 Softcover reprint of the hardcover 1st edition 1982 Typesetting: Buchdruckerei Dipl.-Ing. Schwarz' Erben KG, Zwettl. 214113140-5432 I 0 Preface to the English Edition The reasons for writing this book have already been given in the preface to the original edition and it suffices to append a few more points.

Every positive integer m has a product representation of the form where v, k and the ni are positive integers, and each Ei = +/- I. A value can be given for v which is uniform in the m. A representation can be computed so that no ni exceeds a certain fixed power of 2m, and the number k of terms needed does not exceed a fixed power of log 2m. Consider next the collection of finite probability spaces whose associated measures assume only rational values. Let hex) be a real-valued function which measures the information in an event, depending only upon the probability x with which that event occurs. Assuming hex) to be non negative, and to satisfy certain standard properties, it must have the form -A(x log x + (I - x) 10g(I -x". Except for a renormalization this is the well-known function of Shannon. What do these results have in common? They both apply the theory of arithmetic functions. The two widest classes of arithmetic functions are the real-valued additive and the complex-valued multiplicative functions. Beginning in the thirties of this century, the work of Erdos, Kac, Kubilius, Turan and others gave a discipline to the study of the general value distribution of arithmetic func tions by the introduction of ideas, methods and results from the theory of Probability. I gave an account of the resulting extensive and still developing branch of Number Theory in volumes 239/240 of this series, under the title Probabilistic Number Theory.

H. Davenport: Probl mes d empilement et de d couvrement.- L.J. Mordell: Equazioni diofantee.- C.A. Rogers: The geometry of numbers.- P. Erd s: Some problems on the distribution of prime numbers.- G. Ricci: Sul reticolo dei punti aventi per coordinate i numeri primi.

"About binomial theorems I'm teeming with a lot of news, With many cheerful facts about the square on the hypotenuse. " - William S. Gilbert (The Pirates of Penzance, Act I) The question of divisibility is arguably the oldest problem in mathematics. Ancient peoples observed the cycles of nature: the day, the lunar month, and the year, and assumed that each divided evenly into the next. Civilizations as separate as the Egyptians of ten thousand years ago and the Central American Mayans adopted a month of thirty days and a year of twelve months. Even when the inaccuracy of a 360-day year became apparent, they preferred to retain it and add five intercalary days. The number 360 retains its psychological appeal today because it is divisible by many small integers. The technical term for such a number reflects this appeal. It is called a "smooth" number. At the other extreme are those integers with no smaller divisors other than 1, integers which might be called the indivisibles. The mystic qualities of numbers such as 7 and 13 derive in no small part from the fact that they are indivisibles. The ancient Greeks realized that every integer could be written uniquely as a product of indivisibles larger than 1, what we appropriately call prime numbers. To know the decomposition of an integer into a product of primes is to have a complete description of all of its divisors.

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.

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

Number theory is a branch of mathematics which draws its vitality from a rich historical background. It is also traditionally nourished through interactions with other areas of research, such as algebra, algebraic geometry, topology, complex analysis and harmonic analysis. More recently, it has made a spectacular appearance in the field of theoretical computer science and in questions of communication, cryptography and error-correcting codes. Providing an elementary introduction to the central topics in number theory, this book spans multiple areas of research. The first part corresponds to an advanced undergraduate course. All of the statements given in this part are of course accompanied by their proofs, with perhaps the exception of some results appearing at the end of the chapters. A copious list of exercises, of varying difficulty, are also included here. The second part is of a higher level and is relevant for the first year of graduate school. It contains an introduction to elliptic curves and a chapter entitled "Developments and Open Problems", which introduces and brings together various themes oriented toward ongoing mathematical research. Given the multifaceted nature of number theory, the primary aims of this book are to: - provide an overview of the various forms of mathematics useful for studying numbers - demonstrate the necessity of deep and classical themes such as Gauss sums - highlight the role that arithmetic plays in modern applied mathematics - include recent proofs such as the polynomial primality algorithm - approach subjects of contemporary research such as elliptic curves - illustrate the beauty of arithmetic The prerequisites for this text are undergraduate level algebra and a little topology of Rn. It will be of use to undergraduates, graduates and phd students, and may also appeal to professional mathematicians as a reference text.

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.

Random matrix theory is an area of mathematics first developed by physicists interested in the energy levels of atomic nuclei, but it can also be used to describe some exotic phenomena in the number theory of elliptic curves. The purpose of this book is to illustrate this interplay of number theory and random matrices. It begins with an introduction to elliptic curves and the fundamentals of modelling by a family of random matrices, and moves on to highlight the latest research. There are expositions of current research on ranks of elliptic curves, statistical properties of families of elliptic curves and their associated L-functions and the emerging uses of random matrix theory in this field. Most of the material here had its origin in a Clay Mathematics Institute workshop on this topic at the Newton Institute in Cambridge and together these contributions provide a unique in-depth treatment of the subject.

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.

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

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