Through a careful treatment of number theory and geometry, Number, Shape, & Symmetry: An Introduction to Number Theory, Geometry, and Group Theory helps readers understand serious mathematical ideas and proofs. Classroom-tested, the book draws on the authors' successful work with undergraduate students at the University of Chicago, seventh to tenth grade mathematically talented students in the University of Chicago's Young Scholars Program, and elementary public school teachers in the Seminars for Endorsement in Science and Mathematics Education (SESAME). The first half of the book focuses on number theory, beginning with the rules of arithmetic (axioms for the integers). The authors then present all the basic ideas and applications of divisibility, primes, and modular arithmetic. They also introduce the abstract notion of a group and include numerous examples. The final topics on number theory consist of rational numbers, real numbers, and ideas about infinity. Moving on to geometry, the text covers polygons and polyhedra, including the construction of regular polygons and regular polyhedra. It studies tessellation by looking at patterns in the plane, especially those made by regular polygons or sets of regular polygons. The text also determines the symmetry groups of these figures and patterns, demonstrating how groups arise in both geometry and number theory. The book is suitable for pre-service or in-service training for elementary school teachers, general education mathematics or math for liberal arts undergraduate-level courses, and enrichment activities for high school students or math clubs.

This book has grown out of a course of lectures on elliptic functions, given in German, at the Swiss Federal Institute of Technology, Zurich, during the summer semester of 1982. Its aim is to give some idea of the theory of elliptic functions, and of its close connexion with theta-functions and modular functions, and to show how it provides an analytic approach to the solution of some classical problems in the theory of numbers. It comprises eleven chapters. The first seven are function-theoretic, and the next four concern arithmetical applications. There are Notes at the end of every chapter, which contain references to the literature, comments on the text, and on the ramifications, old and new, of the problems dealt with, some of them extending into cognate fields. The treatment is self-contained, and makes no special demand on the reader's knowledge beyond the elements of complex analysis in one variable, and of group theory.

This informative and exhaustive study gives a problem-solving approach to the difficult subject of analytic number theory. It is primarily aimed at graduate students and senior undergraduates. The goal is to provide a rapid introduction to analytic methods and the ways in which they are used to study the distribution of prime numbers. The book also includes an introduction to p-adic analytic methods. It is ideal for a first course in analytic number theory. The new edition has been completely rewritten, errors have been corrected, and there is a new chapter on the arithmetic progression of primes.

