This highly readable book aims to ease the many challenges of starting undergraduate research. It accomplishes this by presenting a diverse series of self-contained, accessible articles which include specific open problems and prepare the reader to tackle them with ample background material and references. Each article also contains a carefully selected bibliography for further reading. The content spans the breadth of mathematics, including many topics that are not normally addressed by the undergraduate curriculum (such as matroid theory, mathematical biology, and operations research), yet have few enough prerequisites that the interested student can start exploring them under the guidance of a faculty member. Whether trying to start an undergraduate thesis, embarking on a summer REU, or preparing for graduate school, this book is appropriate for a variety of students and the faculty who guide them.

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. This 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 also provide essential background in subjects such as: automorphic forms; Eisenstein series; Eisenstein pseudo-series, and their properties. It is thus also an introduction, suitable for graduate students, to the theory of automorphic forms, the first written using contemporary terminology. It will be welcomed by number theorists, representation theorists and all whose work involves the Langlands program.

Many areas of active research within the broad field of number theory relate to properties of polynomials, and this volume displays the most recent and most interesting work on this theme. The 2006 Number Theory and Polynomials workshop in Bristol drew together international researchers with a variety of number-theoretic interests, and the book's contents reflect the quality of the meeting. Topics covered include recent work on the Schur-Siegel-Smyth trace problem, Mahler measure and its generalisations, the merit factor problem, Barker sequences, K3-surfaces, self-inversive polynomials, Newman's inequality, algorithms for sparse polynomials, the integer transfinite diameter, divisors of polynomials, non-linear recurrence sequences, polynomial ergodic averages, and the Hansen-Mullen primitivity conjecture. With surveys and expository articles presenting the latest research, this volume is essential for graduates and researchers looking for a snapshot of current progress in polynomials and number theory.

Introduction to Number Theory covers the essential content of an introductory number theory course including divisibility and prime factorization, congruences, and quadratic reciprocity. The instructor may also choose from a collection of additional topics. Aligning with the trend toward smaller, essential texts in mathematics, the author strives for clarity of exposition. Proof techniques and proofs are presented slowly and clearly. The book employs a versatile approach to the use of algebraic ideas. Instructors who wish to put this material into a broader context may do so, though the author introduces these concepts in a non-essential way. A final chapter discusses algebraic systems (like the Gaussian integers) presuming no previous exposure to abstract algebra. Studying general systems urges students realize unique factorization into primes is a more subtle idea than may at first appear; students will find this chapter interesting, fun and quite accessible. Applications of number theory include several sections on cryptography and other applications to further interest instructors and students alike.

The classical fields are the real, rational, complex and p-adic numbers. Each of these fields comprises several intimately interwoven algebraical and topological structures. This comprehensive volume analyzes the interaction and interdependencies of these different aspects. The real and rational numbers are examined additionally with respect to their orderings, and these fields are compared to their non-standard counterparts. Typical substructures and quotients, relevant automorphism groups and many counterexamples are described. Also discussed are completion procedures of chains and of ordered and topological groups, with applications to classical fields. The p-adic numbers are placed in the context of general topological fields: absolute values, valuations and the corresponding topologies are studied, and the classification of all locally compact fields and skew fields is presented. Exercises are provided with hints and solutions at the end of the book. An appendix reviews ordinals and cardinals, duality theory of locally compact Abelian groups and various constructions of fields.

Hypergeometric functions have occupied a significant position in mathematics for over two centuries. This monograph, by one of the foremost experts, is concerned with the Boyarsky principle which expresses the analytical properties of a certain proto-gamma function. Professor Dwork develops here a theory which is broad enough to encompass several of the most important hypergeometric functions in the literature and their cohomology. A central theme is the development of the Laplace transform in this context and its application to spaces of functions associated with hypergeometric functions. Consequently, this book represents a significant further development of the theory and demonstrates how the Boyarsky principle may be given a cohomological interpretation. The author includes an exposition of the relationship between this theory and Gauss sums and generalized Jacobi sums, and explores the theory of duality which throws new light on the theory of exponential sums and confluent hypergeometric functions.

