This book introduces algebraic number theory through the problem of generalizing 'unique prime factorization' from ordinary integers to more general domains. Solving polynomial equations in integers leads naturally to these domains, but unique prime factorization may be lost in the process. To restore it, we need Dedekind's concept of ideals. However, one still needs the supporting concepts of algebraic number field and algebraic integer, and the supporting theory of rings, vector spaces, and modules. It was left to Emmy Noether to encapsulate the properties of rings that make unique prime factorization possible, in what we now call Dedekind rings. The book develops the theory of these concepts, following their history, motivating each conceptual step by pointing to its origins, and focusing on the goal of unique prime factorization with a minimum of distraction or prerequisites. This makes a self-contained easy-to-read book, short enough for a one-semester course.

The research of Jonathan Borwein has had a profound impact on optimization, functional analysis, operations research, mathematical programming, number theory, and experimental mathematics. Having authored more than a dozen books and more than 300 publications, Jonathan Borwein is one of the most productive Canadian mathematicians ever. His research spans pure, applied, and computational mathematics as well as high performance computing, and continues to have an enormous impact: MathSciNet lists more than 2500 citations by more than 1250 authors, and Borwein is one of the 250 most cited mathematicians of the period 1980-1999. He has served the Canadian Mathematics Community through his presidency (2000-02) as well as his 15 years of editing the CMS book series. Jonathan Borwein's vision and initiative have been crucial in initiating and developing several institutions that provide support for researchers with a wide range of scientific interests. A few notable examples include the Centre for Experimental and Constructive Mathematics and the IRMACS Centre at Simon Fraser University, the Dalhousie Distributed Research Institute at Dalhousie University, the Western Canada Research Grid, and the Centre for Computer Assisted Research Mathematics and its Applications, University of Newcastle. The workshops that were held over the years in Dr. Borwein's honor attracted high-caliber scientists from a wide range of mathematical fields. This present volume is an outgrowth of the workshop on 'Computational and Analytical Mathematics' held in May 2011 in celebration of Dr. Borwein's 60th Birthday. The collection contains various state-of-the-art research manuscripts and surveys presenting contributions that have risen from the conference, and is an excellent opportunity to survey state-of-the-art research and discuss promising research directions and approaches.

The challenge of dividing an asset fairly, from cakes to more important properties, is of great practical importance in many situations. Since the famous Polish school of mathematicians (Steinhaus, Banach, and Knaster) introduced and described algorithms for the fair division problem in the 1940s, the concept has been widely popularized.

This book gathers into one readable and inclusive source a comprehensive discussion of the state of the art in cake-cutting problems for both the novice and the professional. It offers a complete treatment of all cake-cutting algorithms under all the considered definitions of "fair" and presents them in a coherent, reader-friendly manner. Robertson and Webb have brought this elegant problem to life for both the bright high school student and the professional researcher.

Now in its second edition, this volume provides a uniquely detailed study of $P$-adic differential equations. Assuming only a graduate-level background in number theory, the text builds the theory from first principles all the way to the frontiers of current research, highlighting analogies and links with the classical theory of ordinary differential equations. The author includes many original results which play a key role in the study of $P$-adic geometry, crystalline cohomology, $P$-adic Hodge theory, perfectoid spaces, and algorithms for L-functions of arithmetic varieties. This updated edition contains five new chapters, which revisit the theory of convergence of solutions of $P$-adic differential equations from a more global viewpoint, introducing the Berkovich analytification of the projective line, defining convergence polygons as functions on the projective line, and deriving a global index theorem in terms of the Laplacian of the convergence polygon.

First published in 1975, this classic book gives a systematic account of transcendental number theory, that is, the theory of those numbers that cannot be expressed as the roots of algebraic equations having rational coefficients. Their study has developed into a fertile and extensive theory, which continues to see rapid progress today. Expositions are presented of theories relating to linear forms in the logarithms of algebraic numbers, of Schmidt's generalization of the Thue-Siegel-Roth theorem, of Shidlovsky's work on Siegel's E-functions and of Sprindzuk's solution to the Mahler conjecture. This edition includes an introduction written by David Masser describing Baker's achievement, surveying the content of each chapter and explaining the main argument of Baker's method in broad strokes. A new afterword lists recent developments related to Baker's work.

