This volume began as the last part of a one-term graduate course given at the Fields Institute for Research in the Mathematical Sciences in the Autumn of 1993. The course was one of four associated with the 1993-94 Fields Institute programme, which I helped to organise, entitled "Artin L-functions". Published as [132]' the final chapter of the course introduced a manner in which to construct class-group valued invariants from Galois actions on the algebraic K-groups, in dimensions two and three, of number rings. These invariants were inspired by the analogous Chin burg invariants of [34], which correspond to dimensions zero and one. The classical Chinburg invariants measure the Galois structure of classical objects such as units in rings of algebraic integers. However, at the "Galois Module Structure" workshop in February 1994, discussions about my invariant (0,1 (L/ K, 3) in the notation of Chapter 5) after my lecture revealed that a number of other higher-dimensional co homological and motivic invariants of a similar nature were beginning to surface in the work of several authors. Encouraged by this trend and convinced that K-theory is the archetypical motivic cohomology theory, I gratefully took the opportunity of collaboration on computing and generalizing these K-theoretic invariants. These generalizations took several forms - local and global, for example - as I followed part of number theory and the prevalent trends in the "Galois Module Structure" arithmetic geometry.

Dedicated to Jacques Carmona, an expert in noncommutative harmonic analysis, the volume presents excellent invited/refereed articles by top notch mathematicians. Topics cover general Lie theory, reductive Lie groups, harmonic analysis and the Langlands program, automorphic forms, and Kontsevich quantization. Good text for researchers and grad students in representation theory.

It would be difficult to overestimate the influence and importance of modular forms, modular curves, and modular abelian varieties in the development of num- ber theory and arithmetic geometry during the last fifty years. These subjects lie at the heart of many past achievements and future challenges. For example, the theory of complex multiplication, the classification of rational torsion on el- liptic curves, the proof of Fermat's Last Theorem, and many results towards the Birch and Swinnerton-Dyer conjecture all make crucial use of modular forms and modular curves. A conference was held from July 15 to 18, 2002, at the Centre de Recerca Matematica (Bellaterra, Barcelona) under the title "Modular Curves and Abelian Varieties". Our conference presented some of the latest achievements in the theory to a diverse audience that included both specialists and young researchers. We emphasized especially the conjectural generalization of the Shimura-Taniyama conjecture to elliptic curves over number fields other than the field of rational numbers (elliptic Q-curves) and abelian varieties of dimension larger than one (abelian varieties of GL2-type).

This book contains 58 papers from among the 68 papers presented at the Fifth International Conference on Fibonacci Numbers and Their Applications which was held at the University of St. Andrews, St. Andrews, Fife, Scotland from July 20 to July 24, 1992. These papers have been selected after a careful review by well known referees in the field, and they range from elementary number theory to probability and statistics. The Fibonacci numbers and recurrence relations are their unifying bond. It is anticipated that this book, like its four predecessors, will be useful to research workers and graduate students interested in the Fibonacci numbers and their applications. June 5, 1993 The Editors Gerald E. Bergum South Dakota State University Brookings, South Dakota, U.S.A. Alwyn F. Horadam University of New England Armidale, N.S.W., Australia Andreas N. Philippou Government House Z50 Nicosia, Cyprus xxv THE ORGANIZING COMMITTEES LOCAL COMMITTEE INTERNATIONAL COMMITTEE Campbell, Colin M., Co-Chair Horadam, A.F. (Australia), Co-Chair Phillips, George M., Co-Chair Philippou, A.N. (Cyprus), Co-Chair Foster, Dorothy M.E. Ando, S. (Japan) McCabe, John H. Bergum, G.E. (U.S.A.) Filipponi, P. (Italy) O'Connor, John J.

From the reviews: "This is a great book, which will hopefully become a classic in the subject of differential Galois theory. ...] the specialist, as well as the novice, have long been missing an introductory book covering also specific and advanced research topics. This gap is filled by the volume under review, and more than satisfactorily." Mathematical Reviews

This volume of new research papers marks the 20th anniversary of the New York Number Theory Seminar (NYNTS). Since 1982, NYNTS has presented a range of research in number theory and related fields of mathematics, from physics to geometry to combinatorics and computer science. The speakers have included Field medalists as well as promising lesser known mathematicians whose theorems are significant. The papers presented here are all previously unpublished.

