Zeta and L-functions play a central role in number theory. They provide important information of arithmetic nature. This book, which grew out of the author's teaching over several years, explores the interaction between number theory and combinatorics using zeta and L-functions as a central theme. It provides a systematic and comprehensive account of these functions in a combinatorial setting and establishes, among other things, the combinatorial counterparts of celebrated results in number theory, such as the prime number theorem and the Chebotarev density theorem. The spectral theory for finite graphs and higher dimensional complexes is studied. Of special interest in theory and applications are the spectrally extremal objects, called Ramanujan graphs and Ramanujan complexes, which can be characterized by their associated zeta functions satisfying the Riemann Hypothesis. Explicit constructions of these extremal combinatorial objects, using number-theoretic and combinatorial means, are presented. Research on zeta and L-functions for complexes other than graphs emerged only in recent years. This is the first book for graduate students and researchers offering deep insight into this fascinating and fast developing area.

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.

Based on a capstone course that the author taught to upper division undergraduate students with the goal to explain and visualize the connections between different areas of mathematics and the way different subject matters flow from one another, this book is suitable for those with a basic knowledge of high school mathematics.

A gentle introduction to the highly sophisticated world of discrete mathematics, Mathematical Problems and Proofs presents topics ranging from elementary definitions and theorems to advanced topics -- such as cardinal numbers, generating functions, properties of Fibonacci numbers, and Euclidean algorithm. This excellent primer illustrates more than 150 solutions and proofs, thoroughly explained in clear language. The generous historical references and anecdotes interspersed throughout the text create interesting intermissions that will fuel readers' eagerness to inquire further about the topics and some of our greatest mathematicians. The author guides readers through the process of solving enigmatic proofs and problems, and assists them in making the transition from problem solving to theorem proving. At once a requisite text and an enjoyable read, Mathematical Problems and Proofs is an excellent entrée to discrete mathematics for advanced students interested in mathematics, engineering, and science.

The goal of this monograph is to give an accessible introduction to nonstandard methods and their applications, with an emphasis on combinatorics and Ramsey theory. It includes both new nonstandard proofs of classical results and recent developments initially obtained in the nonstandard setting. This makes it the first combinatorics-focused account of nonstandard methods to be aimed at a general (graduate-level) mathematical audience. This book will provide a natural starting point for researchers interested in approaching the rapidly growing literature on combinatorial results obtained via nonstandard methods. The primary audience consists of graduate students and specialists in logic and combinatorics who wish to pursue research at the interface between these areas.

This series is devoted to significant topics or themes that have wide application in mathematics or mathematical science and for which a detailed development of the abstract theory is less important than a thorough and concrete exploration of the implications and applications. Books in the Encyclopedia of Mathematics and its Applications cover their subjects comprehensively. Less important results may be summarised as exercises at the ends of chapters, For technicalities, readers can be referred to the bibliography, which is expected to be comprehensive. As a result, volumes are encyclopedic references or manageable guides to major subjects.