This is a new approach to the theory of non-holomorphic modular forms, based on ideas from quantization theory or pseudodifferential analysis. Extending the Rankin-Selberg method so as to apply it to the calculation of the Roelcke-Selberg decomposition of the product of two Eisenstein series, one lets Maass cusp-forms appear as residues of simple, Eisenstein-like, series. Other results, based on quantization theory, include a reinterpretation of the Lax-Phillips scattering theory for the automorphic wave equation, in terms of distributions on R2 automorphic with respect to the linear action of SL(2, Z)

Many classical and modern results and quadratic forms are brought together in this book. The treatment is self-contained and of a totally elementary nature requiring only a basic knowledge of rings, fields, polynomials, and matrices, such that the works of Pfister, Hilbert, Hurwitz and others are easily accessible to non-experts and undergraduates alike. The author deals with many different approaches to the study of squares; from the classical works of the late 19th century, to areas of current research. Anyone with an interest in algebra or number theory will find this a most fascinating volume.

In this tract, Professor Moreno develops the theory of algebraic curves over finite fields, their zeta and L-functions, and, for the first time, the theory of algebraic geometric Goppa codes on algebraic curves. Among the applications considered are: the problem of counting the number of solutions of equations over finite fields; Bombieri's proof of the Reimann hypothesis for function fields, with consequences for the estimation of exponential sums in one variable; Goppa's theory of error-correcting codes constructed from linear systems on algebraic curves; there is also a new proof of the TsfasmanSHVladutSHZink theorem. The prerequisites needed to follow this book are few, and it can be used for graduate courses for mathematics students. Electrical engineers who need to understand the modern developments in the theory of error-correcting codes will also benefit from studying this work.

Peter Giblin describes, in the context of an introduction to the theory of numbers, some of the more elementary methods for factorization and primality testing; that is, methods independent of a knowledge of other areas of mathematics. Indeed everything is developed from scratch so the mathematical prerequisites are minimal. An essential feature of the book is the large number of computer programs (written in Pascal) and a wealth of computational exercises and projects, in addition to more usual theory exercises. The theoretical development includes continued fractions and quadratic residues, directed always towards the two fundamental problems of primality testing and factorization. There is time, all the same, to include a number of topics and projects of a purely "recreational" nature.

This introduction to algebraic number theory via the famous problem of "Fermats Last Theorem" follows its historical development, beginning with the work of Fermat and ending with Kummers theory of "ideal" factorization. The more elementary topics, such as Eulers proof of the impossibilty of x+y=z, are treated in an uncomplicated way, and new concepts and techniques are introduced only after having been motivated by specific problems. The book also covers in detail the application of Kummers theory to quadratic integers and relates this to Gauss'theory of binary quadratic forms, an interesting and important connection that is not explored in any other book.

This book is a comprehensive and systematic account of the theory of p-adic and classical modular forms and the theory of the special values of arithmetic L-functions and p-adic L-functions. The approach is basically algebraic, and the treatment is elementary. No deep knowledge from algebraic geometry and representation theory is required. The author's main tool in dealing with these problems is taken from cohomology theory over Riemann surfaces, which is also explained in detail in the book. He also gives a concise but thorough treatment of analytic continuation and functional equation. Graduate students wishing to know more about L-functions will find this a unique introduction to this fascinating branch of mathematics.

This book is a comprehensive and systematic account of the theory of p-adic and classical modular forms and the theory of the special values of arithmetic L-functions and p-adic L-functions. The approach is basically algebraic, and the treatment is elementary. No deep knowledge from algebraic geometry and representation theory is required. The author's main tool in dealing with these problems is taken from cohomology theory over Riemann surfaces, which is also explained in detail in the book. He also gives a concise but thorough treatment of analytic continuation and functional equation. Graduate students wishing to know more about L-functions will find this a unique introduction to this fascinating branch of mathematics.

This book originates from graduate courses given in Cambridge and London. It provides a brisk, thorough treatment of the foundations of algebraic number theory, and builds on that to introduce more advanced ideas. Throughout, the authors emphasise the systematic development of techniques for the explicit calculation of the basic invariants, such as rings of integers, class groups, and units. Moreover they combine, at each stage of development, theory with explicit computations and applications, and provide motivation in terms of classical number-theoretic problems. A number of special topics are included that can be treated at this level but can usually only be found in research monographs or original papers, for instance: module theory of Dedekind domains; tame and wild ramifications; Gauss series and Gauss periods; binary quadratic forms; and Brauer relations. This is the only textbook at this level which combines clean, modern algebraic techniques together with a substantial arithmetic content. It will be indispensable for all practising and would-be algebraic number theorists.

Leading researchers in the field of coding theory and cryptography present their newest findings, published here for the first time following a presentation at the International Conference on Coding Theory, Cryptography and Related Areas. The authors include Tom Hoeholdt, Henning Stichtenoth, and Horacio Tapia-Recillas.

The book lays algebraic foundations for real geometry through a systematic investigation of partially ordered rings of semi-algebraic functions. Real spectra serve as primary geometric objects, the maps between them are determined by rings of functions associated with the spectra. The many different possible choices for these rings of functions are studied via reflections of partially ordered rings. Readers should feel comfortable using basic algebraic and categorical concepts. As motivational background some familiarity with real geometry will be helpful. The book aims at researchers and graduate students with an interest in real algebra and geometry, ordered algebraic structures, topology and rings of continuous functions.

This book constitutes the refereed proceedings of the 4th International Algorithmic Number Theory Symposium, ANTS-IV, held in Leiden, The Netherlands, in July 2000.The book presents 36 contributed papers which have gone through a thorough round of reviewing, selection and revision. Also included are 4 invited survey papers. Among the topics addressed are gcd algorithms, primality, factoring, sieve methods, cryptography, linear algebra, lattices, algebraic number fields, class groups and fields, elliptic curves, polynomials, function fields, and power sums.

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.

Combinatorics and Number Theory of Counting Sequences is an introduction to the theory of finite set partitions and to the enumeration of cycle decompositions of permutations. The presentation prioritizes elementary enumerative proofs. Therefore, parts of the book are designed so that even those high school students and teachers who are interested in combinatorics can have the benefit of them. Still, the book collects vast, up-to-date information for many counting sequences (especially, related to set partitions and permutations), so it is a must-have piece for those mathematicians who do research on enumerative combinatorics. In addition, the book contains number theoretical results on counting sequences of set partitions and permutations, so number theorists who would like to see nice applications of their area of interest in combinatorics will enjoy the book, too. Features The Outlook sections at the end of each chapter guide the reader towards topics not covered in the book, and many of the Outlook items point towards new research problems. An extensive bibliography and tables at the end make the book usable as a standard reference. Citations to results which were scattered in the literature now become easy, because huge parts of the book (especially in parts II and III) appear in book form for the first time.

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

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.

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.

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.

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