This book presents the mathematical background underlying security modeling in the context of next-generation cryptography. By introducing new mathematical results in order to strengthen information security, while simultaneously presenting fresh insights and developing the respective areas of mathematics, it is the first-ever book to focus on areas that have not yet been fully exploited for cryptographic applications such as representation theory and mathematical physics, among others. Recent advances in cryptanalysis, brought about in particular by quantum computation and physical attacks on cryptographic devices, such as side-channel analysis or power analysis, have revealed the growing security risks for state-of-the-art cryptographic schemes. To address these risks, high-performance, next-generation cryptosystems must be studied, which requires the further development of the mathematical background of modern cryptography. More specifically, in order to avoid the security risks posed by adversaries with advanced attack capabilities, cryptosystems must be upgraded, which in turn relies on a wide range of mathematical theories. This book is suitable for use in an advanced graduate course in mathematical cryptography, while also offering a valuable reference guide for experts.

Perfect and amicable numbers, as well as a majority of classes of special numbers, have a long and rich history connected with the names of many famous mathematicians. This book gives a complete presentation of the theory of two classes of special numbers (perfect numbers and amicable numbers) and gives much of their properties, facts and theorems with full proofs of them, as well as their numerous analogue and generalizations.

Random matrix theory is an area of mathematics first developed by physicists interested in the energy levels of atomic nuclei, but it can also be used to describe some exotic phenomena in the number theory of elliptic curves. The purpose of this book is to illustrate this interplay of number theory and random matrices. It begins with an introduction to elliptic curves and the fundamentals of modelling by a family of random matrices, and moves on to highlight the latest research. There are expositions of current research on ranks of elliptic curves, statistical properties of families of elliptic curves and their associated L-functions and the emerging uses of random matrix theory in this field. Most of the material here had its origin in a Clay Mathematics Institute workshop on this topic at the Newton Institute in Cambridge and together these contributions provide a unique in-depth treatment of the subject.

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.

Building on the success of the first edition, An Introduction to Number Theory with Cryptography, Second Edition, increases coverage of the popular and important topic of cryptography, integrating it with traditional topics in number theory. The authors have written the text in an engaging style to reflect number theory's increasing popularity. The book is designed to be used by sophomore, junior, and senior undergraduates, but it is also accessible to advanced high school students and is appropriate for independent study. It includes a few more advanced topics for students who wish to explore beyond the traditional curriculum. Features of the second edition include Over 800 exercises, projects, and computer explorations Increased coverage of cryptography, including Vigenere, Stream, Transposition,and Block ciphers, along with RSA and discrete log-based systems "Check Your Understanding" questions for instant feedback to students New Appendices on "What is a proof?" and on Matrices Select basic (pre-RSA) cryptography now placed in an earlier chapter so that the topic can be covered right after the basic material on congruences Answers and hints for odd-numbered problems About the Authors: Jim Kraft received his Ph.D. from the University of Maryland in 1987 and has published several research papers in algebraic number theory. His previous teaching positions include the University of Rochester, St. Mary's College of California, and Ithaca College, and he has also worked in communications security. Dr. Kraft currently teaches mathematics at the Gilman School. Larry Washington received his Ph.D. from Princeton University in 1974 and has published extensively in number theory, including books on cryptography (with Wade Trappe), cyclotomic fields, and elliptic curves. Dr. Washington is currently Professor of Mathematics and Distinguished Scholar-Teacher at the University of Maryland.

As a first comprehensive overview on Farey sequences and subsequences, this monograph is intended as a reference for anyone looking for specific material or formulas related to the subject. Duality of subsequences and maps between them are discussed and explicit proofs are shown in detail. From the Content Basic structural and enumerative properties of Farey sequences, Collective decision making, Committee methods in pattern recognition, Farey duality, Farey sequence, Fundamental Farey subsequences, Monotone bijections between Farey subsequences

