Bücher der Reihe Graduate Texts in Mathematics

This textbook introduces enumerative combinatorics through the framework of formal languages and bijections. By starting with elementary operations on words and languages, the authors paint an insightful, unified picture for readers entering the field. Numerous concrete examples and illustrative metaphors motivate the theory throughout, while the overall approach illuminates the important connections between discrete mathematics and theoretical computer science.Beginning with the basics of formal languages, the first chapter quickly establishes a common setting for modeling and counting classical combinatorial objects and constructing bijective proofs. From here, topics are modular and offer substantial flexibility when designing a course. Chapters on generating functions and partitions build further fundamental tools for enumeration and include applications such as a combinatorial proof of the Lagrange inversion formula. Connections to linear algebra emerge in chapters studying Cayley trees, determinantal formulas, and the combinatorics that lie behind the classical Cayley¿Hamilton theorem. The remaining chapters range across the Inclusion-Exclusion Principle, graph theory and coloring, exponential structures, matching and distinct representatives, with each topic opening many doors to further study. Generous exercise sets complement all chapters, and miscellaneous sections explore additional applications.Lessons in Enumerative Combinatorics captures the authors' distinctive style and flair for introducing newcomers to combinatorics. The conversational yet rigorous presentation suits students in mathematics and computer science at the graduate, or advanced undergraduate level. Knowledge of single-variable calculus and the basics of discrete mathematics is assumed; familiarity with linear algebra will enhance the study of certain chapters.

This book introduces the theory of modular forms with an eye toward the Modularity Theorem:All rational elliptic curves arise from modular forms. The topics covered include¿ 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, ¿ elliptic and modular curves modulo p and the Eichler¿Shimura Relation, ¿ the Galois representations associated to elliptic curves and 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.A First Course in Modular Forms is written for beginning graduate students and advanced undergraduates. It does not require background in algebraic number theory or algebraic geometry, and it contains exercises throughout.Fred Diamond received his Ph.D from Princeton University in 1988 under the direction of Andrew Wiles and now teaches at King's College London. Jerry Shurman received his Ph.D from Princeton University in 1988 under the direction of Goro Shimura and now teaches at Reed College.

An Introduction to Number Theory provides an introduction to the main streams of number theory. Starting with the unique factorization property of the integers, the theme of factorization is revisited several times throughout the book to illustrate how the ideas handed down from Euclid continue to reverberate through the subject.A number of different approaches to number theory are presented, and the different streams in the book are brought together in a chapter that describes the class number formula for quadratic fields and the famous conjectures of Birch and Swinnerton-Dyer. The final chapter introduces some of the main ideas behind modern computational number theory and its applications in cryptography.Written for graduate and advanced undergraduate students of mathematics, this text will also appeal to students in cognate subjects who wish to learn some of the big ideas in number theory.