This exploration of the relation between periods and transcendental numbers brings Baker's theory of linear forms in logarithms into its most general framework, the theory of 1-motives. Written by leading experts in the field, it contains original results and finalises the theory of linear relations of 1-periods, answering long-standing questions in transcendence theory. It provides a complete exposition of the new theory for researchers, but also serves as an introduction to transcendence for graduate students and newcomers. It begins with foundational material, including a review of the theory of commutative algebraic groups and the analytic subgroup theorem as well as the basics of singular homology and de Rham cohomology. Part II addresses periods of 1-motives, linking back to classical examples like the transcendence of , before the authors turn to periods of algebraic varieties in Part III. Finally, Part IV aims at a dimension formula for the space of periods of a 1-motive in terms of its data.

Understanding maths has never been easier. Combining bold, elegant graphics with easy-to-understand text, Simply Maths is the perfect introduction to the subject for those who are short of time but hungry for knowledge. Covering more than 90 key mathematical concepts from prime numbers and fractions to quadratic equations and probability experiments, each pared-back, single-page entry explains the concept more clearly than ever before. Organized by major themes - number theory and systems; calculations; geometry; algebra; graphs; ratio and proportion; measurement; probability and statistics; and calculus - entries explain the essentials of each key mathematical theory with simple clarity and for ease of understanding. Whether you are studying maths at school or college, or simply want a jargon-free overview of the subject, this indispensable guide is packed with everything you need to understand the basics quickly and easily.

The classical circle method of Hardy and Littlewood is one of the most effective methods of additive number theory. Two examples are its success with Waring's problem and Goldbach's conjecture. In this book, Wang offers instances of generalizations of important results on diophantine equations and inequalities over rational fields to algebraic number fields. The book also contains an account of Siegel's generalized circle method and its applications to Waring's problem and additive equations and an account of Schmidt's method on diophantine equations and inequalities in several variables in algebraic number fields.

The area of computational cryptography is dedicated to the development of effective methods in algorithmic number theory that improve implementation of cryptosystems or further their cryptanalysis. This book is a tribute to Arjen K. Lenstra, one of the key contributors to the field, on the occasion of his 65th birthday, covering his best-known scientific achievements in the field. Students and security engineers will appreciate this no-nonsense introduction to the hard mathematical problems used in cryptography and on which cybersecurity is built, as well as the overview of recent advances on how to solve these problems from both theoretical and practical applied perspectives. Beginning with polynomials, the book moves on to the celebrated Lenstra-Lenstra-Lovasz lattice reduction algorithm, and then progresses to integer factorization and the impact of these methods to the selection of strong cryptographic keys for usage in widely used standards.

Over the last decade, the role of computational simulations in all aspects of aerospace design has steadily increased. However, despite the many advances, the time required for computations is far too long. This book examines new ideas and methodologies that may, in the next twenty years, revolutionize scientific computing. The book specifically looks at trends in algorithm research, human computer interface, network-based computing, surface modeling and grid generation and computer hardware and architecture. The book provides a good overview of the current state-of-the-art and provides guidelines for future research directions. The book is intended for computational scientists active in the field and program managers making strategic research decisions.

Robert Langlands formulated his celebrated conjectures, initiating the Langlands Program, at the age of 31, profoundly changing the landscape of mathematics. Langlands, recipient of the Abel Prize, is famous for his insight in discovering links among seemingly dissimilar objects, leading to astounding results. This book is uniquely designed to serve a wide range of mathematicians and advanced students, showcasing Langlands' unique creativity and guiding readers through the areas of Langlands' work that are generally regarded as technical and difficult to penetrate. Part 1 features non-technical personal reflections, including Langlands' own words describing how and why he was led to formulate his conjectures. Part 2 includes survey articles of Langlands' early work that led to his conjectures, and centers on his principle of functoriality and foundational work on the Eisenstein series, and is accessible to mathematicians from other fields. Part 3 describes some of Langlands' contributions to mathematical physics.

