Number theory Books

Book SynopsisA Course in Computational Number Theory uses the computer as a tool for motivation and explanation. The book is designed for the reader to quickly access a computer and begin doing personal experiments with the patterns of the integers. It presents and explains many of the fastest algorithms for working with integers. Traditional topics are covered, but the text also explores factoring algorithms, primality testing, the RSA public-key cryptosystem, and unusual applications such as check digit schemes and a computation of the energy that holds a salt crystal together. Advanced topics include continued fractions, Pell's equation, and the Gaussian primes.Table of ContentsPreface. Notation. Chapter 1 Fundamentals. 1.0 Introduction. 1.1 A Famous Sequence of Numbers. 1.2 The Euclidean ALgorithm. The Oldest Algorithm. Reversing the Euclidean Algorithm. The Extended GCD Algorithm. The Fundamental Theorem of Arithmetic. Two Applications. 1.3 Modular Arithmetic. 1.4 Fast Powers. A Fast Alforithm for ExponentiationPowers of Matrices, Big-O Notation. Chapter 2 Congruences, Equations, and Powers. 2.0 Introduction. 2.1 Solving Linear Congruences. Linear Diophantine Equations in Two Variables. The Conductor. An Importatnt Quadratic Congruence. 2.2 The Chinese Remainder Theorem. 2.3 PowerMod Patterns. Fermat's Little Theorem. More Patterns in Powers. 2.4 Pseudoprimes. Using the Pseudoprime Test. Chapter 3 Euler's Function. 3.0 Introduction. 3.1 Euler's Function. 3.2 Perfect Numbers and Their Relatives. The Sum of Divisors Function. Perfect Numbers. Amicalbe, Abundant, and Deficient Numbers. 3.3 Euler's Theorem. 3.4 Primitive Roots for Primes. The order of an Integer. Primes Have PRimitive roots. Repeating Decimals. 3.5 Primitive Roots for COmposites. 3.6 The Universal Exponent. Universal Exponents. Power Towers. The Form of Carmichael Numbers. Chapter 4 Prime Numbers. 4.0 Introduction. 4.1 The Number of Primes. We'll Never Run Out of Primes. The Sieve of Eratosthenes. Chebyshev's Theorem and Bertrand's Postulate. 4.2 Prime Testing and Certification. Strong Pseudoprimes. Industrial-Grade Primes. Prime Certification Via Primitive Roots. An Improvement. Pratt Certificates. 4.3 Refinements and Other Directions. Other PRimality Tests. Strong Liars are Scarce. Finding the nth Prime. 4.4 A Doszen Prime Mysteries. Chapter 5 Some Applications. 5.0 Introduction. 5.1 Coding Secrets. Tossing a Coin into a Well. The RSA Cryptosystem. Digital Signatures. 5.2 The Yao Millionaire Problem. 5.3 Check Digits. Basic Check Digit Schemes. A Perfect Check Digit Method. Beyond Perfection: Correcting Errors. 5.4 Factoring Algorithms. Trial Division. Fermat's Algorithm. Pollard Rho. Pollard p-1. The Current Scene. Chapter 6 Quadratic Residues. 6.0 Introduction. 6.1 Pepin's Test. Quadratic Residues. Pepin's Test. Primes Congruent to 1 (Mod. 6.2 Proof of Quadratic Reciprocity. Gauss's Lemma. Proof of Quadratic Recipocity. Jacobi's Extension. An Application to Factoring. 6.3 Quadratic Equations. Chapter 7 Continuec Faction. 7.0 Introduction. 7.1 FInite COntinued Fractions. 7.2 Infinite Continued Fractions. 7.3 Periodic Continued Fractions. 7.4 Pell's Equation. 7.5 Archimedes and the Sun God's Cattle. Wurm's Version: Using Rectangular Bulls. The Real Cattle Problem. 7.6 Factoring via Continued Fractions. Chapter 8 Prime Testing with Lucas Sequences. 8.0 Introduction. 8.1 Divisibility Properties of Lucas Sequencese. 8.2 Prime Tests Using Lucas Sequencesse. Lucas Certification. The Lucas-Lehmer Algorithm Explained. Luca Pseudoprimes. Strong Quadratic Pseudoprimes. Primality Testing's Holy Grail. Chapter 9 Prime Imaginaries and Imaginary Primes. 9.0 Introduction. 9.1 Sums of Two Squares. 9.2 The Gaussian Intergers. Complex Number Theory. Gaussian Primes. The Moat Problem. The Gaussian Zoo. 9.3 Higher Reciprocity 325. Appendix A. Maathematica Basics. 1.0 Introduction. A.1 Plotting. A.2 Typesetting. Sending Files By E-Mail. A.3 Types of Functions. A.4 Lists. A.5 Programs. A.6 Solving Equations. A.7 Symbolic Algebra. Appendix B Lucas Certificates Exist. References. Index of Mathematica Objects. Subject Index.

Read more less

Book SynopsisNumber Theory: A Lively Introduction with Proofs, Applications, and Stories, is a new book that provides a rigorous yet accessible introduction to elementary number theory along with relevant applications. Readable discussions motivate new concepts and theorems before their formal definitions and statements are presented. Many theorems are preceded by Numerical Proof Previews, which are numerical examples that will help give students a concrete understanding of both the statements of the theorems and the ideas behind their proofs, before the statement and proof are formalized in more abstract terms. In addition, many applications of number theory are explained in detail throughout the text, including some that have rarely (if ever) appeared in textbooks. A unique feature of the book is that every chapter includes a math myth, a fictional story that introduces an important number theory topic in a friendly, inviting manner. Many of the exerciTable of ContentsPreface. To the Student. To the Instructor. Acknowledgements. 0. Prologue. 1. Numbers, Rational and Irrational. (Historical figures: Pythagoras and Hypatia). 1.1 Numbers and the Greeks. 1.2 Numbers you know. 1.3 A First Look at Proofs. 1.4 Irrationality of he square root of 2. 1.5 Using Quantifiers. 2. Mathematical Induction. (Historical figure: Noether). 2.1.The Principle of Mathematical Induction. 2.2 Strong Induction and the Well Ordering Principle. 2.3 The Fibonacci Sequence and the Golden Ratio. 2.4 The Legend of the Golden Ratio. 3. Divisibility and Primes. (Historical figure: Eratosthenes). 3.1 Basic Properties of Divisibility. 3.2 Prime and Composite Numbers. 3.3 Patterns in the Primes. 3.4 Common Divisors and Common Multiples. 3.5 The Division Theorem. 3.6 Applications of gcd and lcm. 4.The Euclidean Algorithm. (Historical figure: Euclid). 4.1 The Euclidean Algorithm. 4.2 Finding the Greatest Common Divisor. 4.3 A Greeker Argument that the square root of 2 is Irrational. 5. Linear Diophantine Equations. (Historical figure: Diophantus). 5.1 The Equation aX + bY = 1. 5.2 Using the Euclidean Algorithm to Find a Solution. 5.3 The Diophantine Equation aX + bY = n. 5.4 Finding All Solutions to a Linear Diophantine Equation. 6. The Fundamental Theorem of Arithmetic. (Historical figure: Mersenne). 6.1 The Fundamental Theorem. 6.2 Consequences of the Fundamental Theorem. 7. Modular Arithmetic. (Historical figure: Gauss). 7.1 Congruence modulo n. 7.2 Arithmetic with Congruences. 7.3 Check Digit Schemes. 7.4 The Chinese Remainder Theorem. 7.5 The Gregorian Calendar. 7.6 The Mayan Calendar. 8. Modular Number Systems. (Historical figure: Turing). 8.1 The Number System Zn: an Informal View. 8.2 The Number System Zn: Definition and Basic Properties. 8.3 Multiplicative Inverses in Zn. 8.4 Elementary Cryptography. 8.5 Encryption Using Modular Multiplication. 9. Exponents Modulo n. (Historical figure: Fermat). 9.1 Fermat's Little Theorem. 9.2 Reduced Residues and the Euler \phi-function. 9.3 Euler's Theorem. 9.4 Exponentiation Ciphers with a Prime modulus. 9.5 The RSA Encryption Algorithm. 10. Primitive Roots. (Historical figure: Lagrange). 10.1 Zn. 10.2 Solving Polynomial Equations in Zn. 10.3 Primitive Roots. 10.4 Applications of Primitive Roots. 11. Quadratic Residues. (Historical figure: Eisenstein) 11.1 Squares Modulo n 11.2 Euler's Identity and the Quadratic Character of -1 11.3 The Law of Quadratic Reciprocity 11.4 Gauss's Lemma 11.5 Quadratic Residues and Lattice Points. 11.6 The Proof of Quadratic Reciprocity. 12. Primality Testing. (Historical figure: Erdös). 12.1 Primality testing. 12.2 Continued Consideration of Charmichael Numbers. 12.3 The Miller-Rabin Primality test. 12.4 Two Special Polynomial Equations in Zp. 12.5 Proof that Millar-Rabin is Effective. 12.6 Prime Certificates. 12.7 The AKS Deterministic Primality Test. 13. Gaussian Integers. (Historical figure: Euler). 13.1 Definition of Gaussian Integers 13.2 Divisibility and Primes in Z[i]. 13.3 The Division Theorem for the Gaussian Integers. 13.4 Unique Factorization in Z[i]. 13.5 Gaussian Primes. 13.6 Fermat's Two Squares Theorem. 14. Continued Fractions. (Historical figure: Ramanujan). 14.1 Expressing Rational Numbers as Continued Fractions. 14.2 Expressing Irrational Numbers as Continued Fractions. 14.3 Approximating Irrational Numbers Using Continued Fractions. 14.4 Proving that Convergents are Fantastic Approximations. 15. Some Nonlinear Diophantine Equations. (Historical figure: Germain). 15.1 Pell's Equation 15.2 Fermat's Last Theorem 15.3 Proof of Fermat's Last Theorem for n = 4. 15.4 Germain's Contributions to Fermat's Last Theorem 15.5 A Geometric look at the Equation x4 + y4 = z2. Appendix: Axioms of Number Theory. A.1 What is a Number System? A.2 Order Properties of the Integers. A.3 Building Results From Our Axioms. A.4 The Principle of Mathematical Induction.

