Harold Davenport was one of the truly great mathematicians of the twentieth century. Based on lectures he gave at the University of Michigan in the early 1960s, this book is concerned with the use of analytic methods in the study of integer solutions to Diophantine equations and Diophantine inequalities. It provides an excellent introduction to a timeless area of number theory that is still as widely researched today as it was when the book originally appeared. The three main themes of the book are Waring's problem and the representation of integers by diagonal forms, the solubility in integers of systems of forms in many variables, and the solubility in integers of diagonal inequalities. For the second edition of the book a comprehensive foreword has been added in which three prominent authorities describe the modern context and recent developments. A thorough bibliography has also been added.

The 8th International Conference on Cryptology and Network Security (CANS 2009) was held at the Ishikawa Prefectural Museum of Art in Kanazawa, Japan, during December 12-14, 2009. The conference was jointly co-organized by the NationalInstituteofAdvancedIndustrialScienceandTechnology(AIST), Japan, and the Japan Advanced Institute of Science and Technology (JAIST). In ad- tion, the event was supported by the Special Interest Group on Computer Se- rity (CSEC), IPSJ, Japan, the Japan Technical Group on Information Security (ISEC), IEICE, the Japan Technical Committee on Information and Com- nication System Security(ICSS), IEICE, and the Society of Information Theory and its Applications (SITA), Japan, and co-sponsored by the National Ins- tute of Information and Communications Technology, Japan, ComWorth Co., LTD, Japan, Hitachi, Ltd., Hokuriku Telecommunication Network Co., Inc., and Internet Initiative Japan Inc. The conference received 109 submissions from 24 countries, out of which 32 were accepted for publication in these proceedings. At least three Program Committee (PC) members reviewed each submitted paper, while submissions co-authored by a PC member were submitted to the more stringent evaluation of ?ve PC members. In addition to the PC members, many external reviewers joinedthereviewprocessintheirparticularareasofexpertise. Wewerefortunate to have this energetic team of experts, and are deeply grateful to all of them for their hard work, which included a very active discussion phase-almost as long as the initial individual reviewing period. The paper submission, review and discussion processes were e?ectively and e?ciently made possible by the Web-based system iChair.

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.

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.

The ?rst Algorithmic Number Theory Symposium took place in May 1994 at Cornell University. The preface to its proceedings has the organizers expressing the hope that the meeting would be "the ?rst in a long series of international conferencesonthe algorithmic, computational, andcomplexity theoreticaspects of number theory." ANTS VIII was held May 17-22, 2008 at the Ban? Centre in Ban?, Alberta, Canada. It was the eighth in this lengthening series. The conference included four invited talks, by Johannes Buchmann (TU Darmstadt), AndrewGranville(UniversitedeMontr eal), Fran, coisMorain(Ecole Polytechnique), andHughWilliams(UniversityofCalgary), apostersession, and 28 contributed talks in appropriate areas of number theory. Each submitted paper was reviewed by at least two experts external to the Program Committee; the selection was made by the committee on the basis of thoserecommendations.TheSelfridgePrizeincomputationalnumbertheorywas awardedtotheauthorsofthebestcontributedpaperpresentedattheconference. The participants in the conference gratefully acknowledge the contribution made by the sponsors of the meeting. May 2008 Alf van der Poorten and Andreas Stein (Editors) Renate Scheidler (Organizing Committee Chair) Igor Shparlinski (Program Committee Chair) Conference Website The names of the winners of the Selfridge Prize, material supplementing the contributed papers, and errata for the proceedings, as well as the abstracts of the posters and the posters presented at ANTS VIII, can be found at: http: //ants.math.ucalgary.ca."

Number Theory is more than a comprehensive treatment of the subject. It is an introduction to topics in higher level mathematics, and unique in its scope; topics from analysis, modern algebra, and discrete mathematics are all included.

The book is divided into two parts. Part A covers key concepts of number theory and could serve as a first course on the subject. Part B delves into more advanced topics and an exploration of related mathematics. The prerequisites for this self-contained text are elements from linear algebra. Valuable references for the reader are collected at the end of each chapter. It is suitable as an introduction to higher level mathematics for undergraduates, or for self-study.

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.