This English translation of Karatsuba's Basic Analytic Number Theory follows closely the second Russian edition, published in Moscow in 1983. For the English edition, the author has considerably rewritten Chapter I, and has corrected various typographical and other minor errors throughout the the text. August, 1991 Melvyn B. Nathanson Introduction to the English Edition It gives me great pleasure that Springer-Verlag is publishing an English trans lation of my book. In the Soviet Union, the primary purpose of this monograph was to introduce mathematicians to the basic results and methods of analytic number theory, but the book has also been increasingly used as a textbook by graduate students in many different fields of mathematics. I hope that the English edition will be used in the same ways. I express my deep gratitude to Professor Melvyn B. Nathanson for his excellent translation and for much assistance in correcting errors in the original text. A.A. Karatsuba Introduction to the Second Russian Edition Number theory is the study of the properties of the integers. Analytic number theory is that part of number theory in which, besides purely number theoretic arguments, the methods of mathematical analysis play an essential role."

Written by an authority with great practical and teaching experience in the field, this book addresses a number of topics in computational number theory. Chapters one through five form a homogenous subject matter suitable for a six-month or year-long course in computational number theory. The subsequent chapters deal with more miscellaneous subjects.

The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These methods and techniques are based on bounds of character sums and numbers of solutions of some polynomial equations over finite fields and residue rings. It also contains a number of open problems and proposals for further research. We obtain several lower bounds, exponential in terms of logp, on the de grees and orders of * polynomials; * algebraic functions; * Boolean functions; * linear recurring sequences; coinciding with values of the discrete logarithm modulo a prime p at suf ficiently many points (the number of points can be as small as pI/He). These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1. The case of d = 2 is of special interest since it corresponds to the representation of the right most bit of the discrete logarithm and defines whether the argument is a quadratic residue. We also obtain non-trivial upper bounds on the de gree, sensitivity and Fourier coefficients of Boolean functions on bits of x deciding whether x is a quadratic residue. These results are used to obtain lower bounds on the parallel arithmetic and Boolean complexity of computing the discrete logarithm. For example, we prove that any unbounded fan-in Boolean circuit. of sublogarithmic depth computing the discrete logarithm modulo p must be of superpolynomial size.

During the last twenty-five years quite remarkable relations between nonas sociative algebra and differential geometry have been discovered in our work. Such exotic structures of algebra as quasigroups and loops were obtained from purely geometric structures such as affinely connected spaces. The notion ofodule was introduced as a fundamental algebraic invariant of differential geometry. For any space with an affine connection loopuscular, odular and geoodular structures (partial smooth algebras of a special kind) were introduced and studied. As it happened, the natural geoodular structure of an affinely connected space al lows us to reconstruct this space in a unique way. Moreover, any smooth ab stractly given geoodular structure generates in a unique manner an affinely con nected space with the natural geoodular structure isomorphic to the initial one. The above said means that any affinely connected (in particular, Riemannian) space can be treated as a purely algebraic structure equipped with smoothness. Numerous habitual geometric properties may be expressed in the language of geoodular structures by means of algebraic identities, etc.. Our treatment has led us to the purely algebraic concept of affinely connected (in particular, Riemannian) spaces; for example, one can consider a discrete, or, even, finite space with affine connection (in the form ofgeoodular structure) which can be used in the old problem of discrete space-time in relativity, essential for the quantum space-time theory."

Effective Polynomial Computation is an introduction to the algorithms of computer algebra. It discusses the basic algorithms for manipulating polynomials including factoring polynomials. These algorithms are discussed from both a theoretical and practical perspective. Those cases where theoretically optimal algorithms are inappropriate are discussed and the practical alternatives are explained. Effective Polynomial Computation provides much of the mathematical motivation of the algorithms discussed to help the reader appreciate the mathematical mechanisms underlying the algorithms, and so that the algorithms will not appear to be constructed out of whole cloth. Preparatory to the discussion of algorithms for polynomials, the first third of this book discusses related issues in elementary number theory. These results are either used in later algorithms (e.g. the discussion of lattices and Diophantine approximation), or analogs of the number theoretic algorithms are used for polynomial problems (e.g. Euclidean algorithm and p-adic numbers). Among the unique features of Effective Polynomial Computation is the detailed material on greatest common divisor and factoring algorithms for sparse multivariate polynomials. In addition, both deterministic and probabilistic algorithms for irreducibility testing of polynomials are discussed.