Read more less

Book SynopsisDevised in the 19th century, Gauss and Jacobi Sums are classical formulas that form the basis for contemporary research in many of today's sciences. This book offers readers a solid grounding on the origin of these abstract, general theories.Table of ContentsGauss Sums. Jacobi Sums and Cyclotomic Numbers. Evaluation of Jacobi Sums Over Fp. Determination of Gauss Sums Over Fp. Difference Sets. Jacobsthal Sums Over Fp. Residuacity. Reciprocity Laws. Congruences for Binomial Coefficients. Diagonal Equations over Finite Fields. Gauss Sums over Fq. Eisenstein Sums. Brewer Sums. A General Eisenstein Reciprocity Law. Research Problems. Bibliography. Notation. Indexes.

Read more less

Book SynopsisA complete, self-contained introduction to a powerful and resurging mathematical discipline. Combinatorial Geometry presents and explains with complete proofs some of the most important results and methods of this relatively young mathematical discipline, started by Minkowski, Fejes Toth, Rogers, and Erd???s.Table of ContentsARRANGEMENTS OF CONVEX SETS. Geometry of Numbers. Approximation of a Convex Set by Polygons. Packing and Covering with Congruent Convex Discs. Lattice Packing and Lattice Covering. The Method of Cell Decomposition. Methods of Blichfeldt and Rogers. Efficient Random Arrangements. Circle Packings and Planar Graphs. ARRANGEMENTS OF POINTS AND LINES. Extremal Graph Theory. Repeated Distances in Space. Arrangement of Lines. Applications of the Bounds on Incidences. More on Repeated Distances. Geometric Graphs. Epsilon Nets and Transversals of Hypergraphs. Geometric Discrepancy. Hints to Exercises. Bibliography. Indexes.

Read more less

Book SynopsisExplores fundamental concepts in arithmetic. This book begins with the definitions and properties of algebraic fields. It then discusses the theory of divisibility from an axiomatic viewpoint, rather than by the use of ideals. It also gives an introduction to p-adic numbers and their uses, which are important in modern number theory.Table of ContentsCh. I Algebraic Fields 1 Ch. II Theory of Divisibility (Kronecker, Dedekind) 33 Ch. III Local Primadic Analysis (Kummer, Hensel) 71 Ch. IV Algebraic Number Fields 141 Amendments 223

Read more less

Book SynopsisDevelops a systematic general approach to the proof of ergodic theorems for a large class of non-amenable locally compact groups and their lattice subgroups. This book formulates simple general conditions on the spectral theory of the group and the regularity of the averaging sets, which suffice to guarantee convergence to the ergodic mean.Table of ContentsPreface vii 0.1 Main objectives vii 0.2 Ergodic theory and amenable groups viii 0.3 Ergodic theory and nonamenable groups x Chapter 1. Main results: Semisimple Lie groups case 1 1.1 Admissible sets 1 1.2 Ergodic theorems on semisimple Lie groups 2 1.3 The lattice point-counting problem in admissible domains 4 1.4 Ergodic theorems for lattice subgroups 6 1.5 Scope of the method 8 Chapter 2. Examples and applications 11 2.1 Hyperbolic lattice points problem 11 2.2 Counting integral unimodular matrices 12 2.3 Integral equivalence of general forms 13 2.4 Lattice points in S-algebraic groups 15 2.5 Examples of ergodic theorems for lattice actions 16 Chapter 3. Definitions, preliminaries, and basic tools 19 3.1 Maximal and exponential-maximal inequalities 19 3.2 S-algebraic groups and upper local dimension 21 3.3 Admissible and coarsely admissible sets 21 3.4 Absolute continuity and examples of admissible averages 23 3.5 Balanced and well-balanced families on product groups 26 3.6 Roughly radial and quasi-uniform sets 27 3.7 Spectral gap and strong spectral gap 29 3.8 Finite-dimensional subrepresentations 30 Chapter 4. Main results and an overview of the proofs 33 4.1 Statement of ergodic theorems for S-algebraic groups 33 4.2 Ergodic theorems in the absence of a spectral gap: overview 35 4.3 Ergodic theorems in the presence of a spectral gap: overview 38 4.4 Statement of ergodic theorems for lattice subgroups 40 4.5 Ergodic theorems for lattice subgroups: overview 42 4.6 Volume regularity and volume asymptotics: overview 44 Chapter 5. Proof of ergodic theorems for S-algebraic groups 47 5.1 Iwasawa groups and spectral estimates 47 5.2 Ergodic theorems in the presence of a spectral gap 50 5.3 Ergodic theorems in the absence of a spectral gap, I 56 5.4 Ergodic theorems in the absence of a spectral gap, II 57 5.5 Ergodic theorems in the absence of a spectral gap, III 60 5.6 The invariance principle and stability of admissible averages 67 Chapter 6. Proof of ergodic theorems for lattice subgroups 71 6.1 Induced action 71 6.2 Reduction theorems 74 6.3 Strong maximal inequality 75 6.4 Mean ergodic theorem 78 6.5 Pointwise ergodic theorem 83 6.6 Exponential mean ergodic theorem 84 6.7 Exponential strong maximal inequality 87 6.8 Completion of the proofs 90 6.9 Equidistribution in isometric actions 91 Chapter 7. Volume estimates and volume regularity 93 7.1 Admissibility of standard averages 93 7.2 Convolution arguments 98 7.3 Admissible, well-balanced, and boundary-regular families 101 7.4 Admissible sets on principal homogeneous spaces 105 7.5 Tauberian arguments and Holder continuity 107 Chapter 8. Comments and complements 113 8.1 Lattice point-counting with explicit error term 113 8.2 Exponentially fast convergence versus equidistribution 115 8.3 Remark about balanced sets 116 Bibliography 117 Index 121

Read more less

Book SynopsisStudies the intersection cohomology of the Shimura varieties associated to unitary groups of any rank over Q. The author also uses the method developed by Langlands, Ihara, and Kottwitz, which is to compare the Grothendieck-Lefschetz fixed point formula and the Arthur-Selberg trace formula.Trade Review"This book is a research monograph, yet the author takes care in recalling in detail the relevant notation and previous results instead of just referring to the literature. Also, explicit calculations are given, making the book readable not only for experts but also for interested advanced students."--Eva Viehmann, Mathematical ReviewsTable of ContentsPreface vii Chapter 1: The fixed point formula 1 Chapter 2: The groups 31 Chapter 3: Discrete series 47 Chapter 4: Orbital integrals at p 63 Chapter 5: The geometric side of the stable trace formula 79 Chapter 6: Stabilization of the fixed point formula 85 Chapter 7: Applications 99 Chapter 8: The twisted trace formula 119 Chapter 9: The twisted fundamental lemma 157 Appendix: Comparison of two versions of twisted transfer factors 189 Bibliography 207 Index 215

