This book presents several results on elliptic functions and Pi, using Jacobi's triple product identity as a tool to show suprising connections between different topics within number theory such as theta functions, Eisenstein series, the Dedekind delta function, and Ramanujan's work on Pi. The included exercises make it ideal for both classroom use and self-study.

The most ubiquitous, and perhaps the most intriguing, number pattern in mathematics is the Fibonacci sequence. In this simple pattern beginning with two ones, each succeeding number is the sum of the two numbers immediately preceding it (1, 1, 2, 3, 5, 8, 13, 21, ad infinitum). Accessible and appealing to even the most math-phobic individual, this fun and enlightening book allows the reader to appreciate the elegance of mathematics and its amazing applications in both natural and cultural settings.

This volume brings together recent, original research and survey articles by leading experts in several fields that include singularity theory, algebraic geometry and commutative algebra. The motivation for this collection comes from the wide-ranging research of the distinguished mathematician, Antonio Campillo, in these and related fields. Besides his influence in the mathematical community stemming from his research, Campillo has also endeavored to promote mathematics and mathematicians' networking everywhere, especially in Spain, Latin America and Europe. Because of his impressive achievements throughout his career, we dedicate this book to Campillo in honor of his 65th birthday. Researchers and students from the world-wide, and in particular Latin American and European, communities in singularities, algebraic geometry, commutative algebra, coding theory, and other fields covered in the volume, will have interest in this book.

This introduction to automorphic forms on adelic groups G(A) emphasises the role of representation theory. The exposition is driven by examples, and collects and extends many results scattered throughout the literature, in particular the Langlands constant term formula for Eisenstein series on G(A) as well as the Casselman-Shalika formula for the p-adic spherical Whittaker function. This book also covers more advanced topics such as spherical Hecke algebras and automorphic L-functions. Many of these mathematical results have natural interpretations in string theory, and so some basic concepts of string theory are introduced with an emphasis on connections with automorphic forms. Throughout the book special attention is paid to small automorphic representations, which are of particular importance in string theory but are also of independent mathematical interest. Numerous open questions and conjectures, partially motivated by physics, are included to prompt the reader's own research.

This self-contained book introduces readers to discrete harmonic analysis with an emphasis on the Discrete Fourier Transform and the Fast Fourier Transform on finite groups and finite fields, as well as their noncommutative versions. It also features applications to number theory, graph theory, and representation theory of finite groups. Beginning with elementary material on algebra and number theory, the book then delves into advanced topics from the frontiers of current research, including spectral analysis of the DFT, spectral graph theory and expanders, representation theory of finite groups and multiplicity-free triples, Tao's uncertainty principle for cyclic groups, harmonic analysis on GL(2,Fq), and applications of the Heisenberg group to DFT and FFT. With numerous examples, figures, and over 160 exercises to aid understanding, this book will be a valuable reference for graduate students and researchers in mathematics, engineering, and computer science.

Discrete mathematics has been rising in prominence in the past fifty years, both as a tool with practical applications and as a source of new and interesting mathematics. The topics in discrete mathematics have become so well developed that it is easy to forget that common threads connect the different areas, and it is through discovering and using these connections that progress is often made. For over fifty years, Ron Graham has been able to illuminate some of these connections and has helped to bring the field of discrete mathematics to where it is today. To celebrate his contribution, this volume brings together many of the best researchers working in discrete mathematics, including Fan Chung, Erik D. Demaine, Persi Diaconis, Peter Frankl, Alfred W. Hales, Jeffrey C. Lagarias, Allen Knutson, Janos Pach, Carl Pomerance, N. J. A. Sloane, and of course, Ron Graham himself.

This introduction to the theory of Diophantine approximation pays special regard to Schmidt's subspace theorem and to its applications to Diophantine equations and related topics. The geometric viewpoint on Diophantine equations has been adopted throughout the book. It includes a number of results, some published here for the first time in book form, and some new, as well as classical material presented in an accessible way. Graduate students and experts alike will find the book's broad approach useful for their work, and will discover new techniques and open questions to guide their research. It contains concrete examples and many exercises (ranging from the relatively simple to the much more complex), making it ideal for self-study and enabling readers to quickly grasp the essential concepts.

Starting from physical motivations and leading to practical applications, this book provides an interdisciplinary perspective on the cutting edge of ultrametric pseudodifferential equations. It shows the ways in which these equations link different fields including mathematics, engineering, and geophysics. In particular, the authors provide a detailed explanation of the geophysical applications of p-adic diffusion equations, useful when modeling the flows of liquids through porous rock. p-adic wavelets theory and p-adic pseudodifferential equations are also presented, along with their connections to mathematical physics, representation theory, the physics of disordered systems, probability, number theory, and p-adic dynamical systems. Material that was previously spread across many articles in journals of many different fields is brought together here, including recent work on the van der Put series technique. This book provides an excellent snapshot of the fascinating field of ultrametric pseudodifferential equations, including their emerging applications and currently unsolved problems.