Srinivasa Ramanujan is, arguably, the greatest mathematician that India has produced. His story is quite unusual: although he had no formal education inmathematics, he taught himself, and managed to produce many important new results. With the support of the English number theorist G. H. Hardy, Ramanujan received a scholarship to go to England and study mathematics. He died very young, at the age of 32, leaving behind three notebooks containing almost 3000 theorems, virtually all without proof. G. H. Hardy and others strongly urged that notebooks be edited and published, and the result is this series of books. This volume dealswith Chapters 1-9 of Book II; each theorem is either proved, or a reference to a proof is given.

In the modern age of almost universal computer usage, practically every individual in a technologically developed society has routine access to the most up-to-date cryptographic technology that exists, the so-called RSA public-key cryptosystem. A major component of this system is the factorization of large numbers into their primes. Thus an ancient number-theory concept now plays a crucial role in communication among millions of people who may have little or no knowledge of even elementary mathematics. The independent structure of each chapter of the book makes it highly readable for a wide variety of mathematicians, students of applied number theory, and others interested in both study and research in number theory and cryptography.

A beautiful and relatively elementary account of a part of mathematics where three main fields - algebra, analysis and geometry - meet. The book provides a broad view of these subjects at the level of calculus, without being a calculus book. Its roots are in arithmetic and geometry, the two opposite poles of mathematics, and the source of historic conceptual conflict. The resolution of this conflict, and its role in the development of mathematics, is one of the main stories in the book. Stillwell has chosen an array of exciting and worthwhile topics and elegantly combines mathematical history with mathematics. He covers the main ideas of Euclid, but with 2000 years of extra insights attached. Presupposing only high school algebra, it can be read by any well prepared student entering university. Moreover, this book will be popular with graduate students and researchers in mathematics due to its attractive and unusual treatment of fundamental topics. A set of well-written exercises at the end of each section allows new ideas to be instantly tested and reinforced.

Recent Developments in Infinite-Dimensional Analysis and Quantum Probability is dedicated to Professor Takeyuki Hida on the occasion of his 70th birthday. The book is more than a collection of articles. In fact, in it the reader will find a consistent editorial work, devoted to attempting to obtain a unitary picture from the different contributions and to give a comprehensive account of important recent developments in contemporary white noise analysis and some of its applications. For this reason, not only the latest results, but also motivations, explanations and connections with previous work have been included. The wealth of applications, from number theory to signal processing, from optimal filtering to information theory, from the statistics of stationary flows to quantum cable equations, show the power of white noise analysis as a tool. Beyond these, the authors emphasize its connections with practically all branches of contemporary probability, including stochastic geometry, the structure theory of stationary Gaussian processes, Neumann boundary value problems, and large deviations.

For many years, Serge Lang has given talks on selected items in mathematics which could be extracted at a level understandable by those who have had calculus. Written in a conversational tone, Lang now presents a collection of those talks as a book covering such topics as: prime numbers, the abc conjecture, approximation theorems of analysis, Bruhat-Tits spaces, and harmonic and symmetric polynomials. Each talk is written in a lively and informal style meant to engage any reader looking for further insight into mathematics.

Number theory, the branch of mathematics that studies the properties of the integers, is a repository of interesting and quite varied problems, sometimes impossibly difficult ones. In this book, the authors have gathered together a collection of problems from various topics in number theory that they find beautiful, intriguing, and from a certain point of view instructive.

This text originated as a lecture delivered November 20, 1984, at Queen's University, in the undergraduate colloquium senes. In another colloquium lecture, my colleague Morris Orzech, who had consulted the latest edition of the Guinness Book of Records, reminded me very gently that the most "innumerate" people of the world are of a certain trible 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 decimal digits of the number Te. "I assure you, Morris, that in spite of the beauty of the appar ent randomness of the decimal digits of Te, I'll be sure that my text will include also some words." And then I proceeded putting together the magic combina tion of words and numbers, which became The Book of Prime Number Records. If you have seen it, only extreme curiosity could impel you to have this one in your hands. The New Book of Prime Number Records differs little from its predecessor in the general planning. But it contains new sections and updated records.

Most people tend to view number theory as the very paradigm of pure mathematics. With the advent of computers, however, number theory has been finding an increasing number of applications in practical settings, such as in cryptography, random number generation, coding theory, and even concert hall acoustics. Yet other applications are still emerging - providing number theorists with some major new areas of opportunity. The 1996 IMA summer program on Emerging Applications of Number Theory was aimed at stimulating further work with some of these newest (and most attractive) applications. Concentration was on number theory's recent links with: (a) wave phenomena in quantum mechanics (more specifically, quantum chaos); and (b) graph theory (especially expander graphs and related spectral theory). This volume contains the contributed papers from that meeting and will be of interest to anyone intrigued by novel applications of modern number-theoretical techniques.