What are numbers? Where do they come from? Are there different kings of number? Why was Pythagoras fascinated by triangular and square numbers? Is there a link between perfect numbers and primes? In this enlightening illustrated pocket book, mathemagician Oliver Linton reveals the wonderful world of numbers, visiting the questions and answers of great number theorists along the way, from Euclid to Euler, Fibonacci to Fermat, and Archimedes to Gauss. No calculator needed! WOODEN BOOKS are small but packed with information. "Fascinating" FINANCIAL TIMES. "Beautiful" LONDON REVIEW OF BOOKS. "Rich and Artful" THE LANCET. "Genuinely mind-expanding" FORTEAN TIMES. "Excellent" NEW SCIENTIST. "Stunning" NEW YORK TIMES. Small books, big ideas.

The subject of this book is arithmetic algebraic geometry, an area between number theory and algebraic geometry. It is about applying geometric methods to the study of polynomial equations in rational numbers (Diophantine equations). This book represents the first complete and coherent exposition in a single volume, of both the theory and applications of torsors to rational points. Some very recent material is included. It is demonstrated that torsors provide a unified approach to several branches of the theory which were hitherto developing in parallel.

Searching for small gaps between consecutive primes is one way to approach the twin primes conjecture, one of the most celebrated unsolved problems in number theory. This book documents the remarkable developments of recent decades, whereby an upper bound on the known gap length between infinite numbers of consecutive primes has been reduced to a tractable finite size. The text is both introductory and complete: the detailed way in which results are proved is fully set out and plenty of background material is included. The reader journeys from selected historical theorems to the latest best result, exploring the contributions of a vast array of mathematicians, including Bombieri, Goldston, Motohashi, Pintz, Yildirim, Zhang, Maynard, Tao and Polymath8. The book is supported by a linked and freely-available package of computer programs. The material is suitable for graduate students and of interest to any mathematician curious about recent breakthroughs in the field.

Searching for small gaps between consecutive primes is one way to approach the twin primes conjecture, one of the most celebrated unsolved problems in number theory. This book documents the remarkable developments of recent decades, whereby an upper bound on the known gap length between infinite numbers of consecutive primes has been reduced to a tractable finite size. The text is both introductory and complete: the detailed way in which results are proved is fully set out and plenty of background material is included. The reader journeys from selected historical theorems to the latest best result, exploring the contributions of a vast array of mathematicians, including Bombieri, Goldston, Motohashi, Pintz, Yildirim, Zhang, Maynard, Tao and Polymath8. The book is supported by a linked and freely-available package of computer programs. The material is suitable for graduate students and of interest to any mathematician curious about recent breakthroughs in the field.

Numbers and politics are inter-related at almost every level -- be it the abstract geometry of understandings of territory, the explosion of population statistics and measures of economic standards, the popularity of Utilitarianism, Rawlsian notions of justice, the notion of value, or simply the very idea of political science. Time and space are reduced to co-ordinates, illustrating a very real take on the political: a way of measuring and controlling it. This book engages with the relation between politics and number through a reading, exegesis and critique of the work of Martin Heidegger. The importance of mathematics and the role played by the understandings of calculation is a recurrent concern in his writing and is regularly contrasted with understandings of speech and language. This book provides the most detailed analysis of the relation between language, politics and mathematics in Heidegger's work. It insists that questions of language and calculation in Heidegger are inherently political, and that a far broader range of his work is concerned with politics than is usually admitted. Key Features: *A unique introduction to the political dimension of Heidegger's work, opening it up to a wider audience *Offers an original exploration of the relationship between language, mathematics and politics in Heidegger's thinking *Shows how questions of politics and calculation are inter-related in modern conceptions of the political Books in the series are...Valentine and Arditi Polemicization Shapiro Cinematic Political Thought Chambers Untimely Politics Elden Speaking Against Number Bowman Post-Marxism Versus Cultural Studies Marchart Post-Foundational Political Thought Little Democratic Piety