This book is concerned with discontinuous groups of motions of the unique connected and simply connected Riemannian 3-manifold of constant curva ture -1, which is traditionally called hyperbolic 3-space. This space is the 3-dimensional instance of an analogous Riemannian manifold which exists uniquely in every dimension n:::: 2. The hyperbolic spaces appeared first in the work of Lobachevski in the first half of the 19th century. Very early in the last century the group of isometries of these spaces was studied by Steiner, when he looked at the group generated by the inversions in spheres. The ge ometries underlying the hyperbolic spaces were of fundamental importance since Lobachevski, Bolyai and Gauss had observed that they do not satisfy the axiom of parallels. Already in the classical works several concrete coordinate models of hy perbolic 3-space have appeared. They make explicit computations possible and also give identifications of the full group of motions or isometries with well-known matrix groups. One such model, due to H. Poincare, is the upper 3 half-space IH in JR . The group of isometries is then identified with an exten sion of index 2 of the group PSL(2,"

This book summarizes recent inventions, provides guidelines and recommendations, and demonstrates many practical applications of homomorphic encryption. This collection of papers represents the combined wisdom of the community of leading experts on Homomorphic Encryption. In the past 3 years, a global community consisting of researchers in academia, industry, and government, has been working closely to standardize homomorphic encryption. This is the first publication of whitepapers created by these experts that comprehensively describes the scientific inventions, presents a concrete security analysis, and broadly discusses applicable use scenarios and markets. This book also features a collection of privacy-preserving machine learning applications powered by homomorphic encryption designed by groups of top graduate students worldwide at the Private AI Bootcamp hosted by Microsoft Research. The volume aims to connect non-expert readers with this important new cryptographic technology in an accessible and actionable way. Readers who have heard good things about homomorphic encryption but are not familiar with the details will find this book full of inspiration. Readers who have preconceived biases based on out-of-date knowledge will see the recent progress made by industrial and academic pioneers on optimizing and standardizing this technology. A clear picture of how homomorphic encryption works, how to use it to solve real-world problems, and how to efficiently strengthen privacy protection, will naturally become clear.

The Hardy-Littlewood circle method was invented over a century ago to study integer solutions to special Diophantine equations, but it has since proven to be one of the most successful all-purpose tools available to number theorists. Not only is it capable of handling remarkably general systems of polynomial equations defined over arbitrary global fields, but it can also shed light on the space of rational curves that lie on algebraic varieties. This book, in which the arithmetic of cubic polynomials takes centre stage, is aimed at bringing beginning graduate students into contact with some of the many facets of the circle method, both classical and modern. This monograph is the winner of the 2021 Ferran Sunyer i Balaguer Prize, a prestigious award for books of expository nature presenting the latest developments in an active area of research in mathematics.

The main topics of this volume, dedicated to Lance Littlejohn, are operator and spectral theory, orthogonal polynomials, combinatorics, number theory, and the various interplays of these subjects. Although the event, originally scheduled as the Baylor Analysis Fest, had to be postponed due to the pandemic, scholars from around the globe have contributed research in a broad range of mathematical fields. The collection will be of interest to both graduate students and professional mathematicians. Contributors are: G.E. Andrews, B.M. Brown, D. Damanik, M.L. Dawsey, W.D. Evans, J. Fillman, D. Frymark, A.G. Garcia, L.G. Garza, F. Gesztesy, D. Gomez-Ullate, Y. Grandati, F.A. Grunbaum, S. Guo, M. Hunziker, A. Iserles, T.F. Jones, K. Kirsten, Y. Lee, C. Liaw, F. Marcellan, C. Markett, A. Martinez-Finkelshtein, D. McCarthy, R. Milson, D. Mitrea, I. Mitrea, M. Mitrea, G. Novello, D. Ong, K. Ono, J.L. Padgett, M.M.M. Pang, T. Poe, A. Sri Ranga, K. Schiefermayr, Q. Sheng, B. Simanek, J. Stanfill, L. Velazquez, M. Webb, J. Wilkening, I.G. Wood, M. Zinchenko.

Number theory is one of the few areas of mathematics where problems of substantial interest can be fully described to someone with minimal mathematical background. Solving such problems sometimes requires difficult and deep methods. But this is not a universal phenomenon; many engaging problems can be successfully attacked with little more than one's mathematical bare hands. In this case one says that the problem can be solved in an elementary way. Such elementary methods and the problems to which they apply are the subject of this book. ""Not Always Buried Deep"" is designed to be read and enjoyed by those who wish to explore elementary methods in modern number theory. The heart of the book is a thorough introduction to elementary prime number theory, including Dirichlet's theorem on primes in arithmetic progressions, the Brun sieve, and the Erdos-Selberg proof of the prime number theorem. Rather than trying to present a comprehensive treatise, Pollack focuses on topics that are particularly attractive and accessible. Other topics covered include Gauss' theory of cyclotomy and its applications to rational reciprocity laws, Hilbert's solution to Waring's problem, and modern work on perfect numbers. The nature of the material means that little is required in terms of prerequisites: the reader is expected to have prior familiarity with number theory at the level of an undergraduate course and a first course in modern algebra (covering groups, rings, and fields). The exposition is complemented by over 200 exercises and 400 references.

This book develops a new theory in convex geometry, generalizing positive bases and related to Caratheordory's Theorem by combining convex geometry, the combinatorics of infinite subsets of lattice points, and the arithmetic of transfer Krull monoids (the latter broadly generalizing the ubiquitous class of Krull domains in commutative algebra)This new theory is developed in a self-contained way with the main motivation of its later applications regarding factorization. While factorization into irreducibles, called atoms, generally fails to be unique, there are various measures of how badly this can fail. Among the most important is the elasticity, which measures the ratio between the maximum and minimum number of atoms in any factorization. Having finite elasticity is a key indicator that factorization, while not unique, is not completely wild. Via the developed material in convex geometry, we characterize when finite elasticity holds for any Krull domain with finitely generated class group $G$, with the results extending more generally to transfer Krull monoids. This book is aimed at researchers in the field but is written to also be accessible for graduate students and general mathematicians.

This is the second volume of a series of mainly expository articles on the arithmetic theory of automorphic forms. It forms a sequel to On the Stabilization of the Trace Formula published in 2011. The books are intended primarily for two groups of readers: those interested in the structure of automorphic forms on reductive groups over number fields, and specifically in qualitative information on multiplicities of automorphic representations; and those interested in the classification of I-adic representations of Galois groups of number fields. Langlands' conjectures elaborate on the notion that these two problems overlap considerably. These volumes present convincing evidence supporting this, clearly and succinctly enough that readers can pass with minimal effort between the two points of view. Over a decade's worth of progress toward the stabilization of the Arthur-Selberg trace formula, culminating in Ngo Bau Chau's proof of the Fundamental Lemma, makes this series timely.

This monograph describes and implements partially homomorphic encryption functions using a unified notation. After introducing the appropriate mathematical background, the authors offer a systematic examination of the following known algorithms: Rivest-Shamir-Adleman; Goldwasser-Micali; ElGamal; Benaloh; Naccache-Stern; Okamoto-Uchiyama; Paillier; Damgaard-Jurik; Boneh-Goh-Nissim; and Sander-Young-Yung. Over recent years partially and fully homomorphic encryption algorithms have been proposed and researchers have addressed issues related to their formulation, arithmetic, efficiency and security. Formidable efficiency barriers remain, but we now have a variety of algorithms that can be applied to various private computation problems in healthcare, finance and national security, and studying these functions may help us to understand the difficulties ahead. The book is valuable for researchers and graduate students in Computer Science, Engineering, and Mathematics who are engaged with Cryptology.

This book provides an overview of many interesting properties of natural numbers, demonstrating their applications in areas such as cryptography, geometry, astronomy, mechanics, computer science, and recreational mathematics. In particular, it presents the main ideas of error-detecting and error-correcting codes, digital signatures, hashing functions, generators of pseudorandom numbers, and the RSA method based on large prime numbers. A diverse array of topics is covered, from the properties and applications of prime numbers, some surprising connections between number theory and graph theory, pseudoprimes, Fibonacci and Lucas numbers, and the construction of Magic and Latin squares, to the mathematics behind Prague's astronomical clock. Introducing a general mathematical audience to some of the basic ideas and algebraic methods connected with various types of natural numbers, the book will provide invaluable reading for amateurs and professionals alike.

This textbook offers an introduction to abelian varieties, a rich topic of central importance to algebraic geometry. The emphasis is on geometric constructions over the complex numbers, notably the construction of important classes of abelian varieties and their algebraic cycles. The book begins with complex tori and their line bundles (theta functions), naturally leading to the definition of abelian varieties. After establishing basic properties, the moduli space of abelian varieties is introduced and studied. The next chapters are devoted to the study of the main examples of abelian varieties: Jacobian varieties, abelian surfaces, Albanese and Picard varieties, Prym varieties, and intermediate Jacobians. Subsequently, the Fourier-Mukai transform is introduced and applied to the study of sheaves, and results on Chow groups and the Hodge conjecture are obtained. This book is suitable for use as the main text for a first course on abelian varieties, for instance as a second graduate course in algebraic geometry. The variety of topics and abundant exercises also make it well suited to reading courses. The book provides an accessible reference, not only for students specializing in algebraic geometry but also in related subjects such as number theory, cryptography, mathematical physics, and integrable systems.

This graduate text, based on years of teaching experience, is intended for first or second year graduate students in pure mathematics. The main goal of the text is to show how the computer can be used as a tool for research in number theory through numerical experimentation. The book contains many examples of experiments in binary quadratic forms, zeta functions of varieties over finite fields, elementary class field theory, elliptic units, modular forms, along with exercises and selected solutions. Sample programs are written in GP, the scripting language for the computational package PARI, and are available for download from the author's website.

"Convolution and Equidistribution" explores an important aspect of number theory--the theory of exponential sums over finite fields and their Mellin transforms--from a new, categorical point of view. The book presents fundamentally important results and a plethora of examples, opening up new directions in the subject.

The finite-field Mellin transform (of a function on the multiplicative group of a finite field) is defined by summing that function against variable multiplicative characters. The basic question considered in the book is how the values of the Mellin transform are distributed (in a probabilistic sense), in cases where the input function is suitably algebro-geometric. This question is answered by the book's main theorem, using a mixture of geometric, categorical, and group-theoretic methods.

By providing a new framework for studying Mellin transforms over finite fields, this book opens up a new way for researchers to further explore the subject.

Lester Ford's book was the first treatise in English on automorphic functions. At the time of its publication (1929), it was welcomed for its elegant treatment of groups of linear transformations and for the remarkably clear and explicit exposition throughout the book. Ford's extraordinary talent for writing has been memorialized in the prestigious award that bears his name. The book, in the meantime, has become a recognized classic. Ford's approach is primarily through analytic function theory. The first part of the book covers groups of linear transformations, especially Fuchsian groups, fundamental domains, and functions that are invariant under the groups, including the classical elliptic modular functions and Poincare theta series. The second part of the book covers conformal mappings, uniformization, and connections between automorphic functions and differential equations with regular singular points, such as the hypergeometric equation.

An undergraduate-level introduction to number theory, with the emphasis on fully explained proofs and examples. Exercises, together with their solutions are integrated into the text, and the first few chapters assume only basic school algebra. Elementary ideas about groups and rings are then used to study groups of units, quadratic residues and arithmetic functions with applications to enumeration and cryptography. The final part, suitable for third-year students, uses ideas from algebra, analysis, calculus and geometry to study Dirichlet series and sums of squares. In particular, the last chapter gives a concise account of Fermat's Last Theorem, from its origin in the ancient Babylonian and Greek study of Pythagorean triples to its recent proof by Andrew Wiles.

Arithmetic groups are generalisations, to the setting of algebraic groups over a global field, of the subgroups of finite index in the general linear group with entries in the ring of integers of an algebraic number field. They are rich, diverse structures and they arise in many areas of study. This text enables you to build a solid, rigorous foundation in the subject. It first develops essential geometric and number theoretical components to the investigations of arithmetic groups, and then examines a number of different themes, including reduction theory, (semi)-stable lattices, arithmetic groups in forms of the special linear group, unipotent groups and tori, and reduction theory for adelic coset spaces. Also included is a thorough treatment of the construction of geometric cycles in arithmetically defined locally symmetric spaces, and some associated cohomological questions. Written by a renowned expert, this book is a valuable reference for researchers and graduate students.

Presents Book One of Euclid's Elements for students in humanities and for general readers. This treatment raises deep questions about the nature of human reason and its relation to the world. Dana Densmore's Questions for Discussion are intended as examples, to urge readers to think more carefully about what they are watching unfold, and to help them find their own questions in a genuine and exhilarating inquiry.

This book collects and explains the many theorems concerning the existence of certificates of positivity for polynomials that are positive globally or on semialgebraic sets. A certificate of positivity for a real polynomial is an algebraic identity that gives an immediate proof of a positivity condition for the polynomial. Certificates of positivity have their roots in fundamental work of David Hilbert from the late 19th century on positive polynomials and sums of squares. Because of the numerous applications of certificates of positivity in mathematics, applied mathematics, engineering, and other fields, it is desirable to have methods for finding, describing, and characterizing them. For many of the topics covered in this book, appropriate algorithms, computational methods, and applications are discussed. This volume contains a comprehensive, accessible, up-to-date treatment of certificates of positivity, written by an expert in the field. It provides an overview of both the theory and computational aspects of the subject, and includes many of the recent and exciting developments in the area. Background information is given so that beginning graduate students and researchers who are not specialists can learn about this fascinating subject. Furthermore, researchers who work on certificates of positivity or use them in applications will find this a useful reference for their work.

This textbook provides a readable account of the examples and fundamental results of groups from a theoretical and geometrical point of view. Topics on important examples of groups (like cyclic groups, permutation groups, group of arithmetical functions, matrix groups and linear groups), Lagrange's theorem, normal subgroups, factor groups, derived subgroup, homomorphism, isomorphism and automorphism of groups have been discussed in depth. Covering all major topics, this book is targeted to undergraduate students of mathematics with no prerequisite knowledge of the discussed topics. Each section ends with a set of worked-out problems and supplementary exercises to challenge the knowledge and ability of the reader.

Bridging the gap between novice and expert, the aim of this book is to present in a self-contained way a number of striking examples of current diophantine problems to which Arakelov geometry has been or may be applied. Arakelov geometry can be seen as a link between algebraic geometry and diophantine geometry. Based on lectures from a summer school for graduate students, this volume consists of 12 different chapters, each written by a different author. The first chapters provide some background and introduction to the subject. These are followed by a presentation of different applications to arithmetic geometry. The final part describes the recent application of Arakelov geometry to Shimura varieties and the proof of an averaged version of Colmez's conjecture. This book thus blends initiation to fundamental tools of Arakelov geometry with original material corresponding to current research. This book will be particularly useful for graduate students and researchers interested in the connections between algebraic geometry and number theory. The prerequisites are some knowledge of number theory and algebraic geometry.

Automatic sequences are sequences over a finite alphabet generated by a finite-state machine. This book presents a novel viewpoint on automatic sequences, and more generally on combinatorics on words, by introducing a decision method through which many new results in combinatorics and number theory can be automatically proved or disproved with little or no human intervention. This approach to proving theorems is extremely powerful, allowing long and error-prone case-based arguments to be replaced by simple computations. Readers will learn how to phrase their desired results in first-order logic, using free software to automate the computation process. Results that normally require multipage proofs can emerge in milliseconds, allowing users to engage with mathematical questions that would otherwise be difficult to solve. With more than 150 exercises included, this text is an ideal resource for researchers, graduate students, and advanced undergraduates studying combinatorics, sequences, and number theory.

The book discusses major topics in complex analysis with applications to number theory. This book is intended as a text for graduate students of mathematics and undergraduate students of engineering, as well as to researchers in complex analysis and number theory. This theory is a prerequisite for the study of many areas of mathematics, including the theory of several finitely and infinitely many complex variables, hyperbolic geometry, two and three manifolds and number theory. In additional to solved examples and problems, the book covers most of the topics of current interest, such as Cauchy theorems, Picard's theorems, Riemann-Zeta function, Dirichlet theorem, gamma function and harmonic functions.

This textbook is a practical yet in depth guide to cryptography and its principles and practices. The book places cryptography in real-world security situations using the hands-on information contained throughout the chapters. Prolific author Dr. Chuck Easttom lays out essential math skills and fully explains how to implement cryptographic algorithms in today's data protection landscape. Readers learn and test out how to use ciphers and hashes, generate random keys, handle VPN and Wi-Fi security, and encrypt VoIP, Email, and Web communications. The book also covers cryptanalysis, steganography, and cryptographic backdoors and includes a description of quantum computing and its impact on cryptography. This book is meant for those without a strong mathematics background _ only just enough math to understand the algorithms given. The book contains a slide presentation, questions and answers, and exercises throughout. Presents a comprehensive coverage of cryptography in an approachable format; Covers the basic math needed for cryptography _ number theory, discrete math, and algebra (abstract and linear); Includes a full suite of classroom materials including exercises, Q&A, and examples.