The study of special cases of elliptic curves goes back to Diophantos and Fermat, and today it is still one of the liveliest centers of research in number theory. This book, addressed to beginning graduate students, introduces basic theory from a contemporary viewpoint but with an eye to the historical background. The central portion deals with curves over the rationals: the Mordell-Wei finite basis theorem, points of finite order (Nagell-Lutz), etc. The treatment is structured by the local-global standpoint and culminates in the description of the Tate-Shafarevich group as the obstruction to a Hasse principle. In an introductory section the Hasse principle for conics is discussed. The book closes with sections on the theory over finite fields (the "Riemann hypothesis for function fields") and recently developed uses of elliptic curves for factoring large integers. Prerequisites are kept to a minimum; an acquaintance with the fundamentals of Galois theory is assumed, but no knowledge either of algebraic number theory or algebraic geometry is needed. The p-adic numbers are introduced from scratch. Many examples and exercises are included for the reader, and those new to elliptic curves, whether they are graduate students or specialists from other fields, will find this a valuable introduction.

This book is an introduction to the algorithmic aspects of number theory and its applications to cryptography, with special emphasis on the RSA cryptosys-tem. It covers many of the familiar topics of elementary number theory, all with an algorithmic twist. The text also includes many interesting historical notes.

This volume is an outgrowth of the LMS Durham Symposium on L-functions, held in July 1989. The symposium consisted of several short courses, aimed at presenting rigorous but non-technical expositions of the latest research areas, and a number of individual lectures on specific topics. The contributors are all outstanding figures in the area of algebraic number theory and this volume will be of lasting value to students and researchers working in the area.

This book is a self-contained account of the one- and two-dimensional van der Corput method and its use in estimating exponential sums. These arise in many problems in analytic number theory. It is the first cohesive account of much of this material and will be welcomed by graduates and professionals in analytic number theory. The authors show how the method can be applied to problems such as upper bounds for the Riemann-Zeta function. the Dirichlet divisor problem, the distribution of square free numbers, and the Piatetski-Shapiro prime number theorem.

The object of the present work is a systematic statistical analysis of bilinear processes in the frequency domain. The first two chapters are devoted to the basic theory of nonlinear functions of stationary Gaussian processes, Hermite polynomials, cumulants and higher order spectra, multiple Wiener-Ito integrals and finally chaotic Wiener-Ito spectral representation of subordinated processes. There are two chapters for general nonlinear time series problems."

Introduction Model theorists have often joked in recent years that the part of mathemat- ical logic known as "pure model theory" (or stability theory), as opposed to the older and more traditional "model theory applied to algebra" , turns out to have more and more to do with other subjects ofmathematics and to yield gen- uine applications to combinatorial geometry, differential algebra and algebraic geometry. We illustrate this by presenting the very striking application to diophantine geometry due to Ehud Hrushovski: using model theory, he has given the first proof valid in all characteristics of the "Mordell-Lang conjecture for function fields" (The Mordell-Lang conjecture for function fields, Journal AMS 9 (1996), 667-690). More recently he has also given a new (model theoretic) proof of the Manin-Mumford conjecture for semi-abelian varieties over a number field. His proofyields the first effective bound for the cardinality ofthe finite sets involved (The Manin-Mumford conjecture, preprint). There have been previous instances of applications of model theory to alge- bra or number theory, but these appl~cations had in common the feature that their proofs used a lot of algebra (or number theory) but only very basic tools and results from the model theory side: compactness, first-order definability, elementary equivalence...

The National Security Agency funded a conference on Coding theory, Cryp- tography, and Number Theory (nick-named Cryptoday) at the United States Naval Academy, on October 25-27, 1998. We were very fortunate to have been able to attract talented mathematicians and cryptographers to the meeting. Unfortunately, some people couldn't make it for either scheduling or funding reasons. Some of these have been invited to contribute a paper anyway. In addition, Prof. William Tutte and Frode Weierud have been kind enough to allow the inclusion of some very interesting unpublished papers of theirs. The papers basically fall into three catagories. Historical papers on cryp- tography done during World War II (Hatch, Hilton, Tutte, Ulfving, and Weierud), mathematical papers on more recent methods in cryptography (Cosgrave, Lomonoco, Wardlaw), and mathematical papers in coding theory (Gao, Joyner, Michael, Shokranian, Shokrollahi). A brief biography of the authors follows. - Peter Hilton is a Distinguished Professor of Mathematics Emeritus at the State University of New York at Binghamton. He worked from 1941 to 1945 in the British cryptanalytic headquarters at Bletchley Park. Profes- sor Hilton has done extensive research in algebraic topology and group theory. - William Tutte is a Distinguished Professor Emeritus and an Adjunct Pro- fessor in the Combinatorics and Optimization Department at the Univer- sity of Waterloo. He worked from 1941 to 1945 in the British cryptana- lytic headquarters at Bletchley Park. Professor Tutte has done extensive research in the field of combinatorics.