Developed from the author s popular graduate-level course, Computational Number Theory presents a complete treatment of number-theoretic algorithms. Avoiding advanced algebra, this self-contained text is designed for advanced undergraduate and beginning graduate students in engineering. It is also suitable for researchers new to the field and practitioners of cryptography in industry.

Requiring no prior experience with number theory or sophisticated algebraic tools, the book covers many computational aspects of number theory and highlights important and interesting engineering applications. It first builds the foundation of computational number theory by covering the arithmetic of integers and polynomials at a very basic level. It then discusses elliptic curves, primality testing, algorithms for integer factorization, computing discrete logarithms, and methods for sparse linear systems. The text also shows how number-theoretic tools are used in cryptography and cryptanalysis. A dedicated chapter on the application of number theory in public-key cryptography incorporates recent developments in pairing-based cryptography.

With an emphasis on implementation issues, the book uses the freely available number-theory calculator GP/PARI to demonstrate complex arithmetic computations. The text includes numerous examples and exercises throughout and omits lengthy proofs, making the material accessible to students and practitioners.

Berkeley Lectures on p-adic Geometry presents an important breakthrough in arithmetic geometry. In 2014, leading mathematician Peter Scholze delivered a series of lectures at the University of California, Berkeley, on new ideas in the theory of p-adic geometry. Building on his discovery of perfectoid spaces, Scholze introduced the concept of "diamonds," which are to perfectoid spaces what algebraic spaces are to schemes. The introduction of diamonds, along with the development of a mixed-characteristic shtuka, set the stage for a critical advance in the discipline. In this book, Peter Scholze and Jared Weinstein show that the moduli space of mixed-characteristic shtukas is a diamond, raising the possibility of using the cohomology of such spaces to attack the Langlands conjectures for a reductive group over a p-adic field. This book follows the informal style of the original Berkeley lectures, with one chapter per lecture. It explores p-adic and perfectoid spaces before laying out the newer theory of shtukas and their moduli spaces. Points of contact with other threads of the subject, including p-divisible groups, p-adic Hodge theory, and Rapoport-Zink spaces, are thoroughly explained. Berkeley Lectures on p-adic Geometry will be a useful resource for students and scholars working in arithmetic geometry and number theory.

Complex analysis is a classic and central area of mathematics, which is studies and exploited in a range of important fields, from number theory to engineering. Introduction to Complex Analysis was first published in 1985, and for this much-awaited second edition the text has been considerably expanded, while retaining the style of the original. More detailed presentation is given of elementary topics, to reflect the knowledge base of current students. Exercise sets have been substantially revised and enlarged, with carefully graded exercises at the end of each chapter.

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). Far from being just a curiosity, this sequence recurs in structures found throughout nature - from the arrangement of whorls on a pinecone to the branches of certain plant stems. All of which is astounding evidence for the deep mathematical basis of the natural world. With admirable clarity, two veteran math educators take us on a fascinating tour of the many ramifications of the Fibonacci numbers. They begin with a brief history of a distinguished Italian discoverer, who, among other accomplishments, was responsible for popularizing the use of Arabic numerals in the West. Turning to botany, the authors demonstrate, through illustrative diagrams, the unbelievable connections between Fibonacci numbers and natural forms (pineapples, sunflowers, and daisies are just a few examples). In art, architecture, the stock market, and other areas of society and culture, they point out numerous examples of the Fibonacci sequence as well as its derivative, the "golden ratio." And of course in mathematics, as the authors amply demonstrate, there are almost boundless applications in probability, number theory, geometry, algebra, and Pascal's triangle, to name a few.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 book provides the latest competing research results on non-commutative harmonic analysis on homogeneous spaces with many applications. It also includes the most recent developments on other areas of mathematics including algebra and geometry. Lie group representation theory and harmonic analysis on Lie groups and on their homogeneous spaces form a significant and important area of mathematical research. These areas are interrelated with various other mathematical fields such as number theory, algebraic geometry, differential geometry, operator algebra, partial differential equations and mathematical physics. Keeping up with the fast development of this exciting area of research, Ali Baklouti (University of Sfax) and Takaaki Nomura (Kyushu University) launched a series of seminars on the topic, the first of which took place on November 2009 in Kerkennah Islands, the second in Sousse on December 2011, and the third in Hammamet on December 2013. The last seminar, which took place December 18th to 23rd 2015 in Monastir, Tunisia, has promoted further research in all the fields where the main focus was in the area of Analysis, algebra and geometry and on topics of joint collaboration of many teams in several corners. Many experts from both countries have been involved.