In the more than 100 years since the fundamental group was first introduced by Henri Poincare it has evolved to play an important role in different areas of mathematics. Originally conceived as part of algebraic topology, this essential concept and its analogies have found numerous applications in mathematics that are still being investigated today, and which are explored in this volume, the result of a meeting at Heidelberg University that brought together mathematicians who use or study fundamental groups in their work with an eye towards applications in arithmetic. The book acknowledges the varied incarnations of the fundamental group: pro-finite, -adic, p-adic, pro-algebraic and motivic. It explores a wealth of topics that range from anabelian geometry (in particular the section conjecture), the -adic polylogarithm, gonality questions of modular curves, vector bundles in connection with monodromy, and relative pro-algebraic completions, to a motivic version of Minhyong Kim's non-abelian Chabauty method and p-adic integration after Coleman. The editor has also included the abstracts of all the talks given at the Heidelberg meeting, as well as the notes on Coleman integration and on Grothendieck's fundamental group with a view towards anabelian geometry taken from a series of introductory lectures given by Amnon Besser and Tamas Szamuely, respectively."

The arrangement of nonzero entries of a matrix, described by the graph of the matrix, limits the possible geometric multiplicities of the eigenvalues, which are far more limited by this information than algebraic multiplicities or the numerical values of the eigenvalues. This book gives a unified development of how the graph of a symmetric matrix influences the possible multiplicities of its eigenvalues. While the theory is richest in cases where the graph is a tree, work on eigenvalues, multiplicities and graphs has provided the opportunity to identify which ideas have analogs for non-trees, and those for which trees are essential. It gathers and organizes the fundamental ideas to allow students and researchers to easily access and investigate the many interesting questions in the subject.

This collection of expository articles by a range of established experts and newer researchers provides an overview of the recent developments in the theory of locally compact groups. It includes introductory articles on totally disconnected locally compact groups, profinite groups, p-adic Lie groups and the metric geometry of locally compact groups. Concrete examples, including groups acting on trees and Neretin groups, are discussed in detail. An outline of the emerging structure theory of locally compact groups beyond the connected case is presented through three complementary approaches: Willis' theory of the scale function, global decompositions by means of subnormal series, and the local approach relying on the structure lattice. An introduction to lattices, invariant random subgroups and L2-invariants, and a brief account of the Burger-Mozes construction of simple lattices are also included. A final chapter collects various problems suggesting future research directions.

The Riemann hypothesis (RH) is perhaps the most important outstanding problem in mathematics. This two-volume text presents the main known equivalents to RH using analytic and computational methods. The book is gentle on the reader with definitions repeated, proofs split into logical sections, and graphical descriptions of the relations between different results. It also includes extensive tables, supplementary computational tools, and open problems suitable for research. Accompanying software is free to download. These books will interest mathematicians who wish to update their knowledge, graduate and senior undergraduate students seeking accessible research problems in number theory, and others who want to explore and extend results computationally. Each volume can be read independently. Volume 1 presents classical and modern arithmetic equivalents to RH, with some analytic methods. Volume 2 covers equivalences with a strong analytic orientation, supported by an extensive set of appendices containing fully developed proofs.

The Riemann hypothesis (RH) is perhaps the most important outstanding problem in mathematics. This two-volume text presents the main known equivalents to RH using analytic and computational methods. The book is gentle on the reader with definitions repeated, proofs split into logical sections, and graphical descriptions of the relations between different results. It also includes extensive tables, supplementary computational tools, and open problems suitable for research. Accompanying software is free to download. These books will interest mathematicians who wish to update their knowledge, graduate and senior undergraduate students seeking accessible research problems in number theory, and others who want to explore and extend results computationally. Each volume can be read independently. Volume 1 presents classical and modern arithmetic equivalents to RH, with some analytic methods. Volume 2 covers equivalences with a strong analytic orientation, supported by an extensive set of appendices containing fully developed proofs.

Peter L. Montgomery has made significant contributions to computational number theory, introducing many basic tools such as Montgomery multiplication, Montgomery simultaneous inversion, Montgomery curves, and the Montgomery ladder. This book features state-of-the-art research in computational number theory related to Montgomery's work and its impact on computational efficiency and cryptography. Topics cover a wide range of topics such as Montgomery multiplication for both hardware and software implementations; Montgomery curves and twisted Edwards curves as proposed in the latest standards for elliptic curve cryptography; and cryptographic pairings. This book provides a comprehensive overview of integer factorization techniques, including dedicated chapters on polynomial selection, the block Lanczos method, and the FFT extension for algebraic-group factorization algorithms. Graduate students and researchers in applied number theory and cryptography will benefit from this survey of Montgomery's work.