This volume contains the expanded lectures given at a conference on number theory and arithmetic geometry held at Boston University. It introduces and explains the many ideas and techniques used by Wiles, and to explain how his result can be combined with Ribets theorem and ideas of Frey and Serre to prove Fermats Last Theorem. The book begins with an overview of the complete proof, followed by several introductory chapters surveying the basic theory of elliptic curves, modular functions and curves, Galois cohomology, and finite group schemes. Representation theory, which lies at the core of the proof, is dealt with in a chapter on automorphic representations and the Langlands-Tunnell theorem, and this is followed by in-depth discussions of Serres conjectures, Galois deformations, universal deformation rings, Hecke algebras, and complete intersections. The book concludes by looking both forward and backward, reflecting on the history of the problem, while placing Wiles'theorem into a more general Diophantine context suggesting future applications. Students and professional mathematicians alike will find this an indispensable resource.

Originally published in 1934 in the Cambridge Tracts, this volume presents the theory of the distribution of the prime numbers in the series of natural numbers. The major part of the book is devoted to the analytical theory founded on the zeta-function of Riemann. Despite being out of print for a long time, this Tract still remains unsurpassed as an introduction to the field, combining an economy of detail with a clarity of exposition which eases the novice into this area.

This book constitutes the refereed proceedings of the Third International Symposium on Algorithmic Number Theory, ANTS-III, held in Portland, Oregon, USA, in June 1998.The volume presents 46 revised full papers together with two invited surveys. The papers are organized in chapters on gcd algorithms, primality, factoring, sieving, analytic number theory, cryptography, linear algebra and lattices, series and sums, algebraic number fields, class groups and fields, curves, and function fields.

This book concerns modern methods in scientific computing and linear algebra, relevant to image and signal processing. For these applications, it is important to consider ingredients such as: (1) sophisticated mathematical models of the problems, including a priori knowledge, (2) rigorous mathematical theories to understand the difficulties of solving problems which are ill-posed, and (3) fast algorithms for either real-time or data-massive computations. Such are the topics brought into focus by these proceedings of the Workshop on Scientific Computing (held in Hong Kong on March 10-12, 1997, the sixth in such series of Workshops held in Hong Kong since 1990), where the major themes were on numerical linear algebra, signal processing, and image processing.

This book contains 22 lectures presented at the final conference of the Ger man research program (Schwerpunktprogramm) Algorithmic Number The ory and Algebra 1991-1997, sponsored by the Deutsche Forschungsgemein schaft. The purpose of this research program and of the meeting was to bring together developers of computer algebra software and researchers using com putational methods to gain insight into experimental problems and theoret ical questions in algebra and number theory. The book gives an overview on algorithmic methods and on results ob tained during this period. This includes survey articles on the main research projects within the program: * algorithmic number theory emphasizing class field theory, constructive Galois theory, computational aspects of modular forms and of Drinfeld modules * computational algebraic geometry including real quantifier elimination and real algebraic geometry, and invariant theory of finite groups * computational aspects of presentations and representations of groups, especially finite groups of Lie type and their Heeke algebras, and of the isomorphism problem in group theory. Some of the articles illustrate the current state of computer algebra sys tems and program packages developed with support by the research pro gram, such as KANT and LiDIA for algebraic number theory, SINGULAR, RED LOG and INVAR for commutative algebra and invariant theory respec tively, and GAP, SYSYPHOS and CHEVIE for group theory and representation theory.

In this volume, originally published in 1990, are included papers presented at two meetings; one a workshop on Number Theory and Cryptography, and the other, the annual meeting of the Australian Mathematical Society. Questions in number theory are of military and commercial importance for the security of communication, as they are related to codes and code-breaking. Papers in the volume range from problems in pure mathematics whose study has been intensified by this connection, through interesting theoretical and combinatorial problems which arise in the implementation, to practical questions that come from banking and telecommunications. The contributors are prominent within their field. The whole volume will be an attractive purchase for all number theorists, 'pure' or 'applied'.