Read more less

Book SynopsisWeyl group multiple Dirichlet series are generalizations of the Riemann zeta function. Like the Riemann zeta function, they are Dirichlet series with analytic continuation and functional equations, having applications to analytic number theory. This book proves foundational results about these series and develops their combinatorics.Table of Contents*FrontMatter, pg. i*Contents, pg. v*Preface, pg. vii*Chapter One. Type A Weyl Group Multiple Dirichlet Series, pg. 1*Chapter Two. Crystals and Gelfand-Tsetlin Patterns, pg. 10*Chapter Three. Duality, pg. 22*Chapter Four. Whittaker Functions, pg. 26*Chapter Five. Tokuyama's Theorem, pg. 31*Chapter Six. Outline of the Proof, pg. 36*Chapter Seven. Statement B Implies Statement A, pg. 51*Chapter Eight. Cartoons, pg. 54*Chapter Nine. Snakes, pg. 58*Chapter Ten. Noncritical Resonances, pg. 64*Chapter Eleven. Types, pg. 67*Chapter Twelve. Knowability, pg. 74*Chapter Thirteen. The Reduction to Statement D, pg. 77*Chapter Fourteen. Statement E Implies Statement D, pg. 87*Chapter Fifteen. Evaluation of LAMBDAGAMMA and LAMBDADELTA, and Statement G, pg. 89*Chapter Sixteen. Concurrence, pg. 96*Chapter Seventeen. Conclusion of the Proof, pg. 104*Chapter Eighteen. Statement B and Crystal Graphs, pg. 108*Chapter Nineteen. Statement B and the Yang-Baxter Equation, pg. 115*Chapter Twenty. Crystals and p-adic Integration, pg. 132*Bibliography, pg. 143*Notation, pg. 149*Index, pg. 155

Read more less

Book SynopsisIn the earlier monograph Pseudo-reductive Groups, Brian Conrad, Ofer Gabber, and Gopal Prasad explored the general structure of pseudo-reductive groups. In this new book, Classification of Pseudo-reductive Groups, Conrad and Prasad go further to study the classification over an arbitrary field. An isomorphism theorem proved here determines the autoTrade Review"This book is beautiful and will be at the origin of many advances in the general theory of arbitrary algebraic groups."--Bertrand Remy, MathSciNetTable of Contents*Frontmatter, pg. i*Contents, pg. v*1. Introduction, pg. 1*2. Preliminary notions, pg. 15*3. Field-theoretic and linear-algebraic invariants, pg. 28*4. Central extensions and groups locally of minimal type, pg. 57*5. Universal smooth k-tame central extension, pg. 66*6. Automorphisms, isomorphisms, and Tits classification, pg. 79*7. Constructions with regular degenerate quadratic forms, pg. 108*8. Constructions when PHI has a double bond, pg. 138*9. Generalization of the standard construction, pg. 171*A. Pseudo-isogenies, pg. 181*B. Clifford constructions, pg. 187*C. Pseudo-split and quasi-split forms, pg. 206*D. Basic exotic groups of type F4 of relative rank 2, pg. 230*Bibliography, pg. 239*Index, pg. 241

Read more less

Book SynopsisTrade Review"Fascinating... Chamberland offers enticing explanations that will leave readers hungry to know more. This wonderful book never loses its focus or momentum."--Publishers Weekly "[B]oth amateur and professional mathematicians alike will find new items of interest here... [A] welcome, splendid, fruitful addition to my math bookshelf."--Math Tango blog "The collection is outright delightful. It will agitate the minds of students and shake the sense of know-all off many a professional and most of the amateurs."--Alexander Bogomolny, Cut the Knot blog "Boring deep into the innocuous-looking number one, Chamberland opens an unexpected entry point into a dizzying maze of infinities... A bracing mathematical adventure."--Booklist "The exotics like pi and e have gotten their share of attention in the world of popular mathematical writing. Now it's time to give proper attention to the integers 1 through 9... [Single Digits] is consistently entertaining and well-written."--MAA Reviews "Chamberland takes readers on a fascinating exploration of small numbers, from one to nine, looking at their history, applications, and connections to various areas of mathematics, including number theory, geometry, chaos theory, numerical analysis, and mathematical physics... Appealing to high-school and college students, professional mathematicians, and those mesmerized by patterns, this book shows that single digits offer a plethora of possibilities that readers can count on."--DVD, Lunar and Planetary Information Bulletin "Chamberland makes this an entertaining and historical exposition, using wit and humor throughout."--Math Horizons "To put it simply, this book is a delight. Chamberland has assembled a fascinating collection of vignettes, each tied to a digit from one to nine, that inform, entertain, and intrigue... This wide spectrum of ideas is consistently interesting, and the author's skill in mining each nugget is worthy of great respect."--Choice "The range of topics included virtually guarantees that any reader will find new and unfamiliar material to enjoy... [Single Digits] is a very enjoyable book which, at many points, makes some very deep mathematics quite accessible. Highly recommended."--Keith Johnson, CMS Notes "For instructors of math courses of all levels, the vignettes in Single Digits can provide a very readable introduction or jumping-off point for discussions and projects... In an introductory group theory course, it would be a good exercise for students to consider perfect riffle shuffles in decks of size other than 52. Finally, a statistics class collecting and analyzing real-world data sets could consider whether Benford's Law applies in their situation."--Matthew Welz, MAA Focus "I highly recommend Single Digits: In Praise of Small Numbers. It would be a fine addition to any high school or math department library. As a carefully curated set of interesting topics, it would serve as a good place to start exploring the ocean of ideas in mathematics."--Bruce Cohen, NCTMTable of Contents*Frontmatter, pg. i*Contents, pg. v*Preface, pg. xi*Chapter 1. The Number One, pg. 1*Chapter 2. The Number Two, pg. 24*Chapter 3. The Number Three, pg. 69*Chapter 4. The Number Four, pg. 111*Chapter 5. The Number Five, pg. 132*Chapter 6. The Number Six, pg. 156*Chapter 7. The Number Seven, pg. 170*Chapter 8. The Number Eight, pg. 191*Chapter 9. The Number Nine, pg. 205*Chapter 10. Solutions, pg. 216*Further reading, pg. 219*Credits for illustrations, pg. 223*Index, pg. 225

Read more less

Book SynopsisTrade Review"[Berkeley lectures on p-adic] represents a new beginning advancing p-adic geometry and its relation to these other paramount areas. It should be treated now as a ‘must have’ in any aspiring p-adic arithmetic geometer’s library and a critical resource for all researchers in the field."---Lance Edward Miller, MathSciNet

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

Book SynopsisContains papers presented at a conference held in April 2007 at the CRM in Montreal honouring the remarkable contributions of John McKay. This title features the papers that cover a wide range of topics, including group theory, symmetries, modular functions, and geometry, with focus on 2 areas: 'Monstrous Moonshine' and the 'McKay Correspondence'.

Read more less