In recent times, group theory has found wider applications in various fields of algebra and mathematics in general. But in order to apply this or that result, you need to know about it, and such results are often diffuse and difficult to locate, necessitating that readers construct an extended search through multiple monographs, articles, and papers. Such readers must wade through the morass of concepts and auxiliary statements that are needed to understand the desired results, while it is initially unclear which of them are really needed and which ones can be dispensed with. A further difficulty that one may encounter might be concerned with the form or language in which a given result is presented. For example, if someone knows the basics of group theory, but does not know the theory of representations, and a group theoretical result is formulated in the language of representation theory, then that person is faced with the problem of translating this result into the language with which they are familiar, etc. Infinite Groups: A Roadmap to Some Classical Areas seeks to overcome this challenge. The book covers a broad swath of the theory of infinite groups, without giving proofs, but with all the concepts and auxiliary results necessary for understanding such results. In other words, this book is an extended directory, or a guide, to some of the more established areas of infinite groups. Features An excellent resource for a subject formerly lacking an accessible and in-depth reference Suitable for graduate students, PhD students, and researchers working in group theory Introduces the reader to the most important methods, ideas, approaches, and constructions in infinite group theory.

Paul Erdos was one of the most influential mathematicians of the twentieth century, whose work in number theory, combinatorics, set theory, analysis, and other branches of mathematics has determined the development of large areas of these fields. In 1999, a conference was organized to survey his work, his contributions to mathematics, and the far-reaching impact of his work on many branches of mathematics. On the 100th anniversary of his birth, this volume undertakes the almost impossible task to describe the ways in which problems raised by him and topics initiated by him (indeed, whole branches of mathematics) continue to flourish. Written by outstanding researchers in these areas, these papers include extensive surveys of classical results as well as of new developments."

The first part of this book covers the key concepts of cryptography on an undergraduate level, from encryption and digital signatures to cryptographic protocols. Essential techniques are demonstrated in protocols for key exchange, user identification, electronic elections and digital cash. In the second part, more advanced topics are addressed, such as the bit security of one-way functions and computationally perfect pseudorandom bit generators. The security of cryptographic schemes is a central topic. Typical examples of provably secure encryption and signature schemes and their security proofs are given. Though particular attention is given to the mathematical foundations, no special background in mathematics is presumed. The necessary algebra, number theory and probability theory are included in the appendix. Each chapter closes with a collection of exercises. In the second edition the authors added a complete description of the AES, an extended section on cryptographic hash functions, and new sections on random oracle proofs and public-key encryption schemes that are provably secure against adaptively-chosen-ciphertext attacks. The third edition is a further substantive extension, with new topics added, including: elliptic curve cryptography; Paillier encryption; quantum cryptography; the new SHA-3 standard for cryptographic hash functions; a considerably extended section on electronic elections and Internet voting; mix nets; and zero-knowledge proofs of shuffles. The book is appropriate for undergraduate and graduate students in computer science, mathematics, and engineering.

The book is aimed at people working in number theory or at least interested in this part of mathematics. It presents the development of the theory of algebraic numbers up to the year 1950 and contains a rather complete bibliography of that period. The reader will get information about results obtained before 1950. It is hoped that this may be helpful in preventing rediscoveries of old results, and might also inspire the reader to look at the work done earlier, which may hide some ideas which could be applied in contemporary research.