This book tells the story of the Riemann hypothesis for function fields (or curves) starting with Artin's 1921 thesis, covering Hasse's work in the 1930s on elliptic fields and more, and concluding with Weil's final proof in 1948. The main sources are letters which were exchanged among the protagonists during that time, found in various archives, mostly the University Library in Goettingen. The aim is to show how the ideas formed, and how the proper notions and proofs were found, providing a particularly well-documented illustration of how mathematics develops in general. The book is written for mathematicians, but it does not require any special knowledge of particular mathematical fields.

Understanding Galois representations is one of the central goals of number theory. Around 1990, Fontaine devised a strategy to compare such p-adic Galois representations to seemingly much simpler objects of (semi)linear algebra, the so-called etale (phi, gamma)-modules. This book is the first to provide a detailed and self-contained introduction to this theory. The close connection between the absolute Galois groups of local number fields and local function fields in positive characteristic is established using the recent theory of perfectoid fields and the tilting correspondence. The author works in the general framework of Lubin-Tate extensions of local number fields, and provides an introduction to Lubin-Tate formal groups and to the formalism of ramified Witt vectors. This book will allow graduate students to acquire the necessary basis for solving a research problem in this area, while also offering researchers many of the basic results in one convenient location.

Computational algebraic number theory has been attracting broad interest in the last few years due to its potential applications in coding theory and cryptography. For this reason, the Deutsche Mathematiker Vereinigung initiated an introductory graduate seminar on this topic in Dusseldorf. The lectures given there by the author served as the basis for this book which allows fast access to the state of the art in this area. Special emphasis has been placed on practical algorithms - all developed in the last five years - for the computation of integral bases, the unit group and the class group of arbitrary algebraic number fields. Contents: Introduction * Topics from finite fields * Arithmetic and polynomials * Factorization of polynomials * Topics from the geometry of numbers * Hermite normal form * Lattices * Reduction * Enumeration of lattice points * Algebraic number fields * Introduction * Basic Arithmetic * Computation of an integral basis * Integral closure * Round-Two-Method * Round-Four-Method * Computation of the unit group * Dirichlet's unit theorem and a regulator bound * Two methods for computing r independent units * Fundamental unit computation * Computation of the class group * Ideals and class number * A method for computing the class group * Appendix * The number field sieve * KANT * References * Index

Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the fifth publication in the Lecture Notes in Logic series, the authors give an insightful introduction to the fascinating subject of the model theory of fields, concentrating on its connections to stability theory. In the first two chapters David Marker gives an overview of the model theory of algebraically closed, real closed and differential fields. In the third chapter Anand Pillay gives a proof that there are 2 non-isomorphic countable differential closed fields. Finally, Margit Messmer gives a survey of the model theory of separably closed fields of characteristic p > 0.

Through its engaging and unusual problems, this book demonstrates methods of reasoning necessary for learning number theory. Every technique is followed by problems (as well as detailed hints and solutions) that apply theorems immediately, so readers can solve a variety of abstract problems in a systematic, creative manner. New solutions often require the ingenious use of earlier mathematical concepts - not the memorization of formulas and facts. Questions also often permit experimental numeric validation or visual interpretation to encourage the combined use of deductive and intuitive thinking. The first chapter starts with simple topics like even and odd numbers, divisibility, and prime numbers and helps the reader to solve quite complex, Olympiad-type problems right away. It also covers properties of the perfect, amicable, and figurate numbers and introduces congruence. The next chapter begins with the Euclidean algorithm, explores the representations of integer numbers in different bases, and examines continued fractions, quadratic irrationalities, and the Lagrange Theorem. The last section of Chapter Two is an exploration of different methods of proofs. The third chapter is dedicated to solving Diophantine linear and nonlinear equations and includes different methods of solving Fermat's (Pell's) equations. It also covers Fermat's factorization techniques and methods of solving challenging problems involving exponent and factorials. Chapter Four reviews the Pythagorean triple and quadruple and emphasizes their connection with geometry, trigonometry, algebraic geometry, and stereographic projection. A special case of Waring's problem as a representation of a number by the sum of the squares or cubes of other numbers is covered, as well as quadratic residuals, Legendre and Jacobi symbols, and interesting word problems related to the properties of numbers. Appendices provide a historic overview of number theory and its main developments from the ancient cultures in Greece, Babylon, and Egypt to the modern day. Drawing from cases collected by an accomplished female mathematician, Methods in Solving Number Theory Problems is designed as a self-study guide or supplementary textbook for a one-semester course in introductory number theory. It can also be used to prepare for mathematical Olympiads. Elementary algebra, arithmetic and some calculus knowledge are the only prerequisites. Number theory gives precise proofs and theorems of an irreproachable rigor and sharpens analytical thinking, which makes this book perfect for anyone looking to build their mathematical confidence.