The great mathematician G. H. Hardy told us that ¿Beauty is the ?rst test: there is no permanent place in the world for ugly mathematics¿ (see [24, p. 85]). It is clear why Hardy loved complex analysis: it is a very beautiful partofclassicalmathematics. ThetheoryofHilbertspacesandofoperatorson themisalmostasclassicalandisperhapsasbeautifulascomplexanalysis. The studyoftheHardy¿Hilbertspace(aHilbertspacewhoseelementsareanalytic functions), and of operators on that space, combines these two subjects. The interplay produces a number of extraordinarily elegant results. For example, very elementary concepts from Hilbert space provide simple proofs of the Poisson integral (Theorem 1. 1. 21 below) and Cauchy integral (Theorem 1. 1. 19) formulas. The fundamental theorem about zeros of fu- tions in the Hardy¿Hilbert space (Corollary 2. 4. 10) is the central ingredient of a beautiful proof that every continuous function on [0,1] can be uniformly approximated by polynomials with prime exponents (Corollary 2. 5. 3). The Hardy¿Hilbert space context is necessary to understand the structure of the invariant subspaces of the unilateral shift (Theorem 2. 2. 12). Conversely, pr- erties of the unilateral shift operator are useful in obtaining results on f- torizations of analytic functions (e. g. , Theorem 2. 3. 4) and on other aspects of analytic functions (e. g. , Theorem 2. 3. 3). The study of Toeplitz operators on the Hardy¿Hilbert space is the most natural way of deriving many of the properties of classical Toeplitz mat- ces (e. g. , Theorem 3. 3.

Combinatorial enumeration is a readily accessible subject full of easily stated, but sometimes tantalizingly difficult problems. This book leads the reader in a leisurely way from the basic notions to a variety of topics, ranging from algebra to statistical physics. Its aim is to introduce the student to a fascinating field, and to be a source of information for the professional mathematician who wants to learn more about the subject. The book is organized in three parts: Basics, Methods, and Topics. There are 666 exercises, and as a special feature every chapter ends with a highlight, discussing a particularly beautiful or famous result.

Kurt Hensel (1861-1941) discovered the p-adic numbers around the turn of the century. These exotic numbers (or so they appeared at first) are now well-established in the mathematical world and used more and more by physicists as well. This book offers a self-contained presentation of basic p-adic analysis. The author is especially interested in the analytical topics in this field. Some of the features which are not treated in other introductory p-adic analysis texts are topological models of p-adic spaces inside Euclidean space, a construction of spherically complete fields, a p-adic mean value theorem and some consequences, a special case of Hazewinkel's functional equation lemma, a remainder formula for the Mahler expansion, and most importantly a treatment of analytic elements.

Graph theory is a flourishing discipline containing a body of beautiful and powerful theorems of wide applicability. Its explosive growth in recent years is mainly due to its role as an essential structure underpinning modern applied mathematics ¿ computer science, combinatorial optimization, and operations research in particular ¿ but also to its increasing application in the more applied sciences. The versatility of graphs makes them indispensable tools in the design and analysis of communication networks, for instance.The primary aim of this book is to present a coherent introduction to the subject, suitable as a textbook for advanced undergraduate and beginning graduate students in mathematics and computer science. It provides a systematic treatment of the theory of graphs without sacrificing its intuitive and aesthetic appeal. Commonly used proof techniques are described and illustrated, and a wealth of exercises - of varying levels of difficulty - are provided tohelp the reader master the techniques and reinforce their grasp of the material.A second objective is to serve as an introduction to research in graph theory. To this end, sections on more advanced topics are included, and a number of interesting and challenging open problems are highlighted and discussed in some detail. Despite this more advanced material, the book has been organized in such a way that an introductory course on graph theory can be based on the first few sections of selected chapters.

For the past 25 years, the Geometrization Program of Thurston has been a driving force for research in 3-manifold topology. This has inspired a surge of activity investigating hyperbolic 3-manifolds (and Kleinian groups), as these manifolds form the largest and least well- understood class of compact 3-manifolds. Familiar and new tools from diverse areas of mathematics have been utilized in these investigations, from topology, geometry, analysis, group theory, and from the point of view of this book, algebra and number theory. This book is aimed at readers already familiar with the basics of hyperbolic 3-manifolds or Kleinian groups, and it is intended to introduce them to the interesting connections with number theory and the tools that will be required to pursue them. While there are a number of texts which cover the topological, geometric and analytical aspects of hyperbolic 3-manifolds, this book is unique in that it deals exclusively with the arithmetic aspects, which are not covered in other texts. Colin Maclachlan is a Reader in the Department of Mathematical Sciences at the University of Aberdeen in Scotland where he has served since 1968. He is a former President of the Edinburgh Mathematical Society. Alan Reid is a Professor in the Department of Mathematics at The University of Texas at Austin. He is a former Royal Society University Research Fellow, Alfred P. Sloan Fellow and winner of the Sir Edmund Whittaker Prize from The Edinburgh Mathematical Society. Both authors have published extensively in the general area of discrete groups, hyperbolic manifolds and low-dimensional topology.