The theory of numbers continues to occupy a central place in modern mathematics because of both its long history over many centuries as well as its many diverse applications to other fields such as discrete mathematics, cryptography, and coding theory. The proof by Andrew Wiles (with Richard Taylor) of Fermat's last theorem published in 1995 illustrates the high level of difficulty of problems encountered in number-theoretic research as well as the usefulness of the new ideas arising from its proof. The thirteenth conference of the Canadian Number Theory Association was held at Carleton University, Ottawa, Ontario, Canada from June 16 to 20, 2014. Ninety-nine talks were presented at the conference on the theme of advances in the theory of numbers. Topics of the talks reflected the diversity of current trends and activities in modern number theory. These topics included modular forms, hypergeometric functions, elliptic curves, distribution of prime numbers, diophantine equations, L-functions, Diophantine approximation, and many more. This volume contains some of the papers presented at the conference. All papers were refereed. The high quality of the articles and their contribution to current research directions make this volume a must for any mathematics library and is particularly relevant to researchers and graduate students with an interest in number theory. The editors hope that this volume will serve as both a resource and an inspiration to future generations of researchers in the theory of numbers.

This proceedings volume is based on papers presented at the Workshops on Combinatorial and Additive Number Theory (CANT), which were held at the Graduate Center of the City University of New York in 2011 and 2012. The goal of the workshops is to survey recent progress in combinatorial number theory and related parts of mathematics. The workshop attracts researchers and students who discuss the state-of-the-art, open problems and future challenges in number theory.

This proceedings volume contains articles related to the research presented at the 2017 Simons Symposium on p-adic Hodge theory. This symposium was focused on recent developments in p-adic Hodge theory, especially those concerning integral questions and their connections to notions in algebraic topology. This volume features original research articles as well as articles that contain new research and survey some of these recent developments. It is the first of three volumes dedicated to p-adic Hodge theory.

The series is aimed specifically at publishing peer reviewed reviews and contributions presented at workshops and conferences. Each volume is associated with a particular conference, symposium or workshop. These events cover various topics within pure and applied mathematics and provide up-to-date coverage of new developments, methods and applications.

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.

Key problems and conjectures have played an important role in promoting the development of Ramsey theory, a field where great progress has been made during the past two decades, with some old problems solved and many new problems proposed. The present book will be helpful to readers who wish to learn about interesting problems in Ramsey theory, to see how they are interconnected, and then to study them in depth. This book is the first problem book of such scope in Ramsey theory. Many unsolved problems, conjectures and related partial results in Ramsey theory are presented, in areas such as extremal graph theory, additive number theory, discrete geometry, functional analysis, algorithm design, and in other areas. Most presented problems are easy to understand, but they may be difficult to solve. They can be appreciated on many levels and by a wide readership, ranging from undergraduate students majoring in mathematics to research mathematicians. This collection is an essential reference for mathematicians working in combinatorics and number theory, as well as for computer scientists studying algorithms. Contents Some definitions and notations Ramsey theory Bi-color diagonal classical Ramsey numbers Paley graphs and lower bounds for R(k, k) Bi-color off-diagonal classical Ramsey numbers Multicolor classical Ramsey numbers Generalized Ramsey numbers Folkman numbers The Erdos-Hajnal conjecture Other Ramsey-type problems in graph theory On van der Waerden numbers and Szemeredi's theorem More problems of Ramsey type in additive number theory Sidon-Ramsey numbers Games in Ramsey theory Local Ramsey theory Set-coloring Ramsey theory Other problems and conjectures

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.

In this book, we first review the history and current situation of the perfect number problem, including the origin story of the Mersenne primes, and then consider the history and current situation of the Fibonacci sequence. Both topics include results from our own research. In the later sections, we define the square sum perfect numbers, and describe for the first time the secret relationships connecting the square sum perfect numbers, the Fibonacci sequence, the Lucas sequence, the twin prime conjecture, and the Fermat primes. Throughout, we raise various interesting questions and conjectures.

Written for graduate students and researchers alike, this set of lectures provides a structured introduction to the concept of equidistribution in number theory. This concept is of growing importance in many areas, including cryptography, zeros of L-functions, Heegner points, prime number theory, the theory of quadratic forms, and the arithmetic aspects of quantum chaos. The volume brings together leading researchers from a range of fields, whose accessible presentations reveal fascinating links between seemingly disparate areas."