Algebraic number theory is a subject which came into being through the attempts of mathematicians to try to prove Fermat's last theorem and which now has a wealth of applications to diophantine equations, cryptography, factoring, primality testing and public-key cryptosystems. This book provides an introduction to the subject suitable for senior undergraduates and beginning graduate students in mathematics. The material is presented in a straightforward, clear and elementary fashion, and the approach is hands on, with an explicit computational flavour. Prerequisites are kept to a minimum, and numerous examples illustrating the material occur throughout the text. References to suggested reading and to the biographies of mathematicians who have contributed to the development of algebraic number theory are given at the end of each chapter. There are over 320 exercises, an extensive index, and helpful location guides to theorems and lemmas in the text.

Algebraic number theory is a subject which came into being through the attempts of mathematicians to try to prove Fermat's last theorem and which now has a wealth of applications to diophantine equations, cryptography, factoring, primality testing and public-key cryptosystems. This book provides an introduction to the subject suitable for senior undergraduates and beginning graduate students in mathematics. The material is presented in a straightforward, clear and elementary fashion, and the approach is hands on, with an explicit computational flavour. Prerequisites are kept to a minimum, and numerous examples illustrating the material occur throughout the text. References to suggested reading and to the biographies of mathematicians who have contributed to the development of algebraic number theory are given at the end of each chapter. There are over 320 exercises, an extensive index, and helpful location guides to theorems and lemmas in the text.

In this volume one finds basic techniques from algebra and number theory (e.g. congruences, unique factorization domains, finite fields, quadratic residues, primality tests, continued fractions, etc.) which in recent years have proven to be extremely useful for applications to cryptography and coding theory. Both cryptography and codes have crucial applications in our daily lives, and they are described here, while the complexity problems that arise in implementing the related numerical algorithms are also taken into due account. Cryptography has been developed in great detail, both in its classical and more recent aspects. In particular public key cryptography is extensively discussed, the use of algebraic geometry, specifically of elliptic curves over finite fields, is illustrated, and a final chapter is devoted to quantum cryptography, which is the new frontier of the field. Coding theory is not discussed in full; however a chapter, sufficient for a good introduction to the subject, has been devoted to linear codes. Each chapter ends with several complements and with an extensive list of exercises, the solutions to most of which are included in the last chapter.

Though the book contains advanced material, such as cryptography on elliptic curves, Goppa codes using algebraic curves over finite fields, and the recent AKS polynomial primality test, the authors' objective has been to keep the exposition as self-contained and elementary as possible. Therefore the book will be useful to students and researchers, both in theoretical (e.g. mathematicians) and in applied sciences (e.g. physicists, engineers, computer scientists, etc.) seeking a friendly introduction to the important subjects treated here. The book will also be useful for teachers who intend to give courses on these topics.

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.

Local Newforms for GSp(4) describes a theory of new- and oldforms for representations of GSp(4) over a non-archimedean local field. This theory considers vectors fixed by the paramodular groups, and singles out certain vectors that encode canonical information, such as L-factors and epsilon-factors, through their Hecke and Atkin-Lehner eigenvalues. While there are analogies to the GL(2) case, this theory is novel and unanticipated by the existing framework of conjectures. An appendix includes extensive tables about the results and the representation theory of GSp(4).

Like the intriguing Fibonacci and Lucas numbers, Catalan numbers are also ubiquitous. "They have the same delightful propensity for popping up unexpectedly, particularly in combinatorial problems," Martin Gardner wrote in Scientific American. "Indeed, the Catalan sequence is probably the most frequently encountered sequence that is still obscure enough to cause mathematicians lacking access to Sloane's Handbook of Integer Sequences to expend inordinate amounts of energy re-discovering formulas that were worked out long ago," he continued. As Gardner noted, many mathematicians may know the abc's of Catalan sequence, but not many are familiar with the myriad of their unexpected occurrences, applications, and properties; they crop up in chess boards, computer programming, and even train tracks. This book presents a clear and comprehensive introduction to one of the truly fascinating topics in mathematics. Catalan numbers are named after the Belgian mathematician Eugene Charles Catalan (1814-1894), who "discovered" them in 1838, though he was not the first person to discover them. The great Swiss mathematician Leonhard Euler (1707-1763) "discovered" them around 1756, but even before then and though his work was not known to the outside world, Chinese mathematician Antu Ming (1692?-1763) first discovered Catalan numbers about 1730. A great source of fun for both amateurs and mathematicians, they can be used by teachers and professors to generate excitement among students for exploration and intellectual curiosity and to sharpen a variety of mathematical skills and tools, such as pattern recognition, conjecturing, proof-techniques, and problem-solving techniques. This book is not intended for mathematicians only but for a much larger audience, including high school students, math and science teachers, computer scientists, and those amateurs with a modicum of mathematical curiosity. An invaluable resource book, it contains an intriguing array of applications to computer science, abstract algebra, combinatorics, geometry, graph theory, chess, and world series.