This volume aims to present a straightforward and easily accessible survey of the analytic theory of quadratic forms. Written at an elementary level, the book provides a sound basis from which the reader can study advanced works and undertake original research. Roughly half a century ago C.L. Siegel discovered a new type of automorphic forms in several variables in connection with his famous work on the analytic theory of quadratic forms. Since then Siegel modular forms have been studied extensively because of their significance in both automorphic functions in several complex variables and number theory. The comprehensive theory of automorphic forms to subgroups of algebraic groups and the recent arithmetical theory of modular forms illustrate these two aspects in an illuminating manner. The text is based on the author's lectures given over a number of years and is intended for a one semester graduate course, although it can serve equally well for self study . The only prerequisites are a knowledge of algebra, number theory and complex analysis.

The book is an introduction to the theory of cubic metaplectic forms on the 3-dimensional hyperbolic space and the author's research on cubic metaplectic forms on special linear and symplectic groups of rank 2. The topics include: Kubota and Bass-Milnor-Serre homomorphisms, cubic metaplectic Eisenstein series, cubic theta functions, Whittaker functions. A special method is developed and applied to find Fourier coefficients of the Eisenstein series and cubic theta functions. The book is intended for readers, with beginning graduate-level background, interested in further research in the theory of metaplectic forms and in possible applications.

The 3n+1 function T is defined by T(n)=n/2 for n even, and T(n)=(3n+1)/2 for n odd. The famous 3n+1 conjecture, which remains open, states that, for any starting number n>0, iterated application of T to n eventually produces 1. After a survey of theorems concerning the 3n+1 problem, the main focus of the book are 3n+1 predecessor sets. These are analyzed using, e.g., elementary number theory, combinatorics, asymptotic analysis, and abstract measure theory. The book is written for any mathematician interested in the 3n+1 problem, and in the wealth of mathematical ideas employed to attack it.

This volume contains selected contributions from a very successful meeting on Number Theory and Dynamical Systems held at the University of York in 1987. There are close and surprising connections between number theory and dynamical systems. One emerged last century from the study of the stability of the solar system where problems of small divisors associated with the near resonance of planetary frequencies arose. Previously the question of the stability of the solar system was answered in more general terms by the celebrated KAM theorem, in which the relationship between near resonance (and so Diophantine approximation) and stability is of central importance. Other examples of the connections involve the work of Szemeredi and Furstenberg, and Sprindzuk. As well as containing results on the relationship between number theory and dynamical systems, the book also includes some more speculative and exploratory work which should stimulate interest in different approaches to old problems.

In 1988 Shafarevich asked me to write a volume for the Encyclopaedia of Mathematical Sciences on Diophantine Geometry. I said yes, and here is the volume. By definition, diophantine problems concern the solutions of equations in integers, or rational numbers, or various generalizations, such as finitely generated rings over Z or finitely generated fields over Q. The word Geometry is tacked on to suggest geometric methods. This means that the present volume is not elementary. For a survey of some basic problems with a much more elementary approach, see La 9Oc]. The field of diophantine geometry is now moving quite rapidly. Out standing conjectures ranging from decades back are being proved. I have tried to give the book some sort of coherence and permanence by em phasizing structural conjectures as much as results, so that one has a clear picture of the field. On the whole, I omit proofs, according to the boundary conditions of the encyclopedia. On some occasions I do give some ideas for the proofs when these are especially important. In any case, a lengthy bibliography refers to papers and books where proofs may be found. I have also followed Shafarevich's suggestion to give examples, and I have especially chosen these examples which show how some classical problems do or do not get solved by contemporary in sights. Fermat's last theorem occupies an intermediate position. Al though it is not proved, it is not an isolated problem any more."

Semantics of Parallelism is the only book which provides a unified treatment of the non-interleaving approach to process semantics (as opposed to the interleaving approach of the process algebraists). Many results found in this book are collected for the first time outside conference and journal articles on the mathematics of non-interleaving semantics. It gives the reader a unified view of various attempts to model parallelism within one conceptual frame work. It is aimed at postgraduates in theoretical computer science and academics who are teaching and researching in the modelling of discrete, concurrent/distributed systems. Workers in the information technology industry who are interested in available theoretical studies on parallelism will also be interested in this book.