Book SynopsisIn these volumes, a reader will find all of John Tate's published mathematical papers-spanning more than six decades-enriched by new comments made by the author. Included also is a selection of his letters. His letters give us a close view of how he works and of his ideas in process of formation.Table of Contents Part I: Fourier analysis in number fields and Hecke's zeta-functions by J. T. Tate A note on finite ring extensions by E. Artin and J. T. Tate On the relation between extremal points of convex sets and homomorphisms of algebras by J. Tate Genus change in inseparable extensions of function fields by J. Tate On Chevalley's proof of Luroth's theorem by S. Lang and J. Tate The higher dimensional cohomology groups of class field theory by J. Tate The cohomology groups of algebraic number fields by J. T. Tate On the Galois cohomology of unramified extensions of function fields in one variable by Y. Kawada and J. Tate On the characters of finite groups by R. Brauer and J. Tate Homology of Noetherian rings and local rings by J. Tate WC-groups over $p$-adic fields by J. Tate On the inequality of Castelnuovo-Severi by E. Artin and J. Tate On the inequality of Castelnuovo-Severi, and Hodge's theorem by J. Tate Principal homogeneous spaces over abelian varieties by S. Lang and J. Tate Principal homogeneous spaces for abelian varieties by J. Tate A different with an odd class by A. Frohlich, J.-P. Serre, and J. Tate Nilpotent quotient groups by J. Tate Duality theorems in Galois cohomology over number fields by J. Tate Ramification groups of local fields by S. Sen and J. Tate Formal complex multiplication in local fields by J. Lubin and J. Tate Algebraic cycles and poles of zeta functions by J. T. Tate Elliptic curves and formal groups by J. Lubin, J. Serre, and J. Tate On the conjectures of Birch and Swinnerton-Dyer and a geometric analog by J. Tate Formal moduli for one-parameter formal Lie groups by J. Lubin and J. Tate The cohomology groups of tori in finite Galois extensions of number fields by J. Tate Global class field theory by J. T. Tate Endomorphisms of abelian varieties over finite fields by J. Tate The rank of elliptic curves by J. T. Tate and I. R. Safarevic Residues of differentials on curves by J. Tate $p$-divisible groups by J. T. Tate The work of David Mumford by J. Tate Classes d'isogenie des varietes abeliennes sur un corps fini (d'apres T. Honda) by J. Tate Good reduction of abelian varieties by J.-P. Serre and J. Tate Group schemes of prime order by J. Tate and F. Oort Symbols in arithmetic by J. Tate Rigid analytic spaces by J. Tate The Milnor ring of a global field by H. Bass and J. Tate Appendix by H. Bass and J. Tate Letter from Tate to Iwasawa on a relation between $K_2$ and Galois cohomology by J. Tate Points of order 13 on elliptic curves by B. Mazur and J. Tate The arithmetic of elliptic curves by J. T. Tate The 1974 Fields Medals (I): An algebraic geometer by J. Tate Algorithm for determining the type of a singular fiber in an elliptic pencil by J. Tate Letters by J. Tate

Read more less

Book SynopsisAn exciting approach to the history and mathematics of number theory . . . the author's style is totally lucid and very easy to read . . .the result is indeed a wonderful story. Mathematical Reviews Written in a unique and accessible style for readers of varied mathematical backgrounds, the Second Edition of Primes of the Form p = x2+ ny2 details the history behind how Pierre de Fermat's work ultimately gave birth to quadratic reciprocity and the genus theory of quadratic forms. The book also illustrates how results of Euler and Gauss can be fully understood only in the context of class field theory, and in addition, explores a selection of the magnificent formulas of complex multiplication. Primes of the Form p = x2 + ny2, Second Edition focuses on addressing the question of when a prime p is of the form x2<Table of ContentsPreface to the First Edition ixPreface to the Second Edition xiNotation xiiiIntroduction 1Chapter One: From Fermat to GaussChapter Two: Class Field TheoryChapter Three: Complex MultiplicationChapter Four: Additional TopicsRefrencesAdditional ReferencesIndex

Read more less

Book SynopsisVolume II provides an advanced approach to the extended gibonacci family, which includes Fibonacci, Lucas, Pell, Pell-Lucas, Jacobsthal, Jacobsthal-Lucas, Vieta, Vieta-Lucas, and Chebyshevpolynomials of both kinds. This volume offers a uniquely unified, extensive, and historical approach that will appeal to both students and professional mathematicians. As in Volume I, Volume II focuses on problem-solving techniques such as pattern recognition;conjecturing; proof-techniques, and applications. It offers a wealth of delightful opportunities toexplore and experiment, as well as plentiful material for group discussions, seminars, presentations, and collaboration. In addition, the material covered in this book promotes intellectual curiosity, creativity, and ingenuity. Volume II features: A wealth of examples, applications, and exercises of varying degrees of difficulty and sophistication. Numerous combinatorial and graph-theoretic proofs and techniques. A uniquely thorough discussTable of ContentsList of Symbols xiii Preface xv 31. Fibonacci and Lucas Polynomials I 1 31.1. Fibonacci and Lucas Polynomials 3 31.2. Pascal’s Triangle 18 31.3. Additional Explicit Formulas 22 31.4. Ends of the Numbers ln 25 31.5. Generating Functions 26 31.6. Pell and Pell–Lucas Polynomials 27 31.7. Composition of Lucas Polynomials 33 31.8. De Moivre-like Formulas 35 31.9. Fibonacci–Lucas Bridges 36 31.10. Applications of Identity (31.51) 37 31.11. Infinite Products 48 31.12. Putnam Delight Revisited 51 31.13. Infinite Simple Continued Fraction 54 32. Fibonacci and Lucas Polynomials II 65 32.1. Q-Matrix 65 32.2. Summation Formulas 67 32.3. Addition Formulas 71 32.4. A Recurrence for n2 76 32.5. Divisibility Properties 82 33. Combinatorial Models II 87 33.1. A Model for Fibonacci Polynomials 87 33.2. Breakability 99 33.3. A Ladder Model 101 33.4. A Model for Pell–Lucas Polynomials: Linear Boards 102 33.5. Colored Tilings 103 33.6. A New Tiling Scheme 104 33.7. A Model for Pell–Lucas Polynomials: Circular Boards 107 33.8. A Domino Model for Fibonacci Polynomials 114 33.9. Another Model for Fibonacci Polynomials 118 34. Graph-Theoretic Models II 125 34.1. Q-Matrix and Connected Graph 125 34.2. Weighted Paths 126 34.3. Q-Matrix Revisited 127 34.4. Byproducts of the Model 128 34.5. A Bijection Algorithm 136 34.6. Fibonacci and Lucas Sums 137 34.7. Fibonacci Walks 140 35. Gibonacci Polynomials 145 35.1. Gibonacci Polynomials 145 35.2. Differences of Gibonacci Products 159 35.3. Generalized Lucas and Ginsburg Identities 174 35.4. Gibonacci and Geometry 181 35.5. Additional Recurrences 184 35.6. Pythagorean Triples 188 36. Gibonacci Sums 195 36.1. Gibonacci Sums 195 36.2. Weighted Sums 206 36.3. Exponential Generating Functions 209 36.4. Infinite Gibonacci Sums 215 37. Additional Gibonacci Delights 233 37.1. Some Fundamental Identities Revisited 233 37.2. Lucas and Ginsburg Identities Revisited 238 37.3. Fibonomial Coefficients 247 37.4. Gibonomial Coefficients 250 37.5. Additional Identities 260 37.6. Strazdins’ Identity 264 38. Fibonacci and Lucas Polynomials III 269 38.1. Seiffert’s Formulas 270 38.2. Additional Formulas 294 38.3. Legendre Polynomials 314 39. Gibonacci Determinants 321 39.1. A Circulant Determinant 321 39.2. A Hybrid Determinant 323 39.3. Basin’s Determinant 333 39.4. Lower Hessenberg Matrices 339 39.5. Determinant with a Prescribed First Row 343 40. Fibonometry II 347 40.1. Fibonometric Results 347 40.2. Hyperbolic Functions 356 40.3. Inverse Hyperbolic Summation Formulas 361 41. Chebyshev Polynomials 371 41.1. Chebyshev Polynomials Tn(x) 372 41.2. Tn(x) and Trigonometry 384 41.3. Hidden Treasures in Table 41.1 386 41.4. Chebyshev Polynomials Un(x) 396 41.5. Pell’s Equation 398 41.6. Un(x) and Trigonometry 399 41.7. Addition and Cassini-like Formulas 401 41.8. Hidden Treasures in Table 41.8 402 41.9. A Chebyshev Bridge 404 41.10. Tn and Un as Products 405 41.11. Generating Functions 410 42. Chebyshev Tilings 415 42.1. Combinatorial Models for Un 415 42.2. Combinatorial Models for Tn 420 42.3. Circular Tilings 425 43. Bivariate Gibonacci Family I 429 43.1. Bivariate Gibonacci Polynomials 429 43.2. Bivariate Fibonacci and Lucas Identities 430 43.3. Candido’s Identity Revisited 439 44. Jacobsthal Family 443 44.1. Jacobsthal Family 444 44.2. Jacobsthal Occurrences 450 44.3. Jacobsthal Compositions 452 44.4. Triangular Numbers in the Family 459 44.5. Formal Languages 468 44.6. A USA Olympiad Delight 480 44.7. A Story of 1, 2, 7, 42, 429,…483 44.8. Convolutions 490 45. Jacobsthal Tilings and Graphs 499 45.1. 1 × n Tilings 499 45.2. 2 × n Tilings 505 45.3. 2 × n Tubular Tilings 510 45.4. 3 × n Tilings 514 45.5. Graph-Theoretic Models 518 45.6. Digraph Models 522 46. Bivariate Tiling Models 537 46.1. A Model for 𝑓n(x, y) 537 46.2. Breakability 539 46.3. Colored Tilings 542 46.4. A Model for ln(x, y) 543 46.5. Colored Tilings Revisited 545 46.6. Circular Tilings Again 547 47. Vieta Polynomials 553 47.1. Vieta Polynomials 554 47.2. Aurifeuille’s Identity 567 47.3. Vieta–Chebyshev Bridges 572 47.4. Jacobsthal–Chebyshev Links 573 47.5. Two Charming Vieta Identities 574 47.6. Tiling Models for Vn 576 47.7. Tiling Models for 𝑣n(x) 582 48. Bivariate Gibonacci Family II 591 48.1. Bivariate Identities 591 48.2. Additional Bivariate Identities 594 48.3. A Bivariate Lucas Counterpart 599 48.4. A Summation Formula for 𝑓2n(x, y) 600 48.5. A Summation Formula for l2n(x, y) 602 48.6. Bivariate Fibonacci Links 603 48.7. Bivariate Lucas Links 606 49. Tribonacci Polynomials 611 49.1. Tribonacci Numbers 611 49.2. Compositions with Summands 1, 2, and 3 613 49.3. Tribonacci Polynomials 616 49.4. A Combinatorial Model 618 49.5. Tribonacci Polynomials and the Q-Matrix 624 49.6. Tribonacci Walks 625 49.7. A Bijection between the Two Models 627 Appendix 631 A.1. The First 100 Fibonacci and Lucas Numbers 631 A.2. The First 100 Pell and Pell–Lucas Numbers 634 A.3. The First 100 Jacobsthal and Jacobsthal–Lucas Numbers 638 A.4. The First 100 Tribonacci Numbers 642 Abbreviations 644 Bibliography 645 Solutions to Odd-Numbered Exercises 661 Index 725

Read more less

Book SynopsisA. Prime Numbers.- B. Divisibility.- C. Additive Number Theory.- D. Diophantine Equations.- E. Sequences of Integers.- F. None of the Above.- Index of Authors Cited.- General Index.Trade ReviewFrom the reviews of the third edition: "This is the third edition of Richard Guy’s well-known problem book on number theory … . The earlier editions have served well in providing beginners as well as seasoned researchers in number theory with a good supply of problems. … many of the problems from earlier editions have been expanded with more up-to-date comments and remarks. … There is little doubt that a new generation of talented young mathematicians will make very good use of this book … ." (P. Shiu, The Mathematical Gazette, Vol. 89 (516), 2005)"The earlier editions of this book are among the most-opened books on the shelves of many practicing number theorists. The descriptions of state-of-the-art results on every topic and the extensive bibliographies in each section provide valuable ports of entry to the vast literature. A new and promising addition to this third edition is the inclusion of frequent references to entries in the Online encyclopedia of integer sequences at the end of each topic." (Greg Martin, Mathematical Reviews, Issue 2005 h)Table of ContentsPreface to the First Edition Preface to the Second Edition Preface to the Third Edition Glossary of Symbols A. Prime Numbers. A1. Prime values of quadratic functions. A2. Primes connected with factorials. A3. Mersenne primes. Repunits. Fermat numbers. Primes of shape k · 2n + 1. A4. The prime number race. A5. Arithmetic progressions of primes. A6. Consecutive primes in A.P. A7. Cunningham chains. A8. Gaps between primes. Twin primes. A9. Patterns of primes. A10. Gilbreath's conjecture. A11. Increasing and decreasing gaps. A12. Pseudoprimes. Euler pseudoprimes. Strong pseudoprimes. A13. Carmichael numbers. A14. 'Good' primes and the prime number graph. A15. Congruent products of consecutive numbers. A16. Gaussian primes. Eisenstein-Jacobi primes. A17. Formulas for primes. A18. The Erd½os-Selfridge classi.cation of primes. A19. Values of n making n - 2k prime. Odd numbers not of the form ±pa ± 2b. A20. Symmetric and asymmetric primes. B. Divisibility B1. Perfect numbers. B2. Almost perfect, quasi-perfect, pseudoperfect, harmonic, weird, multiperfect and hyperperfect numbers. B3. Unitary perfect numbers. B4. Amicable numbers. B5. Quasi-amicable or betrothed numbers. B6. Aliquot sequences. B7. Aliquot cycles. Sociable numbers. B8. Unitary aliquot sequences. B9. Superperfect numbers. B10. Untouchable numbers. B11. Solutions of mó(m) = nó(n). B12. Analogs with d(n), ók(n). B13. Solutions of ó(n) = ó(n + 1). B14. Some irrational series. B15. Solutions of ó(q) + ó(r) = ó(q + r). B16. Powerful numbers. Squarefree numbers. B17. Exponential-perfect numbers B18. Solutions of d(n) = d(n + 1). B19. (m, n + 1) and (m+1, n) with same set of prime factors. The abc-conjecture. B20. Cullen and Woodallnumbers. B21. k · 2n + 1 composite for all n. B22. Factorial n as the product of n large factors. B23. Equal products of factorials. B24. The largest set with no member dividing two others. B25. Equal sums of geometric progressions with prime ratios. B26. Densest set with no l pairwise coprime. B27. The number of prime factors of n + k which don't divide n + i, 0 ¡Ü i < k. B28. Consecutive numbers with distinct prime factors. B29. Is x determined by the prime divisors of x + 1, x + 2,. . ., x + k? B30. A small set whose product is square. B31. Binomial coeffcients. B32. Grimm's conjecture. B33. Largest divisor of a binomial coeffcient. B34. If there's an i such that n - i divides _nk_. B35. Products of consecutive numbers with the same prime factors. B36. Euler's totient function. B37. Does ö(n) properly divide n - 1? B38. Solutions of ö(m) = ó(n). B39. Carmichael's conjecture. B40. Gaps between totatives. B41. Iterations of ö and ó. B42. Behavior of ö(ó(n)) and ó(ö(n)). B43. Alternating sums of factorials. B44. Sums of factorials. B45. Euler numbers. B46. The largest prime factor of n. B47. When does 2a -2b divide na - nb? B48. Products taken over primes. B49. Smith numbers. C. Additive Number Theory C1. Goldbach's conjecture. C2. Sums of consecutive primes. C3. Lucky numbers. C4. Ulam numbers. C5. Sums determining members of a set. C6. Addition chains. Brauer chains. Hansen chains. C7. The money-changing problem. C8. Sets with distinct sums of subsets. C9. Packing sums of pairs. C10. Modular di.erence sets and error correcting codes. C11. Three-subsets with distinct sums. C12. The postage stamp problem. C13. The corresponding modular covering problem. Harmonious labelling of graphs. C14.

Read more less

Book SynopsisIntended for advanced level students in computer science and mathematics, this key text, now in a brand new edition, provides a survey of recent progress in primality testing and integer factorization, with implications for factoring based public key cryptography.Trade ReviewFrom the reviews of the second edition:"The well-written and self-contained second edition ‘is designed for a professional audience composed of researchers practitioners in industry.’ In addition, ‘this book is also suitable as a secondary text for graduate-level students in computer science, mathematics, and engineering,’ as it contains about 300 problems. … Overall … ‘this monograph provides a survey of recent progress in Primality Testing and Integer Factorization, with implications in factoring-based Public Key Cryptography.’" (Hao Wang, ACM Computing Reviews, April, 2009)“This is the second edition of a book originally published in 2004. … I used it as a reference in preparing lectures for an advanced cryptography course for undergraduates, and it proved to be a wonderful source for a general description of the algorithms. … the book will be a valuable addition to any good reference library on cryptography and number theory … . It contains descriptions of all the main algorithms, together with explanations of the key ideas behind them.” (S. C. Coutinho, SIGACT News, April, 2012)Table of ContentsPreface to the Second Edition.- Preface to the First Edition.- Number-Theoretic Preliminaries.- Problems in Number Theory. Divisibility Properties. Euclid's Algorithm and Continued Fractions. Arithmetic Functions. Linear Congruences. Quadratic Congruences. Primitive Roots and Power Residues. Arithmetic of Elliptic Curves. Chapter Notes and Further Reading.- Primality Testing and Prime Generation.- Computing with Numbers and Curves. Riemann Zeta and Dirichlet L Functions. Rigorous Primality Tests. Compositeness and Pseudoprimality Tests. Lucas Pseudoprimality Test. Elliptic Curve Primality Tests. Superpolynomial-Time Tests. Polynomial-Time Tests. Primality Tests for Special Numbers. Prime Number Generation. Chapter Notes and Further Reading.- Integer Factorization and Discrete Logarithms.- Introduction. Simple Factoring Methods. Elliptic Curve Method (ECM). General Factoring Congruence. Continued FRACtion Method (CFRAC). Quadratic Sieve (QS). Number Field Sieve (NFS). Quantum Factoring Algorithm. Discrete Logarithms. kth Roots. Elliptic Curve Discrete Logarithms. Chapter Notes and Further Reading.- Number-Theoretic Cryptography.- Public-Key Cryptography. RSA Cryptosystem. Rabin Cryptography. Quadratic Residuosity Cryptography. Discrete Logarithm Cryptography. Elliptic Curve Cryptography. Zero-Knowledge Techniques. Deniable Authentication. Non-Factoring Based Cryptography. Chapter Notes and Further Reading.- Bibliography.- Index.- About the Author.

Read more less

Book Synopsis​This book is a history of complex function theory from its origins to 1914, when the essential features of the modern theory were in place.Trade Review“There is much in this book that will educate, be appreciated by, and no doubt provoke mathematicians as well as historians of mathematics and of science. … It stands its ground as a scholarly treatise that fills many lacunae in the extant historical literature. It will surely provoke further debate and research. As a bonus, it comes filled with treasures for both the specialist and the novice.” (Tushar Das, MAA Reviews, July, 2015)“The book is devoted to the history of complex (analytic) function theory from its origins to 1914. … The book is highly recommended for historians of mathematics, mathematicians with historical interests, and everyone who is interested in complex function theory and its history. It offers a wealth of information that is well documented.” (Karl-Heinz Schlote, Mathematical Reviews, October, 2014)“This comprehensive, massively researched volume … is a detailed historical account of the development of analytic function theory in the 19th century, tracing its rise and ramification through that period up until about 1910. … It is a very dense and scholarly work, suitable for specialists. Summing Up: Recommended. Graduate students, researchers/faculty, and professionals/practitioners.” (D. Robbins, Choice, Vol. 51 (9), May, 2014)“This book is the first one devoted to the history of complex function theory. The authors present the rise of analytic function theory from its origins to 1914. … This book is of great interest and help, not only for mathematicians interested in complex function theory, but also for everyone who likes the history of mathematics.” (Agnieszka Wisniowska-Wajnryb, zbMATH, Vol. 1276, 2014)Table of ContentsList of Figures.- Introduction.- 1. Elliptic Functions.- 2. From real to complex.- 3. Cauch.- 4. Elliptic integrals.- 5. Riemann.- 6. Weierstrass.- 7. Differential equations.- 8. Advanced topics.- 9. Several variables.- 10. Textbooks.

Read more less

Book SynopsisOffers a hands-on transcendental approach to differential Galois theory, based on the Riemann-Hilbert correspondence. Along the way, it provides a smooth, down-to-earth introduction to algebraic geometry, category theory and tannakian duality. A large variety of examples, exercises, and theoretical constructions offers an accessible entry into this exciting area.Trade ReviewJacques Sauloy's book is an introduction to differential Galois theory, an important area of mathematics having different powerful applications (for example, to the classical problem of integrability of dynamical systems in mechanics and physics)...Sauloy offers an alternative approach to the subject which is based on the monodromy representation...Enriching the understanding of differential Galois theory, this point of view also brings new solutions, which makes the book especially valuable...There are a lot of nice exercises, both inside and at the end of each chapter." — Renat R. Gontsov, Mathematical Reviews"The book is an elementary introduction to the differential Galois theory and is intended for undergraduate students of mathematical departments. It is not overloaded with redundant definitions, constructs and results. Everything that is minimally necessary for understanding the whole presentation is given in full. The reader can find the rest [of the] details from a well-designed references system. And at the same time, the book contains quite a lot of carefully selected examples and exercises." — Mykola Grygorenko, Zentralblatt MATH"It's an excellent book about a beautiful and deep subject...There are loads of exercises, and I think the book is very well-paced, as well as very clearly written. It's a fabulous entry in the AMS GSM series." — Michael Berg, MAA ReviewsTable of Contents Part 1. A quick introduction to complex analytic functions: The complex exponential function Power series Analytic functions The complex logarithm From the local to the global Part 2. Complex linear differential equations and their monodromy: Two basic equations and their monodromy Linear complex analytic differential equations A functorial point of view on analytic continuation: Local systems Part 3. The Riemann-Hilbert correspondence: Regular singular points and the local Riemann-Hilbert correspondence Local Riemann-Hilbert correspondence as an equivalence of categories Hypergeometric series and equations The global Riemann-Hilbert correspondence Part 4. Differential Galois theory: Local differential Galois theory The local Schlesinger density theorem The universal (Fuchsian local) Galois group The universal group as proalgebraic hull of the fundamental group Beyond local Fuchsian differential Galois theory Appendix A. Another proof of the surjectivity of $\mathrm{exp}:\mathrm{Mat}_n(\mathbf{C})\rightarrow \mathrm{GL}_n(\mathbf{C})$ Appendix B. Another construction of the logarithm of a matrix Appendix C. Jordan decomposition in a linear algebraic group Appendix D. Tannaka duality without schemes Appendix E. Duality for diagonalizable algebraic groups Appendix F. Revision problems Bibliography Index.

Read more less

Book SynopsisContains the proceedings of the Arizona Winter School 2016, held in March 2016 at The University of Arizona. The School provided a unique opportunity to introduce graduate students to analytic methods in arithmetic geometry.Table of Contents A. C. Cojocaru, Primes, elliptic curves and cyclic groups H. A. Helfgott, Growth and expansion in algebraic groups over finite fields E. Fouvry, E. Kowalski, P. Michel, and W. Sawin, Lectures on applied $\ell$-adic cohomology A. V. Sutherland, Sato-Tate distributions.

Read more less

Book SynopsisPresents original research articles covering a large range of topics, including weight enumerators for codes, function field analogs of the Brauer-Siegel theorem, the computation of cohomological invariants of curves, the trace distributions of algebraic groups, and applications of the computation of zeta functions of curves.Table of Contents J. D. Achter and E. W. Howe, Hasse-Witt and Cartier-Manin matrices: A warning and a request M. Hindry, Analogues of Brauer-Siegel theorem in arithmetic geometry J. Javanpeykar and J. Voight, The Belyi degree of a curve is computable N. Kaplan, Weight enumerators of Reed-Muller codes from cubic curves and their duals G. Lachaud, The distribution of the trace in the compact group of type $G_2$ B. Malmskog, R. Pries, and C. Weir, The de Rham cohomology of the Suzuki curves F. Pazuki, Decompositions en hauteurs locales B. Poonen, Using zeta functions to factor polynomials over finite fields J. Sijsling, Canonical models of arithmetic $(1;\infty)$-curves A. V. Sutherland and J. F. Voloch, Maps between curves and arithmetic obstructions.

Read more less

Book SynopsisContains the proceedings of the conference Dynamics: Topology and Numbers, held in July 2018. The papers cover diverse fields of mathematics with a unifying theme of relation to dynamical systems. These include arithmetic geometry, flat geometry, complex dynamics, graph theory, relations to number theory, and topological dynamics.Table of Contents L. Snoha, The life and mathematics of Sergii Kolyada I. Kolyada, A. Blokh, and L. Snoha, Recollections about Sergii Kolyada P. Moree, Sergiy and the MPIM Y. I. Manin and M. Marcolli, Homotopy types and geometries below ${\rm Spec}(\mathbb{Z})$ A. Fel'shtyn and M. Zietek, Dynamical zeta functions of Riedemeister type and representations spaces O. Jenkinson and M. Pollicott, Rigorous dimension estimates for Cantor sets arising in Zaremba theory P. Colognese and M. Pollicott, Volume growth for infinite graphs and translation surfaces J. Byszewski, G. Cornelissen, M. Houben, and L. Van Der Meijden, Dynamically affine maps in positive characteristic S. Kolyada, M. Misiurewicz, and L. Snoha, Special $\alpha$-limit sets E. Shi and X. Ye, Equicontinuity of minimal sets for amenable group actions on dendrites E. Akin, E. Glasner, and B. Weiss, On weak rigidity and weakly mixing enveloping semigroups A. Ganguly and A. Ghosh, The inhomogenous Sprindzhuk conjecture over a local field of positive characteristic A. Blokh, L. Oversteegen, and V. Timorin, Dynamical generation of parameter laminations P. Oprocha, T. Yu, and Guohua Zhang, Multi-sensitivity, multi-transitivity and $\delta$-transitivity R. Sharp, Convergence of zeta functions for amenable group extensions of shifts S. Bezuglyi and O. Karpel, Invariant measures for Cantor dynamical systems M. Kapovich, Periods of abelian differentials and dynamics J. Riedl and D. Schleicher, Crossed renormalization of quadratic polynomials.

Read more less

Book SynopsisProvides an introduction to number theory at the undergraduate level, emphasizing geometric aspects of the subject. The geometric approach is exploited to explore in depth the classical topic of quadratic forms with integer coefficients, a central topic of the book.Table of Contents A preview The Farey diagram Continued fractions Symmetries of the Farey diagram Quadratic forms Classification of quadratic forms Representations by quadratic forms The class group for quadratic forms Quadratic fields Tables Glossary of nonstandard terminology Bibliography Index

Read more less

Book SynopsisThe polynomials studied in this book take their origin in number theory. The authors show how, by drawing simple pictures, one can prove some long-standing conjectures and formulate new ones. The theory presented here touches upon many different fields of mathematics.Table of Contents Introduction. Dessins d'enfants: From polynomials through Belyi functions to weighted trees. Existence theorem. Recapitulation and perspective. Classification of unitrees. Computation of Davenport-Zannier pairs for unitrees. Primitive monodromy groups of weighted trees. Trees with primitive monodromy groups. A zoo of examples and constructions. Diophantine invariants. Enumeration. What remains to be done. Bibliography. Index.

Read more less

Book SynopsisPresents a dialogue between a professor and eight students in a summer problem solving camp and allows for a conversational approach to the problems as well as some mathematical humour and a few non-mathematical digressions. The problems have been selected for their entertainment value, elegance, trickiness, and unexpectedness.Table of Contents The first day Polynomials Base mathematics A mysterious visitor Set theory Triangles Independence day Independence aftermath Amanda An aesthetical error Miraculous cancellation Probability theory Geometry Hodegepodge Self-referential mathematics All good things must come to an end Bibliography Index.

Read more less

Book SynopsisThe goal of this publication is to explain the theory of ideal class groups, including its algebraic aspect (the Iwasawa class number formula), its analytic aspect (Leopoldt-Kubota $L$-functions), and the Iwasawa main conjecture, which is a bridge between the algebraic and the analytic aspects.Table of Contents Motivation and utility of Iwasawa theory $\mathbb{Z}_p$-extension and Iwasawa algebra Cyclotomic Iwasawa theory for ideal class groups Bookguide Appendix A References Index

Read more less

Book SynopsisPresents multiprecision algorithms used in number theory and elsewhere, such as extrapolation, numerical integration, numerical summation (including multiple zeta values and the Riemann-Siegel formula), evaluation and speed of convergence of continued fractions, Euler products and Euler sums, inverse Mellin transforms, and complex $L$-functions.Table of Contents Introduction Numerical extrapolation Numerical integration Numerical summation Euler products and Euler sums Gauss and Jacobi sums Numerical computation of continued fractions Computation of inverse Mellin transforms Computation of $L$-functions List of relevant GP programs Bibliography Index of programs General index.

Read more less

Book SynopsisProvides a broad introduction to perfectoid spaces. The book will be an invaluable asset for any graduate student or researcher interested in the theory of perfectoid spaces and their applications.Table of Contents J. Weinstein, Arizona Winter School 2017: Adic spaces K. S. Kedlaya, Sheaves, stacks, and shtukas B. Bhatt, The Hodge-Tate decomposition via perfectoid spaces A. Caraiani, Perfectoid Shimura varieties

Read more less

Book SynopsisProvides an introduction to an active area of research that lies at the intersection of number theory, $p$-adic analysis, algebraic geometry, singularity theory, and theoretical physics. The book introduces $p$-adic analysis, the theory of zeta functions, Archimedean, $p$-adic, motivic, singularities of plane curves and their Poincare series.Table of Contents Surveys: E. Leon-Cardenal, Archimedean zeta functions and oscillatory integrals J. J. Moyano-Fernandez, Generalized Poincare series for plane curve singularities N. Potemans and W. Veys, Introduction to $p$-adic Igusa zeta functions J. Viu-Sos, An introduction to $p$-adic and motivic integration, zeta functions and invariants of singularities W. A. Zuniga-Galindo, $p$-adic analysis: A quick introduction Articles: E. Artal Bartolo and M. Gonzalez Villa, On maximal order poles of generalized topological zeta functions J. I. Cogolludo-Agustin, T. Laszlo, J. Martin-Morales, and A. Nemethi, Local invariants of minimal generic curves on rational surfaces J. Nagy and A. Nemethi, Motivic Poincare series of cusp surface singularities C. D. Sinclair, Non-Archimedean electrostatics

Read more less

Book SynopsisOne of the great charms of mathematics is uncovering unexpected connections. In Numbers and Figures, Giancarlo Travaglini provides six conversations that do exactly that by talking about several topics in elementary number theory and some of their connections to geometry, calculus, and real-life problems such as COVID-19 vaccines.Table of Contents Integer points, polygons, and polyhedra Simpson's paradox, Farey sequences, and Diophantine approximation A coin problem and generating functions Pythagorean triples and sums of squares Benford's law, uniform distribution and normal numbers Sums and integrals Index

Read more less

Book SynopsisOffers a concrete introduction to abstract algebra and number theory. Starting from the basics, it develops the rich parallels between the integers and polynomials, covering topics such as Unique Factorization, arithmetic over quadratic number fields, the RSA encryption scheme, and finite fields.Table of Contents The integers Modular arithmetic Diophantine equations and quadratic number domains Codes and factoring Real and complex numbers The ring of polynomials Finite fields Bibliography Index

Read more less

Book SynopsisThe field of weak arithmetics is an application of logical methods to number theory that was developed by mathematicians, philosophers, and theoretical computer scientists. In this volume, after a general presentation of weak arithmetics, the following topics are studied: the properties of integers of a real closed field equipped with exponentiation; conservation results for the induction schema restricted to first-order formulas with a finite number of alternations of quantifiers; a survey on a class of tools called pebble games; the fact that the reals e and pi have approximations expressed by first-order formulas using bounded quantifiers; properties of infinite pictures depending on the universe of sets used; a language that simulates in a sufficiently nice manner all algorithms of a certain restricted class; the logical complexity of the axiom of infinity in some variants of set theory without the axiom of foundation; and the complexity to determine whether a trace is included in another one.

Read more less

Book SynopsisThe field of weak arithmetics is an application of logical methods to number theory that was developed by mathematicians, philosophers, and theoretical computer scientists. New Studies in Weak Arithmetics is dedicated to late Australian mathematician Alan Robert Woods (1953-2011), whose seminal thesis is published here for the first time. This volume also contains the unpublished but significant thesis of Hamid Lesan (1951-2006) as well as other original papers on topics addressed in Woods' thesis and life's work that were first presented at the 31st Journees sur les Arithmetiques Faibles meeting held in Samos, Greece, in 2012.

Read more less

Book SynopsisThe field of weak arithmetics is an application of logical methods to number theory that was developed by mathematicians, philosophers, and theoretical computer scientists. This third volume in the weak arithmetics collection contains nine substantive papers based on lectures delivered during the two last meetings of the conference series Journées sur les Arithmétiques, held in 2014 at the University of Gothenburg, Sweden, and in 2015 at the City University of New York Graduate Center.

Read more less

Book SynopsisNumber patterns are subjected to rigorous analysis within the field of mathematics, with each pattern exhibiting distinct properties and behaviors. Arithmetic progressions, for instance, are characterized by a constant difference between consecutive terms, allowing for the determination of any term in the sequence through a simple formula. Geometric progressions, on the other hand, showcase a consistent multiplicative ratio between consecutive terms. Advanced patterns, such as recursive sequences, demand intricate analyses, as they rely on previously generated terms to derive subsequent elements. Mathematicians employ various techniques, including algebraic manipulation, calculus, and discrete mathematics principles, to discern underlying relationships and formulate general expressions for these patterns. By engaging in systematic explorations of these patterns, mathematicians unveil the intrinsic order and predictability that underscore numerical sequences. The subject of Number Patterns and Sequences: Basics of Mathematical Patterns encompasses a comprehensive exploration of recurring numerical relationships and structures. This area of study delves into the fundamental principles that govern the orderly arrangement of numbers, with an emphasis on unveiling the underlying rules and behaviors that give rise to various patterns. The book provides a systematic introduction to the diverse array of patterns that emerge in mathematics, ranging from straightforward arithmetic and geometric progressions to more intricate recursive sequences. By dissecting these patterns through rigorous mathematical analyses and formulas, this book equips readers with the foundational tools needed to recognize, understand, and predict the evolution of numerical sequences. In essence, this book serves as a gateway for individuals to engage with the fundamental building blocks of mathematics and to develop a deeper appreciation for the elegant symmetries and structures that define the numerical world.

Read more less

Book SynopsisThis textbook offers a rigorous presentation of mathematics before the advent of calculus. Fundamental concepts in algebra, geometry, and number theory are developed from the foundations of set theory along an elementary, inquiry-driven path. Thought-provoking examples and challenging problems inspired by mathematical contests motivate the theory, while frequent historical asides reveal the story of how the ideas were originally developed. Beginning with a thorough treatment of the natural numbers via Peano’s axioms, the opening chapters focus on establishing the natural, integral, rational, and real number systems. Plane geometry is introduced via Birkhoff’s axioms of metric geometry, and chapters on polynomials traverse arithmetical operations, roots, and factoring multivariate expressions. An elementary classification of conics is given, followed by an in-depth study of rational expressions. Exponential, logarithmic, and trigonometric functions complete the picture, driven by inequalities that compare them with polynomial and rational functions. Axioms and limits underpin the treatment throughout, offering not only powerful tools, but insights into non-trivial connections between topics. Elements of Mathematics is ideal for students seeking a deep and engaging mathematical challenge based on elementary tools. Whether enhancing the early undergraduate curriculum for high achievers, or constructing a reflective senior capstone, instructors will find ample material for enquiring mathematics majors. No formal prerequisites are assumed beyond high school algebra, making the book ideal for mathematics circles and competition preparation. Readers who are more advanced in their mathematical studies will appreciate the interleaving of ideas and illuminating historical details.Trade Review“Elements of mathematics is a curious book. The most challenging aspect of this volume to assess is its purpose.” (Jeff Johannes, Mathematical Reviews, October, 2022)“Transparency of explanation and gradually built material are outstanding features of the textbook. In addition, solutions to some problems are designed using more than one approach, making it adaptable to various students' backgrounds. … The book makes itself accessible to a vast population of students. The book can enhance the undergraduate curriculum or serve as a reflective resource for graduate mathematics students.” (Andrzej Sokolowski, MAA Reviews, March 20, 2022)“A historical concern is present throughout, with pieces of information on the history of concepts and theorems.” (Victor V. Pambuccian, zbMATH 1479.00002, 2022)Table of Contents0. Preliminaries: Sets, Relations, Maps.- 1. Natural, Integral and Rational Numbers.- 2. Real Numbers.- 3. Rational and Real Exponentiation.- 4. Limits of Real Functions.- 5. Real Analytic Plane Geometry.- 6. Polynomial Expressions.- 7. Polynomial Functions.- 8. Conics.- 9. Rational and Algebraic Expressions and Functions.- 10. Exponential and Logarithmic Functions.- 11. Trigonometry.- Further Reading.- Index.

Read more less

Book SynopsisThis volume contains articles related to the work of the Simons Collaboration “Arithmetic Geometry, Number Theory, and Computation.” The papers present mathematical results and algorithms necessary for the development of large-scale databases like the L-functions and Modular Forms Database (LMFDB). The authors aim to develop systematic tools for analyzing Diophantine properties of curves, surfaces, and abelian varieties over number fields and finite fields. The articles also explore examples important for future research.Specific topics include● algebraic varieties over finite fields● the Chabauty-Coleman method● modular forms● rational points on curves of small genus● S-unit equations and integral points.Table of Contents A robust implementation for solving the S-unit equation and several application (C. Rasmussen).- Computing classical modular forms for arbitrary congruence subgroups (E. Assaf).- Square root time Coleman integration on superelliptic curves (A. Best).- Computing classical modular forms ( A. Sutherland).- Elliptic curves with good reduction outside of the first six primes (B. Matschke).- Efficient computation of BSD invariants in genus 2 (R. van Bommel).- Restrictions on Weil polynomials of Jacobians of hyperelliptic curves (E. Costa).- Zen and the art of database maintenance (D. Roe).- Effective obstructions to lifting Tate classes from positive characteristic (E. Costa).- Conjecture: 100% of elliptic surfaces over Q have rank zero (A. Cowan).- On rational Bianchi newforms and abelian surfaces with quaternionic multiplication (J. Voight).- A database of Hilbert modular forms (J. Voight).- Isogeny classes of Abelian Varieties over Finite Fields in the LMFDB (D. Roe).- Computing rational points on genus 3 hyperelliptic curves (S. Hashimoto).- Curves with sharp Chabauty-Coleman bound (S. Gajović).- Chabauty-Coleman computations on rank 1 Picard curves (S. Hashimoto).- Linear dependence among Hecke eigenvalues (D. Kim).- Congruent number triangles with the same hypotenuse (D. Lowry-Duda).- Visualizing modular forms (D. Lowry-Duda).- A Prym variety with everywhere good reduction over Q(√ 61) ( J. Voight).- The S-integral points on the projective line minus three points via étale covers and Skolem's method (B. Poonen).

Read more less

Book SynopsisThis proceedings volume gathers together original articles and survey works that originate from presentations given at the conference Transient Transcendence in Transylvania, held in Brașov, Romania, from May 13th to 17th, 2019. The conference gathered international experts from various fields of mathematics and computer science, with diverse interests and viewpoints on transcendence. The covered topics are related to algebraic and transcendental aspects of special functions and special numbers arising in algebra, combinatorics, geometry and number theory. Besides contributions on key topics from invited speakers, this volume also brings selected papers from attendees.Table of ContentsFrobenius action on a hypergeometric curve and an algorithm for computing values of Dwork’s p-adic hypergeometric functions (Asakura).- A Matrix version of Dwork’s Congruences (Beukers).- On the kernel curves associated with walks in the quarter plane (Singer).- A survey on the hypertranscendence of the solutions of the Schröder's, Böttcher's and Abel's equations (Fernandes).- Hodge structures and differential operators (Vlasenko).- Beck-type identities for Euler pairs of order (Welch et al.).- Quarter-plane lattice paths with interacting boundaries: the Kreweras and reverse Kreweras models (Xu et al.).- Infinite product formulae for generating functions for sequences of squares (Radu et al.).- A theta identity of Gauss connecting functions from additive and multiplicative number theory (Merca).- Combinatorial quantum field theory and the Jacobian conjecture (Tanasa).- How regular are regular singularities? (Hauser).- Néron desingularization of extensions of valuation rings with an appendix by kęstutis česnavičius (Popescu).- Diagonal Representation of Algebraic Power Series: A Glimpse Behind the Scenes (Yurkevich).- Proof of chudnovskys’ hypergeometric series for 1/π using weber modular polynomials (Guillera).-Computing an order-complete basis for m∞(n) and applications (Radu et al.).- An algorithm to prove holonomic differential equations for modular forms (Radu et al.).- A case study for ζ(4) (zudilin et al.).- Support of an algebraic series as the range of a recursive sequence (bell).- X-coordinates of pell equations in various sequences (luca).- A conditional proof of the leopoldt conjecture for cm fields (mihailescu).- Siegel’s problem for e-functions of order 2 (Roques et al.).- Irrationality and Transcendence of Alternating Series Via Continued Fractions (Snowdow).- On the transcendence of critical hecke l-values (sprang).

Read more less

Book SynopsisThis 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.Trade Review“The reorganization of the topics is fine surgical work. Several portions of the original monograph are sewn in a natural way in the new book, adding examples or additional text when necessary, and re-arranging the focus to make it a more friendly introduction to the subject. Careful attention to details and the required background makes the book under review accessible to an interested reader and could be a used as textbook for a course on abelian varieties.” (Felipe Zaldivar, MAA Reviews, June 18, 2023)Table of Contents1. Line Bundles on Complex Tori.- 2 Abelian Varieties.- 3 Moduli Spaces.- 4 Jacobian Varieties.- 5 Main Examples of Abelian Varieties.- 6 The Fourier Transform for Sheaves and Cycles.- 7 Introduction to the Hodge Conjecture for Abelian Varieties.

Read more less

Book SynopsisThis book is a self-contained treatment for those who study or work on the computational aspects of classical modular forms. The author describes the theory of modular forms and its applications in number theoretic problems such as representations by quadratic forms and the determination of asymptotic formulas for Fourier coefficients of different types of special functions. A detailed account of recent applications of modular forms in number theory with a focus on using computer algorithms is provided. Computer algorithms are included for each presented application to help readers put the theory in context and make new conjectures. Table of ContentsDirichlet Characters.- Modular Forms: Definition and Some Properties.- Application: Quadratic Forms.- Application: Eta Quotients.- Various Applications.

Read more less