The decomposition of the space L2 (G(Q)\G(/A)), where G is a reductive group defined over (Q and /A is the ring of adeles of (Q, is a deep problem at the intersection of number and group theory. Langlands reduced this decomposition to that of the (smaller) spaces of cuspidal automorphic forms for certain subgroups of G. The present book describes this proof in detail. The starting point is the theory of automorphic forms, which can also serve as a first step towards understanding the Arthur-Selberg trace formula. To make the book reasonably self-contained, the authors have also provided essential background to subjects such as automorphic forms, Eisenstein series, Eisenstein pseudo-series (or wave-packets) and their properties. It is thus also an introduction, suitable for graduate students, to the theory of automorphic forms, written using contemporary terminology. It will be welcomed by number theorists, representation theorists, and all whose work involves the Langlands program.

The theory of integer partitions is a subject of enduring interest. A major research area in its own right, it has found numerous applications, and celebrated results such as the Rogers-Ramanujan identities make it a topic filled with the true romance of mathematics. The aim in this introductory textbook is to provide an accessible and wide ranging introduction to partitions, without requiring anything more of the reader than some familiarity with polynomials and infinite series. Many exercises are included, together with some solutions and helpful hints. The book has a short introduction followed by an initial chapter introducing Euler's famous theorem on partitions with odd parts and partitions with distinct parts. This is followed by chapters titled: Ferrers Graphs, The Rogers-Ramanujan Identities, Generating Functions, Formulas for Partition Functions, Gaussian Polynomials, Durfee Squares, Euler Refined, Plane Partitions, Growing Ferrers Boards, and Musings.

A deep understanding of prime numbers is one of the great challenges in mathematics. In this new edition, fundamental theorems, challenging open problems, and the most recent computational records are presented in a language without secrets. The impressive wealth of material and references will make this book a favorite companion and a source of inspiration to all readers.

Paulo Ribenboim is Professor Emeritus at Queen's University in Canada, Fellow of the Royal Society of Canada, and recipient of the George Polya Award of the Mathematical Association of America. He is the author of 13 books and more than 150 research articles.

From the reviews of the First Edition:

Number Theory and mathematics as a whole will benefit from having such an accessible book exposing advanced material. There is no question that this book will succeed in exciting many new people to the beauty and fascination of prime numbers, and will probably bring more young people to research in these areas. (Andrew Granville, Zentralblatt)"

An exciting approach to the history and mathematics of number theory ...the author s style is totally lucid and very easy to read ...the result is indeed a wonderful story. Mathematical Reviews Written in a unique and accessible style for readers of varied mathematical backgrounds, the Second Edition of Primes of the Form p = x2+ ny2 details the history behind how Pierre de Fermat s work ultimately gave birth to quadratic reciprocity and the genus theory of quadratic forms. The book also illustrates how results of Euler and Gauss can be fully understood only in the context of class field theory, and in addition, explores a selection of the magnificent formulas of complex multiplication. Primes of the Form p = x2 + ny2, Second Edition focuses on addressing the question of when a prime p is of the form x2 + ny2, which serves as the basis for further discussion of various mathematical topics. This updated edition has several new notable features, including: A well-motivated introduction to the classical formulation of class field theory Illustrations of explicit numerical examples to demonstrate the power of basic theorems in various situations An elementary treatment of quadratic forms and genus theory Simultaneous treatment of elementary and advanced aspects of number theory New coverage of the Shimura reciprocity law and a selection of recent work in an updated bibliography Primes of the Form p = x2 + ny2, Second Edition is both a useful reference for number theory theorists and an excellent text for undergraduate and graduate-level courses in number and Galois theory.

Volume II provides an advanced approach to the extended gibonacci family, which includes Fibonacci, Lucas, Pell, Pell-Lucas, Jacobsthal, Jacobsthal-Lucas, Vieta, Vieta-Lucas, and Chebyshev polynomials of both kinds. This volume offers a uniquely unified, extensive, and historical approach that will appeal to both students and professional mathematicians. As in Volume I, Volume II focuses on problem-solving techniques such as pattern recognition; conjecturing; proof-techniques, and applications. It offers a wealth of delightful opportunities to explore and experiment, as well as plentiful material for group discussions, seminars, presentations, and collaboration. In addition, the material covered in this book promotes intellectual curiosity, creativity, and ingenuity. Volume II features: A wealth of examples, applications, and exercises of varying degrees of difficulty and sophistication. Numerous combinatorial and graph-theoretic proofs and techniques. A uniquely thorough discussion of gibonacci subfamilies, and the fascinating relationships that link them. Examples of the beauty, power, and ubiquity of the extended gibonacci family. An introduction to tribonacci polynomials and numbers, and their combinatorial and graph-theoretic models. Abbreviated solutions provided for all odd-numbered exercises. Extensive references for further study. This volume will be a valuable resource for upper-level undergraduates and graduate students, as well as for independent study projects, undergraduate and graduate theses. It is the most comprehensive work available, a welcome addition for gibonacci enthusiasts in computer science, electrical engineering, and physics, as well as for creative and curious amateurs.

Sir Peter Swinnerton-Dyer's mathematical career encompasses more than 60 years' work of amazing creativity. This volume provides contemporary insight into several subjects in which Sir Peter's influence has been notable, and is dedicated to his 75th birthday. The opening section reviews some of his many remarkable contributions to mathematics and other fields. The remaining contributions come from leading researchers in analytic and arithmetic number theory, and algebraic geometry. The topics treated include: rational points on algebraic varieties, the Hasse principle, Shafarevich-Tate groups of elliptic curves and motives, Zagier's conjectures, descent and zero-cycles, Diophantine approximation, and Abelian and Fano varieties.

This book provides an elementary, complete account of quasi-Frobenius rings at a level allowing researchers and graduate students to gain entry to the field. A ring is called quasi-Frobenius if it is "right" or "left" selfinjective, and "right" or "left" artinian (all four combinations are equivalent). The study of these rings grew out of the theory of representations of a finite group as a group of matrices over a field, and the present extent of the theory is wide-ranging.

This book contains papers on topics in combinatorics (including graph theory) or number theory. The subject areas within correspond to the MSC (Mathematics Subject Classification) codes 05, 11, 20D60, and 52. Some topics discussed in this compilation include restricted Eisenstein series and certain convolution sums; zeroes of the Hurwitz zeta function in the interval (O,1); prime factorization conditions providing multiplicities in coset partitions of groups; mean value formulas for twisted Edwards curves; binary matrices as morphisms of a triangular category; some diophantine triples and quadruples for quadratic polynomials; codes associated with orthogonal groups; combinatorial sums and series involving inverses of the Gaussian binomial co-effecients; full friendly index sets and full product-cordial index sets of twisted cylinders; and properly charged coloring of two-dimensional arrays.

At first glance the prime numbers appear to be distributed in a very irregular way amongst the integers, but it is possible to produce a simple formula that tells (in an approximate but well-defined sense) how many primes can be found that are less than any integer. The prime number theorem tells what this formula is and it is indisputably one of the the great classical theorems of mathematics. This textbook introduces the prime number theorem and is suitable for advanced undergraduates and beginning graduate students. The author deftly shows how analytical tools can be used in number theory to attack a 'real' problem.

The aim of this book is NOT to cover discrete mathematics in depth. Rather, it discusses a number of selected results and methods, mostly from the areas of combinatorics and graph theory, along with some elementary number theory and combinatorial geometry. The authors develop most topics to the extent that they can describe the discrete mathematics behind an important application of mathematics such as discrete optimization problems, the Law of Large Numbers, cryptography, and coding to name a few. Another feature that is not covered in other discrete mathematics books is the use of ESTIMATES (How many digits does 100! have? or Which is larger: 2100 or 100!?). There are questions posed in the text and problems at the end of each chapter with solutions for many of them at the end of the book. The book is based on a course taught for several years by two of the authors at Yale University.

This text is a self-contained study of expander graphs, specifically, their explicit construction. Expander graphs are highly connected but sparse, and while being of interest within combinatorics and graph theory, they can also be applied to computer science and engineering. Only a knowledge of elementary algebra, analysis and combinatorics is required because the authors provide the necessary background from graph theory, number theory, group theory and representation theory. Thus the text can be used as a brief introduction to these subjects and their synthesis in modern mathematics.

Matrix Methods: Applied Linear Algebra and Sabermetrics, Fourth Edition, provides a unique and comprehensive balance between the theory and computation of matrices. Rapid changes in technology have made this valuable overview on the application of matrices relevant not just to mathematicians, but to a broad range of other fields. Matrix methods, the essence of linear algebra, can be used to help physical scientists-- chemists, physicists, engineers, statisticians, and economists-- solve real world problems.

Now in its second edition, this textbook provides an introduction and overview of number theory based on the density and properties of the prime numbers. This unique approach offers both a firm background in the standard material of number theory, as well as an overview of the entire discipline. All of the essential topics are covered, such as the fundamental theorem of arithmetic, theory of congruences, quadratic reciprocity, arithmetic functions, and the distribution of primes. New in this edition are coverage of p-adic numbers, Hensel's lemma, multiple zeta-values, and elliptic curve methods in primality testing. Key topics and features include: A solid introduction to analytic number theory, including full proofs of Dirichlet's Theorem and the Prime Number Theorem Concise treatment of algebraic number theory, including a complete presentation of primes, prime factorizations in algebraic number fields, and unique factorization of ideals Discussion of the AKS algorithm, which shows that primality testing is one of polynomial time, a topic not usually included in such texts Many interesting ancillary topics, such as primality testing and cryptography, Fermat and Mersenne numbers, and Carmichael numbers The user-friendly style, historical context, and wide range of exercises that range from simple to quite difficult (with solutions and hints provided for select exercises) make Number Theory: An Introduction via the Density of Primes ideal for both self-study and classroom use. Intended for upper level undergraduates and beginning graduates, the only prerequisites are a basic knowledge of calculus, multivariable calculus, and some linear algebra. All necessary concepts from abstract algebra and complex analysis are introduced where needed.

This book introduces the theory of modular forms, from which all rational elliptic curves arise, with an eye toward the Modularity Theorem. Discussion covers elliptic curves as complex tori and as algebraic curves; modular curves as Riemann surfaces and as algebraic curves; Hecke operators and Atkin-Lehner theory; Hecke eigenforms and their arithmetic properties; the Jacobians of modular curves and the Abelian varieties associated to Hecke eigenforms. As it presents these ideas, the book states the Modularity Theorem in various forms, relating them to each other and touching on their applications to number theory. The authors assume no background in algebraic number theory and algebraic geometry. Exercises are included.

New to the Fourth Edition Reorganised and revised chapter seven and thirteen New exercises and examples Expanded, updated references Further historical material on figures besides Galois: Omar Khayyam, Vandermonde, Ruffini, and Abel A new final chapter discussing other directions in which Galois Theory has developed: the inverse Galois problem, differential Galois theory, and a (very) brief introduction to p-adic Galois representations.

Model theory is one of the central branches of mathematical logic. The field has evolved rapidly in the last few decades. This book is an introduction to current trends in model theory, and contains a collection of articles authored by top researchers in the field. It is intended as a reference for students as well as senior researchers.

The discrepancy method has produced the most fruitful line of attack on a pivotal computer science question: What is the computational power of random bits? It has also played a major role in recent developments in complexity theory. This book tells the story of the discrepancy method in a few succinct independent vignettes. The chapters explore such topics as communication complexity, pseudo-randomness, rapidly mixing Markov chains, points on a sphere, derandomization, convex hulls and Voronoi diagrams, linear programming, geometric sampling and VC-dimension theory, minimum spanning trees, circuit complexity, and multidimensional searching. The mathematical treatment is thorough and self-contained, with minimal prerequisites. More information can be found on the book's home page at http://www.cs.princeton.edu/~chazelle/book.html.

This book is a collection of articles in the second volume of the Journal of Combinatorics and Number Theory. As scheduled this volume consists of three issues and it contains nineteen contributed papers from eminent experts or active young mathematicians which cover various important topics in number theory and combinatorics.

This book provides a comprehensive account of a key, perhaps the most important, theory that forms the basis of Taylor-Wiles proof of Fermat's last theorem. Hida begins with an overview of the theory of automorphic forms on linear algebraic groups and then covers the basic theory and recent results on elliptic modular forms, including a substantial simplification of the Taylor-Wiles proof by Fujiwara and Diamond. He offers a detailed exposition of the representation theory of profinite groups (including deformation theory), as well as the Euler characteristic formulas of Galois cohomology groups. The final chapter presents a proof of a non-abelian class number formula.

This volume contains the expanded versions of the lectures given by the authors at the C.I.M.E. instructional conference held in Cetraro, Italy, from July 12 to 19, 1997. The papers collected here are broad surveys of the current research in the arithmetic of elliptic curves, and also contain several new results which cannot be found elsewhere in the literature. Owing to clarity and elegance of exposition, and to the background material explicitly included in the text or quoted in the references, the volume is well suited to research students as well as to senior mathematicians.

Galois theory is a central part of algebra, dealing with symmetries between solutions of algebraic equations in one variable. This collection of papers brings together articles from some of the world's leading experts in this field. Topics center around the Inverse Galois Problem, comprising the full range of methods and approaches in this area, making this an invaluable resource for all those whose research involves Galois theory.

The aim of this book is to provide an introduction to quadratic forms that builds from basics up to the most recent results. Professor Kitaoka is well known for his work in this area, and in this book he covers many aspects of the subject, including lattice theory, Siegel's formula, and some results involving tensor products of positive definite quadratic forms. The reader is required to have only a knowledge of algebraic number fields, making this book ideal for graduate students and researchers wishing for an insight into quadratic forms.

The creation of the science on stem cells and development of its theoretical bases is a prevalent topic today, taking into account comparative evolutionary cell biology and the cardinal problem of the developmental biology. This allows revealing correlations and studying correlative dependencies of various structures at different levels of biohierarchy. The creation of every science is impossible without the application of methodology. This book examines the system of non-traditional ideas about the nature and role of stem cells in ontogenesis, reproduction and evolution of plants. The main properties of plant stem cells have been developed, which has shown the integrity of morphogenous and reproductive processes at all stages of plant's life cycle.

Special functions, which include the trigonometric functions, have been used for centuries. Their role in the solution of differential equations was exploited by Newton and Leibniz, and the subject of special functions has been in continuous development ever since. In just the past thirty years several new special functions and applications have been discovered. This treatise presents an overview of the area of special functions, focusing primarily on the hypergeometric functions and the associated hypergeometric series. It includes both important historical results and recent developments and shows how these arise from several areas of mathematics and mathematical physics. Particular emphasis is placed on formulas that can be used in computation. The book begins with a thorough treatment of the gamma and beta functions that are essential to understanding hypergeometric functions. Later chapters discuss Bessel functions, orthogonal polynomials and transformations, the Selberg integral and its applications, spherical harmonics, q-series, partitions, and Bailey chains. This clear, authoritative work will be a lasting reference for students and researchers in number theory, algebra, combinatorics, differential equations, applied mathematics, mathematical computing, and mathematical physics.

Beginning with a brief introduction to algorithms and diophantine equations, this volume provides a coherent modern account of the methods used to find all the solutions to certain diophantine equations, particularly those developed for use on a computer. The study is divided into three parts, emphasizing approaches with a wide range of applications. The first section considers basic techniques including local methods, sieving, descent arguments and the LLL algorithm. The second section explores problems that can be solved using Baker's theory of linear forms in logarithms. The final section looks at problems associated with curves, focusing on rational and integral points on elliptic curves. Each chapter concludes with a useful set of exercises. A detailed bibliography is included. This book will appeal to graduate students and research workers interested in solving diophantine equations using computational methods.