A collection of expanded versions of lectures given at an instructional conference on number theory and arithmetic geometry held at Boston University. The purpose of the conference, and indeed of this book, is to introduce and explain the many ideas and techniques used by Wiles in his proof, and to explain how his result can be combined with Ribets theorem and ideas of Frey and Serre to show, at long last, that Fermats Last Theorem is true. The book begins with an overview of the complete proof, followed by several introductory chapters surveying the basic theory of elliptic curves, modular functions, modular curves, Galois cohomology, and finite group schemes. In recognition of the historical significance of Fermats Last Theorem, the volume concludes by reflecting on the history of the problem, while placing Wiles'theorem into a more general Diophantine context suggesting future applications. Indispensable for students and professional mathematicians alike.

Written by leading experts, this book explores several directions of current research at the interface between dynamics and analytic number theory. Topics include Diophantine approximation, exponential sums, Ramsey theory, ergodic theory and homogeneous dynamics. The origins of this material lie in the 'Dynamics and Analytic Number Theory' Easter School held at Durham University in 2014. Key concepts, cutting-edge results, and modern techniques that play an essential role in contemporary research are presented in a manner accessible to young researchers, including PhD students. This book will also be useful for established mathematicians. The areas discussed include ubiquitous systems and Cantor-type sets in Diophantine approximation, flows on nilmanifolds and their connections with exponential sums, multiple recurrence and Ramsey theory, counting and equidistribution problems in homogeneous dynamics, and applications of thin groups in number theory. Both dynamical and 'classical' approaches towards number theoretical problems are also provided.

Discriminant equations are an important class of Diophantine equations with close ties to algebraic number theory, Diophantine approximation and Diophantine geometry. This book is the first comprehensive account of discriminant equations and their applications. It brings together many aspects, including effective results over number fields, effective results over finitely generated domains, estimates on the number of solutions, applications to algebraic integers of given discriminant, power integral bases, canonical number systems, root separation of polynomials and reduction of hyperelliptic curves. The authors' previous title, Unit Equations in Diophantine Number Theory, laid the groundwork by presenting important results that are used as tools in the present book. This material is briefly summarized in the introductory chapters along with the necessary basic algebra and algebraic number theory, making the book accessible to experts and young researchers alike.

Many different fractal dimensions have been proposed for networks. In A Survey of Fractal Dimensions of Networks the theory and computation of the most important of these dimensions are reviewed, including the box counting dimension, the correlation dimension, the mass dimension, the transfinite fractal dimension, the information dimension, the generalized dimensions (which provide a way to describe multifractals), and the sandbox method (for approximating the generalized dimensions). The book describes the use of diameter-based and radius-based boxes, and presents several heuristic methods for box counting, including greedy coloring, random sequential node burning, and a method for computing a lower bound. We also discuss very recent results on resolving ambiguity in the calculation of the information dimension and the generalized dimensions, and on the non-monotonicity of the generalized dimensions. Anyone interested in the theory and application of networks will want to read this Brief. This includes anyone studying, e.g., social networks, telecommunications networks, transportation networks, ecological networks, food chain networks, network models of the brain, or financial networks.

This unified account of various aspects of a powerful classical method, easy to understand in its simplest forms, is illustrated by applications in several areas of number theory. As well as including diophantine approximation and transcendence, which were mainly responsible for its invention, the author places the method in a broader context by exploring its application in other areas, such as exponential sums and counting problems in both finite fields and the field of rationals. Throughout the book, the method is explained in a 'molecular' fashion, where key ideas are introduced independently. Each application is the most elementary significant example of its kind and appears with detailed references to subsequent developments, making it accessible to advanced undergraduates as well as postgraduate students in number theory or related areas. It provides over 700 exercises both guiding and challenging, while the broad array of applications should interest professionals in fields from number theory to algebraic geometry.

Szemeredi's influence on today's mathematics, especially in combinatorics, additive number theory, and theoretical computer science, is enormous. This volume is a celebration of Szemeredi's achievements and personality, on the occasion of his seventieth birthday. It exemplifies his extraordinary vision and unique way of thinking. A number of colleagues and friends, all top authorities in their fields, have contributed their latest research papers to this volume. The topics include extension and applications of the regularity lemma, the existence of k-term arithmetic progressions in various subsets of the integers, extremal problems in hypergraphs theory, and random graphs, all of them beautiful, Szemeredi type mathematics. It also contains published accounts of the first two, very original and highly successful Polymath projects, one led by Tim Gowers and the other by Terry Tao.