Despite its seemingly deterministic nature, the study of whole numbers, especially prime numbers, has many interactions with probability theory, the theory of random processes and events. This surprising connection was first discovered around 1920, but in recent years the links have become much deeper and better understood. Aimed at beginning graduate students, this textbook is the first to explain some of the most modern parts of the story. Such topics include the Chebychev bias, universality of the Riemann zeta function, exponential sums and the bewitching shapes known as Kloosterman paths. Emphasis is given throughout to probabilistic ideas in the arguments, not just the final statements, and the focus is on key examples over technicalities. The book develops probabilistic number theory from scratch, with short appendices summarizing the most important background results from number theory, analysis and probability, making it a readable and incisive introduction to this beautiful area of mathematics.

In 1875, Elwin Bruno Christoffel introduced a special class of words on a binary alphabet linked to continued fractions which would go onto be known as Christoffel words. Some years later, Andrey Markoff published his famous theory, the now called Markoff theory. It characterized certain quadratic forms and certain real numbers by extremal inequalities. Both classes are constructed using certain natural numbers - known as Markoff numbers - and they are characterized by a certain Diophantine equality. More basically, they are constructed using certain words - essentially the Christoffel words. The link between Christoffel words and the theory of Markoff was noted by Ferdinand Frobenius in 1913, but has been neglected in recent times. Motivated by this overlooked connection, this book looks to expand on the relationship between these two areas. Part 1 focuses on the classical theory of Markoff, while Part II explores the more advanced and recent results of the theory of Christoffel words.

In the spring of 1976, George Andrews of Pennsylvania State University visited the library at Trinity College, Cambridge, to examine the papers of the late G.N. Watson. Among these papers, Andrews discovered a sheaf of 138 pages in the handwriting of Srinivasa Ramanujan. This manuscript was soon designated, "Ramanujan's lost notebook." Its discovery has frequently been deemed the mathematical equivalent of finding Beethoven's tenth symphony. This fifth and final installment of the authors' examination of Ramanujan's lost notebook focuses on the mock theta functions first introduced in Ramanujan's famous Last Letter. This volume proves all of the assertions about mock theta functions in the lost notebook and in the Last Letter, particularly the celebrated mock theta conjectures. Other topics feature Ramanujan's many elegant Euler products and the remaining entries on continued fractions not discussed in the preceding volumes. Review from the second volume:"Fans of Ramanujan's mathematics are sure to be delighted by this book. While some of the content is taken directly from published papers, most chapters contain new material and some previously published proofs have been improved. Many entries are just begging for further study and will undoubtedly be inspiring research for decades to come. The next installment in this series is eagerly awaited."- MathSciNet Review from the first volume:"Andrews and Berndt are to be congratulated on the job they are doing. This is the first step...on the way to an understanding of the work of the genius Ramanujan. It should act as an inspiration to future generations of mathematicians to tackle a job that will never be complete."- Gazette of the Australian Mathematical Society

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.