Rigid (analytic) spaces were invented to describe degenerations, reductions, and moduli of algebraic curves and abelian varieties. This work, a revised and greatly expanded new English edition of an earlier French text by the same authors, presents important new developments and applications of the theory of rigid analytic spaces to abelian varieties, "points of rigid spaces," etale cohomology, Drinfeld modular curves, and Monsky-Washnitzer cohomology. The exposition is concise, self-contained, rich in examples and exercises, and will serve as an excellent graduate-level text for the classroom or for self-study."

This self-contained text presents quantum mechanics from the point of view of some computational examples with a mixture of mathematical clarity often not found in texts offering only a purely physical point of view. Emphasis is placed on the systematic application of the Nikiforov-- Uvarov theory of generalized hypergeometric differential equations to solve the Schr"dinger equation and to obtain the quantization of energies from a single unified point of view.

This volume contains the refereed proceedings of the Workshop on Cryptography and Computational Number Theory, CCNT'99, which has been held in Singapore during the week of November 22-26, 1999. The workshop was organized by the Centre for Systems Security of the Na tional University of Singapore. We gratefully acknowledge the financial support from the Singapore National Science and Technology Board under the grant num ber RP960668/M. The idea for this workshop grew out of the recognition of the recent, rapid development in various areas of cryptography and computational number the ory. The event followed the concept of the research programs at such well-known research institutions as the Newton Institute (UK), Oberwolfach and Dagstuhl (Germany), and Luminy (France). Accordingly, there were only invited lectures at the workshop with plenty of time for informal discussions. It was hoped and successfully achieved that the meeting would encourage and stimulate further research in information and computer security as well as in the design and implementation of number theoretic cryptosystems and other related areas. Another goal of the meeting was to stimulate collaboration and more active interaction between mathematicians, computer scientists, practical cryptographers and engineers in academia, industry and government."

Ernst Witt, 1911-1991, was one of the most ingenious mathematicians of this century and has decisively shaped the development of various mathematical fields like algebra, number theory, group theory, combinatorics and Lie theory. This volume offers a complete collection of Witt's research papers; it also contains never before published articles, facsimiles and photos. Commentary by other authors provide an excellent survey on the further development of these mathematical fields.

It is gratifying that this textbook is still sufficiently popular to warrant a third edition. I have used the opportunity to improve and enlarge the book. When the second edition was prepared, only two pages on algebraic geometry codes were added. These have now been removed and replaced by a relatively long chapter on this subject. Although it is still only an introduction, the chapter requires more mathematical background of the reader than the remainder of this book. One of the very interesting recent developments concerns binary codes defined by using codes over the alphabet 7l.4 There is so much interest in this area that a chapter on the essentials was added. Knowledge of this chapter will allow the reader to study recent literature on 7l. -codes. 4 Furthermore, some material has been added that appeared in my Springer Lec ture Notes 201, but was not included in earlier editions of this book, e. g. Generalized Reed-Solomon Codes and Generalized Reed-Muller Codes. In Chapter 2, a section on "Coding Gain" ( the engineer's justification for using error-correcting codes) was added. For the author, preparing this third edition was a most welcome return to mathematics after seven years of administration. For valuable discussions on the new material, I thank C.P.l.M.Baggen, I. M.Duursma, H.D.L.Hollmann, H. C. A. van Tilborg, and R. M. Wilson. A special word of thanks to R. A. Pellikaan for his assistance with Chapter 10."

The history of continued fractions is certainly one of the longest among those of mathematical concepts, since it begins with Euclid's algorithm for the great est common divisor at least three centuries B.C. As it is often the case and like Monsieur Jourdain in Moliere's "Ie bourgeois gentilhomme" (who was speak ing in prose though he did not know he was doing so), continued fractions were used for many centuries before their real discovery. The history of continued fractions and Pade approximants is also quite im portant, since they played a leading role in the development of some branches of mathematics. For example, they were the basis for the proof of the tran scendence of 11' in 1882, an open problem for more than two thousand years, and also for our modern spectral theory of operators. Actually they still are of great interest in many fields of pure and applied mathematics and in numerical analysis, where they provide computer approximations to special functions and are connected to some convergence acceleration methods. Con tinued fractions are also used in number theory, computer science, automata, electronics, etc ..."