Interest in the study of geometry is currently enjoying a resurgence-understandably so, as the study of curves was once the playground of some very great mathematicians. However, many of the subject's more exciting aspects require a somewhat advanced mathematics background. For the "fun stuff" to be accessible, we need to offer students an introduction with modest prerequisites, one that stimulates their interest and focuses on problem solving.

Integrating parametric, algebraic, and projective curves into a single text, Geometry of Curves offers students a unique approach that provides a mathematical structure for solving problems, not just a catalog of theorems. The author begins with the basics, then takes students on a fascinating journey from conics, higher algebraic and transcendental curves, through the properties of parametric curves, the classification of limaçons, envelopes, and finally to projective curves, their relationship to algebraic curves, and their application to asymptotes and boundedness.

The uniqueness of this treatment lies in its integration of the different types of curves, its use of analytic methods, and its generous number of examples, exercises, and illustrations.
The result is a practical text, almost entirely self-contained, that not only imparts a deeper understanding of the theory, but inspires a heightened appreciation of geometry and interest in more advanced studies.

The main purpose of this book is to give an overview of the developments during the last 20 years in the theory of uniformly distributed sequences. The authors focus on various aspects such as special sequences, metric theory, geometric concepts of discrepancy, irregularities of distribution, continuous uniform distribution and uniform distribution in discrete spaces. Specific applications are presented in detail: numerical integration, spherical designs, random number generation and mathematical finance. Furthermore over 1000 references are collected and discussed. While written in the style of a research monograph, the book is readable with basic knowledge in analysis, number theory and measure theory.

From the reviews: "A well-written, very thorough account ... Among the topics are lattices, reduction, Minkowskis Theorem, distance functions, packings, and automorphs; some applications to number theory; excellent bibliographical references." The American Mathematical Monthly

This book contains a collection of articles corresponding to some of the talks delivered at the Foundations of Computational Mathematics conference held at IMPA in Rio de Janeiro in January 1997. Some ofthe others are published in the December 1996 issue of the Journal of Complexity. Both of these publications were available and distributed at the meeting. Even in this aspect we hope to have achieved a synthesis of the mathematics and computer science cultures as well as of the disciplines. The reaction to the Park City meeting on Mathematics of Numerical Analy sis: Real Number Algorithms which was chaired by Steve Smale and had around 275 participants, was very enthusiastic. At the suggestion of Narendra Karmar mar a lunch time meeting of Felipe Cucker, Arieh Iserles, Narendra Karmarkar, Jim Renegar, Mike Shub and Steve Smale decided to try to hold a periodic meeting entitled "Foundations of Computational Mathematics" and to form an organization with the same name whose primary purpose will be to hold the meeting. This is then the first edition of FoCM as such. It has been organized around a small collection of workshops, namely - Systems of algebraic equations and computational algebraic geometry - Homotopy methods and real machines - Information-based complexity - Numerical linear algebra - Approximation and PDEs - Optimization - Differential equations and dynamical systems - Relations to computer science - Vision and related computational tools There were also twelve plenary speakers."

From the reviews:"The book...is a thorough and very readable introduction to the arithmetic of function fields of one variable over a finite field, by an author who has made fundamental contributions to the field. It serves as a definitive reference volume, as well as offering graduate students with a solid understanding of algebraic number theory the opportunity to quickly reach the frontiers of knowledge in an important area of mathematics...The arithmetic of function fields is a universe filled with beautiful surprises, in which familiar objects from classical number theory reappear in new guises, and in which entirely new objects play important roles. Goss'clear exposition and lively style make this book an excellent introduction to this fascinating field." MR 97i:11062

This volume is dedicated to Harvey Cohn, Distinguished Professor Emeritus of Mathematics at City College (CUNY). Harvey was one of the organizers of the New York Number Theory Seminar, and was deeply involved in all aspects of the Seminar from its first meeting in January, 1982, until his retirement in December, 1995. We wish him good health and continued hapiness and success in mathematics. The papers in this volume are revised and expanded versions of lectures delivered in the New York Number Theory Seminar. The Seminar meets weekly at the Graduate School and University Center of the City University of New York (CUNY). In addition, some of the papers in this book were presented at a conference on Combinatorial Number Theory that the New York Number Theory Seminar organized at Lehman College (CUNY). Here is a short description of the papers in this volume. The paper of R. T. Bumby focuses on "elementary" fast algorithms in sums of two and four squares. The actual talk had been accompanied by dazzling computer demonstrations. The detailed review of H. Cohn describes the construction of modular equations as the basis of studies of modular forms in the one-dimensional and Hilbert cases.