This undergraduate-level introduction describes those mathematical properties of prime numbers that can be deduced with the tools of calculus. Jeffrey Stopple pays special attention to the rich history of the subject and ancient questions on polygonal numbers, perfect numbers and amicable pairs, as well as to the important open problems. The culmination of the book is a brief presentation of the Riemann zeta function, which determines the distribution of prime numbers, and of the significance of the Riemann Hypothesis.

This undergraduate-level introduction describes those mathematical properties of prime numbers that can be deduced with the tools of calculus. Jeffrey Stopple pays special attention to the rich history of the subject and ancient questions on polygonal numbers, perfect numbers and amicable pairs, as well as to the important open problems. The culmination of the book is a brief presentation of the Riemann zeta function, which determines the distribution of prime numbers, and of the significance of the Riemann Hypothesis.

Many of the important and creative developments in modern mathematics resulted from attempts to solve questions that originate in number theory. The publication of Emil Grosswald's classic text presents an illuminating introduction to number theory. Combining the historical developments with the analytical approach, Topics from the Theory of Numbers offers the reader a diverse range of subjects to investigate.

This book is a modern treatment of the theory of theta functions in the context of algebraic geometry. The novelty of its approach lies in the systematic use of the Fourier-Mukai transform. Alexander Polishchuk starts by discussing the classical theory of theta functions from the viewpoint of the representation theory of the Heisenberg group (in which the usual Fourier transform plays the prominent role). He then shows that in the algebraic approach to this theory (originally due to Mumford) the Fourier-Mukai transform can often be used to simplify the existing proofs or to provide completely new proofs of many important theorems. This incisive volume is for graduate students and researchers with strong interest in algebraic geometry.

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.

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.

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.

Alan Baker's 60th birthday in August 1999 offered an ideal opportunity to organize a conference at ETH Zurich with the goal of presenting the state of the art in number theory and geometry. Many of the leaders in the subject were brought together to present an account of research in the last century as well as speculations for possible further research. The papers in this volume cover a broad spectrum of number theory including geometric, algebrao-geometric and analytic aspects. This volume will appeal to number theorists, algebraic geometers, and geometers with a number theoretic background. However, it will also be valuable for mathematicians (in particular research students) who are interested in being informed in the state of number theory at the start of the 21st century and in possible developments for the future.

This book grew out of three series of lectures given at the summer school on "Modular Forms and their Applications" at the Sophus Lie Conference Center in Nordfjordeid in June 2004. The first series treats the classical one-variable theory of elliptic modular forms. The second series presents the theory of Hilbert modular forms in two variables and Hilbert modular surfaces. The third series gives an introduction to Siegel modular forms and discusses a conjecture by Harder. It also contains Harder's original manuscript with the conjecture.

Each part treats a number of beautiful applications.

In this volume the author further develops his philosophy of quantum interpolation between the real numbers and the p-adic numbers. The p-adic numbers contain the p-adic integers Zp which are the inverse limit of the finite rings Z/pn. This gives rise to a tree, and probability measures w on Zp correspond to Markov chains on this tree. From the tree structure one obtains special basis for the Hilbert space L2(Zp, w). The real analogue of the p-adic integers is the interval -1,1], and a probability measure w on it gives rise to a special basis for L2( -1,1], w) - the orthogonal polynomials, and to a Markov chain on "finite approximations" of -1,1]. For special (gamma and beta) measures there is a "quantum" or "q-analogue" Markov chain, and a special basis, that within certain limits yield the real and the p-adic theories. This idea can be generalized variously. In representation theory, it is the quantum general linear group GLn(q)that interpolates between the p-adic group GLn(Zp), and between its real (and complex) analogue -the orthogonal On (and unitary Un )groups. There is a similar quantum interpolation between the real and p-adic Fourier transform and between the real and p-adic (local unramified part of) Tate thesis, and Weil explicit sums.

This is an elementary introduction to the representation theory of real and complex matrix groups. The text is written for students in mathematics and physics who have a good knowledge of differential/integral calculus and linear algebra and are familiar with basic facts from algebra, number theory and complex analysis. The goal is to present the fundamental concepts of representation theory, to describe the connection between them, and to explain some of their background. The focus is on groups which are of particular interest for applications in physics and number theory (e.g. Gell-Mann's eightfold way and theta functions, automorphic forms). The reader finds a large variety of examples which are presented in detail and from different points of view.

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.