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.

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

Class field theory, which is so immediately compelling in its main assertions, has, ever since its invention, suffered from the fact that its proofs have required a complicated and, by comparison with the results, rather imper spicuous system of arguments which have tended to jump around all over the place. My earlier presentation of the theory 41] has strengthened me in the belief that a highly elaborate mechanism, such as, for example, cohomol ogy, might not be adequate for a number-theoretical law admitting a very direct formulation, and that the truth of such a law must be susceptible to a far more immediate insight. I was determined to write the present, new account of class field theory by the discovery that, in fact, both the local and the global reciprocity laws may be subsumed under a purely group theoretical principle, admitting an entirely elementary description. This de scription makes possible a new foundation for the entire theory. The rapid advance to the main theorems of class field theory which results from this approach has made it possible to include in this volume the most important consequences and elaborations, and further related theories, with the excep tion of the cohomology version which I have this time excluded. This remains a significant variant, rich in application, but its principal results should be directly obtained from the material treated here."

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

The relation between mathematics and physics has a long history, in which the role of number theory and of other more abstract parts of mathematics has recently become more prominent.

More than ten years after a first meeting in 1989 between number theorists and physicists at the Centre de Physique des Houches, a second 2-week event focused on the broader interface of number theory, geometry, and physics.

This book is the result of that exciting meeting, and collects, in 2 volumes, extended versions of the lecture courses, followed by shorter texts on special topics, of eminent mathematicians and physicists.

The present volume has three parts: Conformal Field Theories, Discrete Groups, Renomalization.

The companion volume is subtitled: On Random Matrices, Zeta Functions and Dynamical Systems (Springer, 3-540-23189-7).

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.

Computers have stretched the limits of what is possible in mathematics. More: they have given rise to new fields of mathematical study; the analysis of new and traditional algorithms, the creation of new paradigms for implementing computational methods, the viewing of old techniques from a concrete algorithmic vantage point, to name but a few. Computational Algebra and Number Theory lies at the lively intersection of computer science and mathematics. It highlights the surprising width and depth of the field through examples drawn from current activity, ranging from category theory, graph theory and combinatorics, to more classical computational areas, such as group theory and number theory. Many of the papers in the book provide a survey of their topic, as well as a description of present research. Throughout the variety of mathematical and computational fields represented, the emphasis is placed on the common principles and the methods employed. Audience: Students, experts, and those performing current research in any of the topics mentioned above.

A new and complete treatment of semi-abelian degenerations of abelian varieties, and their application to the construction of arithmetic compactifications of Siegel moduli space, with most of the results being published for the first time. Highlights of the book include a classification of semi-abelian schemes, construction of the toroidal and the minimal compactification over the integers, heights for abelian varieties over number fields, and Eichler integrals in several variables, together with a new approach to Siegel modular forms. A valuable source of reference for researchers and graduate students interested in algebraic geometry, Shimura varieties or diophantine geometry.

This book deals with several aspects of what is now called "explicit number theory." The central theme 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 local aspect, global aspect, and the third aspect is the theory of zeta and L-functions. This last aspect can be considered as a unifying theme for the whole subject.

This informative and exhaustive study gives a problem-solving approach to the difficult subject of analytic number theory. It is primarily aimed at graduate students and senior undergraduates. The goal is to provide a rapid introduction to analytic methods and the ways in which they are used to study the distribution of prime numbers. The book also includes an introduction to p-adic analytic methods. It is ideal for a first course in analytic number theory. The new edition has been completely rewritten, errors have been corrected, and there is a new chapter on the arithmetic progression of primes.

Number theory has a wealth of long-standing problems, the study of which over the years has led to major developments in many areas of mathematics. This volume consists of seven significant chapters on number theory and related topics. Written by distinguished mathematicians, key topics focus on multipartitions, congruences and identities (G. Andrews), the formulas of Koshliakov and Guinand in Ramanujan's Lost Notebook (B. C. Berndt, Y. Lee, and J. Sohn), alternating sign matrices and the Weyl character formulas (D. M. Bressoud), theta functions in complex analysis (H. M. Farkas), representation functions in additive number theory (M. B. Nathanson), and mock theta functions, ranks, and Maass forms (K. Ono), and elliptic functions (M. Waldschmidt).

This book explores the theory of abelian varieties over the field of complex numbers, explaining both classic and recent results in modern language. The second edition adds five chapters on recent results including automorphisms and vector bundles on abelian varieties, algebraic cycles and the Hodge conjecture. ." . . far more readable than most . . . it is also much more complete." Olivier Debarre in Mathematical Reviews, 1994.

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.

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.

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.

"...the great feature of the book is that anyone can read it without excessive head scratching...You'll find plenty here to keep you occupied, amused, and informed. Buy, dip in, wallow." -IAN STEWART, NEW SCIENTIST "...a delightful look at numbers and their roles in everything from language to flowers to the imagination." -SCIENCE NEWS "...a fun and fascinating tour of numerical topics and concepts. It will have readers contemplating ideas they might never have thought were understandable or even possible." -WISCONSIN BOOKWATCH "This popularization of number theory looks like another classic." -LIBRARY JOURNAL

In the Riemann zeta function ?(s), the non-real zeros or Riemann zeros, denoted ?, play an essential role mainly in number theory, and thereby g- erate considerable interest. However, they are very elusive objects. Thus, no individual zero has an analytically known location; and the Riemann - pothesis, which states that all those zeros should lie on the critical line, i.e., 1 haverealpart, haschallengedmathematicianssince1859(exactly150years 2 ago). For analogous symmetric sets of numbers{v}, such as the roots of a k polynomial, the eigenvalues of a ?nite or in?nite matrix, etc., it is well known that symmetric functions of the{v} tend to have more accessible properties k than the individual elements v . And, we ?nd the largest wealth of explicit k properties to occur in the (generalized) zeta functions of the generic form 's Zeta(s, a)= (v ]a) k k (with the extra option of replacing v here by selected functions f(v )). k k Not surprisingly, then, zeta functions over the Riemann zeros have been considered, some as early as 1917.What is surprising is how small the lite- ture on those zeta functions has remained overall.We were able to spot them in barely a dozen research articles over the whole twentieth century and in none ofthebooks featuring the Riemannzeta function. So the domainexists, but it has remained largely con?dential and sporadically covered, in spite of a recent surge of interest. Could it then be that those zeta functions have few or uninteresting pr- erties?Inactualfact, theirstudyyieldsanabundanceofquiteexplicitresu

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.

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