DOCSLIB.ORG

Zeta and L-Functions in Number Theory and Combinatorics

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Zeta and L-Functions in Number Theory and Combinatorics Conference Board of the Mathematical Sciences CBMS Regional Conference Series in Mathematics Number 129 Zeta and L-functions in Number Theory and Combinatorics Wen-Ching Winnie Li with support from the 10.1090/cbms/129 Conference Board of the Mathematical Sciences CBMS Regional Conference Series in Mathematics Number 129 Zeta and L-functions in Number Theory and Combinatorics Wen-Ching Winnie Li Published for the Conference Board of the Mathematical Sciences by the with support from the NSF-CBMS Regional Conference in the Mathematical Sciences on Combinatorial Zeta and L-functions held at the Sundance Resort, Utah, May 12–16, 2014 Partially supported by the National Science Foundation. The author acknowledges support from the Conference Board of the Mathematical Sciences and NSF grant #DMS-1341413. Any opinions, findings, and conclusions or recommenda- tions expressed in this material are those of the author and do not necessarily reflect the views of the National Science Foundation. 2010 Mathematics Subject Classification. Primary 11M26, 05E45, 11M36, 11F41, 11Z05, 11F66. For additional information and updates on this book, visit www.ams.org/bookpages/cbms-129 Library of Congress Cataloging-in-Publication Data Names: Li, W. C. Winnie (Wen-Ching Winnie), author. | Conference Board of the Mathematical Sciences. | National Science Foundation (U.S.) Title: Zeta and L-functions in number theory and combinatorics / Wen-Ching Winnie Li. Description: Providence, Rhode Island : Published for the Conference Board of the Mathematical Sciences by the American Mathematical Society, [2019] | Series: CBMS regional conference series in mathematics ; number 129 | “Support from the National Science Foundation.” | Includes bibliographical references and index. Identifiers: LCCN 2018048915 | ISBN 9781470449001 (alk. paper) Subjects: LCSH: Functions, Zeta. | L-functions. | Number theory. | Combinatorial number theory. Classification: LCC QA403 .J67 2018 | DDC 515/.2433–dc23 LC record available at https://lccn.loc.gov/2018048915 Copying and reprinting. Individual readers of this publication, and nonprofit libraries acting for them, are permitted to make fair use of the material, such as to copy select pages for use in teaching or research. Permission is granted to quote brief passages from this publication in reviews, provided the customary acknowledgment of the source is given. Republication, systematic copying, or multiple reproduction of any material in this publication is permitted only under license from the American Mathematical Society. Requests for permission to reuse portions of AMS publication content are handled by the Copyright Clearance Center. For more information, please visit www.ams.org/publications/pubpermissions. Send requests for translation rights and licensed reprints to [email protected]. c 2019 by the American Mathematical Society. All rights reserved. The American Mathematical Society retains all rights except those granted to the United States Government. Printed in the United States of America. ∞ The paper used in this book is acid-free and falls within the guidelines established to ensure permanence and durability. Visit the AMS home page at https://www.ams.org/ 10987654321 242322212019 Contents Preface v Lecture 1. Number theoretic zeta and L-functions 1 1.1. The Riemann zeta function 1 1.2. The Dirichlet L-functions 2 1.3. Finite extensions of Q 3 1.4. The Artin L-functions 7 1.5. Zeta functions for varieties over finite fields 9 Lecture 2. The Selberg zeta function 15 2.1. The action of SL2(R)15 2.2. Classification of elements in SL2(R)15 2.3. Compact Riemann surfaces arising as quotients of H 17 2.4. Geodesic cycles in XΓ 18 2.5. The Selberg zeta function attached to XΓ 21 2.6. Properties of the Laplacian operator 24 Lecture 3. L-functions in geometry 27 3.1. General setup 27 3.2. Anosov flow 29 3.3. L-functions and distributions of prime geodesics 31 Lecture 4. The Ihara zeta function 35 4.1. The Ihara zeta function 35 4.2. Ihara’s theorem 37 4.3. Hashimoto’s theorem 38 4.4. A cohomological proof of the zeta identity for a graph 39 Lecture 5. Spectral graph theory 43 5.1. Eigenvalues of a regular graph 43 5.2. The behavior of nontrivial eigenvalues 43 5.3. Ramanujan graphs and the Riemann hypothesis 45 5.4. Friedman’s theorem 46 Lecture 6. Explicit constructions of Ramanujan graphs 47 6.1. Expanding constant and spectral gap 47 6.2. Some nice features of Ramanujan graphs 48 6.3. Cayley graphs 49 6.4. PGL2(Qp)/P GL2(Zp)asa(p + 1)-regular tree 50 6.5. Ramanujan graphs as finite quotients of PGL2(Qp)51 iii iv CONTENTS 6.6. Hashimoto’s class number formula 53 6.7. Biregular bipartite Ramanujan graphs 56 Lecture 7. Artin L-functions and prime distributions for graphs 61 7.1. Artin L-functions for graphs 61 7.2. Unramified covers of X 62 7.3. Distribution of primes for graphs 64 7.4. A characterization for finite unramified Galois covers 68 Lecture 8. Zeta and L-functions of complexes 69 8.1. The building attached to PGLn(F )69 8.2. Spectral theory of regular complexes from Bn(F )70 8.3. Ramanujan complexes as finite quotients of Bn(F )70 8.4. Zeta and L-functions of finite quotients of B3(F )74 8.5. Zeta functions of finite quotients of the building Δ(F )ofSp4(F )80 8.6. Distribution of primes in finite quotients of B3(F )andΔ(F )83 Bibliography 87 Index 93 Preface The zeta and L-functions play a central role in number theory. They provide important information of arithmetic nature. For example, the analytic behavior of the Riemann zeta function ζ(s) on the closed right half-plane (s) ≥ 1 leads to the estimate of the number of prime numbers up to x by the logarithmic integral Li(x), and the error of this estimate is controlled by the location of the zeros of ζ(s)inthe critical strip 0 < (s) < 1. The celebrated Riemann Hypothesis asserts that these zeros should all lie on the line of symmetry (s)=1/2. Under this assumption one can bound the error by O(x1/2 log x). This is the Prime Number Theorem. Fur- thermore, given a finite Galois extension of Q with Galois group G, we can partition the prime numbers according to their associated Frobenius conjugacy classes in G. For a conjugacy class C of G,denotebySC the collection of prime numbers whose associated Frobenius conjugacy classes equal C. The distribution of prime num- bers in SC is described by the Chebotarev Density Theorem, which says that SC has natural density |C|/|G|. In particular, the prime numbers are equidistributed among the sets SC when the Galois group G is abelian. Specialized to cyclotomic extensions of Q, this is Dirichlet’s Theorem on primes in arithmetic progressions. The Chebotarev Density Theorem follows from the holomorphy and nonvanishing of the Artin L-functions attached to nontrivial irreducible representations of G on the half-plane (s) ≥ 1. On the geometric side, to a d-dimensional projective smooth irreducible variety V defined over a finite field Fq, Artin and Smith attached the zeta function Z(V,u), which counts points on V with coordinates in finite extensions of Fq.Asshownby Grothendieck, Z(V,u) is an alternating product of polynomials Pi(u), 0 ≤ i ≤ 2d, arising geometrically; and Deligne proved the Riemann Hypothesis as conjectured −i/2 by Weil; that is, the zeros of a nonconstant Pi(u) have absolute value q . Like the Riemann zeta function, Z(V,u) has an Euler product over closed points, which play the role of primes of V .WhenV is a curve, the analytic behavior of Z(V,u) and similarly defined Artin L-functions give rise to analogues of the Prime Number Theorem and the Chebotarev Density Theorem. These remarkable achievements in number theory are reviewed in Lecture 1. The purpose of this monograph is to provide a systematic and comprehensive ac- count of the developments of these topics in geometry and combinatorics for grad- uate students and researchers. We shall highlight interactions between number theory and other fields and compare similarities and dissimilarities under different settings. This is done in chronological order. Lecture 2 introduces the first instance, considered by Selberg in the 1950s, on compact Riemann surfaces arising as quo- tients of the upper half-plane H by discrete torsion-free cocompact subgroups Γ of SL2(R). In this setting the primes of Γ\H are primitive closed geodesic cycles not v vi PREFACE counting the starting points, and the fundamental group Γ plays the role of abso- lute Galois group. Selberg introduced zeta functions attached to finite-dimensional representations of Γ as suitable products over such primes. These functions have nice analytic properties like ζ(s), and they satisfy the Riemann Hypothesis for all except possibly finitely many real zeros in the critical strip. The Prime Geodesic Theorem and the Chebotarev Density Theorem for Γ\H are established by Huber and Sarnak. Lecture 3 is a digression to finite-dimensional compact Riemannian manifolds and the connection to dynamical systems. We shall see that the distribution of primes is related to the analytic behavior of the associated L-functions of Artin type, which are variations of the Ruelle zeta function in dynamical systems. While this is a much explored topic in dynamical systems, our exposition will stay close to the theme of this monograph. The remainder of this monograph is devoted to the combinatorial setting. In the 1960s, by interpreting the upper half-plane H as the homogeneous space PGL2(R)/P O2(R), Ihara extended Selberg’s results from the real field R to a nonar- chimedean local field F with q elements in its residue field.
Load more

Recommended publications
  • 500 Natural Sciences and Mathematics
    500 500 Natural sciences and mathematics Natural sciences: sciences that deal with matter and energy, or with objects and processes observable in nature Class here interdisciplinary works on natural and applied sciences Class natural history in 508. Class scientific principles of a subject with the subject, plus notation 01 from Table 1, e.g., scientific principles of photography 770.1 For government policy on science, see 338.9; for applied sciences, see 600 See Manual at 231.7 vs. 213, 500, 576.8; also at 338.9 vs. 352.7, 500; also at 500 vs. 001 SUMMARY 500.2–.8 [Physical sciences, space sciences, groups of people] 501–509 Standard subdivisions and natural history 510 Mathematics 520 Astronomy and allied sciences 530 Physics 540 Chemistry and allied sciences 550 Earth sciences 560 Paleontology 570 Biology 580 Plants 590 Animals .2 Physical sciences For astronomy and allied sciences, see 520; for physics, see 530; for chemistry and allied sciences, see 540; for earth sciences, see 550 .5 Space sciences For astronomy, see 520; for earth sciences in other worlds, see 550. For space sciences aspects of a specific subject, see the subject, plus notation 091 from Table 1, e.g., chemical reactions in space 541.390919 See Manual at 520 vs. 500.5, 523.1, 530.1, 919.9 .8 Groups of people Add to base number 500.8 the numbers following —08 in notation 081–089 from Table 1, e.g., women in science 500.82 501 Philosophy and theory Class scientific method as a general research technique in 001.4; class scientific method applied in the natural sciences in 507.2 502 Miscellany 577 502 Dewey Decimal Classification 502 .8 Auxiliary techniques and procedures; apparatus, equipment, materials Including microscopy; microscopes; interdisciplinary works on microscopy Class stereology with compound microscopes, stereology with electron microscopes in 502; class interdisciplinary works on photomicrography in 778.3 For manufacture of microscopes, see 681.
    [Show full text]
  • Number Theory
    Number Theory Syllabus for the TEMPUS-SEE PhD Course Muharem Avdispahić1 Department of Mathematics, University of Sarajevo Stefan Dodunekov2 Institute of Mathematics and Informatics Bulgarian Academy of Sciences Wolfgang A. Schmid3 University of Graz/Ecole Polytechnique Paris Course goals Number theory has always exhibited a unique feature that some appealing and easily stated problems tend to resist the attempts for solution over very long periods of time. It has influenced and has been influenced by developments in many mathematical disciplines. Several breaktroughs that took place during last decades on one hand and unprecented range of applications on the other, have significantly enlarged the interested mathematical community. The course is designed to provide insights into some areas of modern research in analytic, algebraic and computational/algorithmic number theory. The extent of exposure to advanced themes will depend on the mathematical background of paricipants. Prerequisites Prerequisites vary from one part of the course to another and range from elementary number theory, complex analysis, some Fourier analysis, standard course in algebra (basics of finite group theory commutative rings, ideals, basic Galois theory of fields), to data structures and programming skills. Course modules (20 units each) I. Analytic Number Theory Lecturer: Prof. Dr. Muharem Avdispahić, University of Sarajevo II. Algebraic Number Theory Lecturer: Asso. Prof. Dr. Ivan Chipchakov, IMI, Bulgarian Academy of Sciences III. Computational Number Theory
    [Show full text]
  • Math 788M: Computational Number Theory (Instructor’S Notes)
    Math 788M: Computational Number Theory (Instructor’s Notes) The Very Beginning: • A positive integer n can be written in n steps. • The role of numerals (now O(log n) steps) • Can we do better? (Example: The largest known prime contains 258716 digits and doesn’t take long to write down. It’s 2859433 − 1.) Running Time of Algorithms: • A positive integer n in base b contains [logb n] + 1 digits. • Big-Oh & Little-Oh Notation (as well as , , ∼, ) Examples 1: log (1 + (1/n)) = O(1/n) Examples 2: [logb n] + 1 log n Examples 3: 1 + 2 + ··· + n n2 These notes are for a course taught by Michael Filaseta in the Spring of 1996 and being updated for Fall of 2007. Computational Number Theory Notes 2 Examples 4: f a polynomial of degree k =⇒ f(n) = O(nk) Examples 5: (r + 1)π ∼ rπ • We will want algorithms to run quickly (in a small number of steps) in comparison to the length of the input. For example, we may ask, “How quickly can we factor a positive integer n?” One considers the length of the input n to be of order log n (corresponding to the number of binary digits n has). An algorithm runs in polynomial time if the number of steps it takes is bounded above by a polynomial in the length of the input. An algorithm to factor n in polynomial time would require that it take O (log n)k steps (and that it factor n). Addition and Subtraction (of n and m): • We are taught how to do binary addition and subtraction in O(log n + log m) steps.
    [Show full text]
  • Number Theory
    “mcs-ftl” — 2010/9/8 — 0:40 — page 81 — #87 4 Number Theory Number theory is the study of the integers. Why anyone would want to study the integers is not immediately obvious. First of all, what’s to know? There’s 0, there’s 1, 2, 3, and so on, and, oh yeah, -1, -2, . Which one don’t you understand? Sec- ond, what practical value is there in it? The mathematician G. H. Hardy expressed pleasure in its impracticality when he wrote: [Number theorists] may be justified in rejoicing that there is one sci- ence, at any rate, and that their own, whose very remoteness from or- dinary human activities should keep it gentle and clean. Hardy was specially concerned that number theory not be used in warfare; he was a pacifist. You may applaud his sentiments, but he got it wrong: Number Theory underlies modern cryptography, which is what makes secure online communication possible. Secure communication is of course crucial in war—which may leave poor Hardy spinning in his grave. It’s also central to online commerce. Every time you buy a book from Amazon, check your grades on WebSIS, or use a PayPal account, you are relying on number theoretic algorithms. Number theory also provides an excellent environment for us to practice and apply the proof techniques that we developed in Chapters 2 and 3. Since we’ll be focusing on properties of the integers, we’ll adopt the default convention in this chapter that variables range over the set of integers, Z. 4.1 Divisibility The nature of number theory emerges as soon as we consider the divides relation a divides b iff ak b for some k: D The notation, a b, is an abbreviation for “a divides b.” If a b, then we also j j say that b is a multiple of a.
    [Show full text]
  • A Taste of Set Theory for Philosophers
    Journal of the Indian Council of Philosophical Research, Vol. XXVII, No. 2. A Special Issue on "Logic and Philosophy Today", 143-163, 2010. Reprinted in "Logic and Philosophy Today" (edited by A. Gupta ans J.v.Benthem), College Publications vol 29, 141-162, 2011. A taste of set theory for philosophers Jouko Va¨an¨ anen¨ ∗ Department of Mathematics and Statistics University of Helsinki and Institute for Logic, Language and Computation University of Amsterdam November 17, 2010 Contents 1 Introduction 1 2 Elementary set theory 2 3 Cardinal and ordinal numbers 3 3.1 Equipollence . 4 3.2 Countable sets . 6 3.3 Ordinals . 7 3.4 Cardinals . 8 4 Axiomatic set theory 9 5 Axiom of Choice 12 6 Independence results 13 7 Some recent work 14 7.1 Descriptive Set Theory . 14 7.2 Non well-founded set theory . 14 7.3 Constructive set theory . 15 8 Historical Remarks and Further Reading 15 ∗Research partially supported by grant 40734 of the Academy of Finland and by the EUROCORES LogICCC LINT programme. I Journal of the Indian Council of Philosophical Research, Vol. XXVII, No. 2. A Special Issue on "Logic and Philosophy Today", 143-163, 2010. Reprinted in "Logic and Philosophy Today" (edited by A. Gupta ans J.v.Benthem), College Publications vol 29, 141-162, 2011. 1 Introduction Originally set theory was a theory of infinity, an attempt to understand infinity in ex- act terms. Later it became a universal language for mathematics and an attempt to give a foundation for all of mathematics, and thereby to all sciences that are based on mathematics.
    [Show full text]
  • Complexity Theory
    Complexity Theory Course Notes Sebastiaan A. Terwijn Radboud University Nijmegen Department of Mathematics P.O. Box 9010 6500 GL Nijmegen the Netherlands [email protected] Copyright c 2010 by Sebastiaan A. Terwijn Version: December 2017 ii Contents 1 Introduction 1 1.1 Complexity theory . .1 1.2 Preliminaries . .1 1.3 Turing machines . .2 1.4 Big O and small o .........................3 1.5 Logic . .3 1.6 Number theory . .4 1.7 Exercises . .5 2 Basics 6 2.1 Time and space bounds . .6 2.2 Inclusions between classes . .7 2.3 Hierarchy theorems . .8 2.4 Central complexity classes . 10 2.5 Problems from logic, algebra, and graph theory . 11 2.6 The Immerman-Szelepcs´enyi Theorem . 12 2.7 Exercises . 14 3 Reductions and completeness 16 3.1 Many-one reductions . 16 3.2 NP-complete problems . 18 3.3 More decision problems from logic . 19 3.4 Completeness of Hamilton path and TSP . 22 3.5 Exercises . 24 4 Relativized computation and the polynomial hierarchy 27 4.1 Relativized computation . 27 4.2 The Polynomial Hierarchy . 28 4.3 Relativization . 31 4.4 Exercises . 32 iii 5 Diagonalization 34 5.1 The Halting Problem . 34 5.2 Intermediate sets . 34 5.3 Oracle separations . 36 5.4 Many-one versus Turing reductions . 38 5.5 Sparse sets . 38 5.6 The Gap Theorem . 40 5.7 The Speed-Up Theorem . 41 5.8 Exercises . 43 6 Randomized computation 45 6.1 Probabilistic classes . 45 6.2 More about BPP . 48 6.3 The classes RP and ZPP .
    [Show full text]
  • Representation Theory* Its Rise and Its Role in Number Theory
    Representation Theory* Its Rise and Its Role in Number Theory Introduction By representation theory we understand the representation of a group by linear transformations of a vector space. Initially, the group is finite, as in the researches of Dedekind and Frobenius, two of the founders of the subject, or a compact Lie group, as in the theory of invariants and the researches of Hurwitz and Schur, and the vector space finite-dimensional, so that the group is being represented as a group of matrices. Under the combined influences of relativity theory and quantum mechanics, in the context of relativistic field theories in the nineteen-thirties, the Lie group ceased to be compact and the space to be finite-dimensional, and the study of infinite-dimensional representations of Lie groups began. It never became, so far as I can judge, of any importance to physics, but it was continued by mathematicians, with strictly mathematical, even somewhat narrow, goals, and led, largely in the hands of Harish-Chandra, to a profound and unexpectedly elegant theory that, we now appreciate, suggests solutions to classical problems in domains, especially the theory of numbers, far removed from the concerns of Dirac and Wigner, in whose papers the notion first appears. Physicists continue to offer mathematicians new notions, even within representation theory, the Virasoro algebra and its representations being one of the most recent, that may be as fecund. Predictions are out of place, but it is well to remind ourselves that the representation theory of noncompact Lie groups revealed its force and its true lines only after an enormous effort, over two decades and by one of the very best mathematical minds of our time, to establish rigorously and in general the elements of what appeared to be a somewhat peripheral subject.
    [Show full text]
  • Interactions of Computational Complexity Theory and Mathematics
    Interactions of Computational Complexity Theory and Mathematics Avi Wigderson October 22, 2017 Abstract [This paper is a (self contained) chapter in a new book on computational complexity theory, called Mathematics and Computation, whose draft is available at https://www.math.ias.edu/avi/book]. We survey some concrete interaction areas between computational complexity theory and different fields of mathematics. We hope to demonstrate here that hardly any area of modern mathematics is untouched by the computational connection (which in some cases is completely natural and in others may seem quite surprising). In my view, the breadth, depth, beauty and novelty of these connections is inspiring, and speaks to a great potential of future interactions (which indeed, are quickly expanding). We aim for variety. We give short, simple descriptions (without proofs or much technical detail) of ideas, motivations, results and connections; this will hopefully entice the reader to dig deeper. Each vignette focuses only on a single topic within a large mathematical filed. We cover the following: • Number Theory: Primality testing • Combinatorial Geometry: Point-line incidences • Operator Theory: The Kadison-Singer problem • Metric Geometry: Distortion of embeddings • Group Theory: Generation and random generation • Statistical Physics: Monte-Carlo Markov chains • Analysis and Probability: Noise stability • Lattice Theory: Short vectors • Invariant Theory: Actions on matrix tuples 1 1 introduction The Theory of Computation (ToC) lays out the mathematical foundations of computer science. I am often asked if ToC is a branch of Mathematics, or of Computer Science. The answer is easy: it is clearly both (and in fact, much more). Ever since Turing's 1936 definition of the Turing machine, we have had a formal mathematical model of computation that enables the rigorous mathematical study of computational tasks, algorithms to solve them, and the resources these require.
    [Show full text]
  • On Bell's Arithmetic of Boolean Algebra*
    ON BELL'S ARITHMETIC OF BOOLEAN ALGEBRA* BY WALLIE ABRAHAM HURWITZ 1. Introduction. Bellf has constructed an arithmetic for an algebra of logic or (following the terminology of Shefferî) a Boolean algebra, which presents gratifying analogies to the arithmetics of rational and other fields. In only one detail is the similarity less close than seems appropriate to the difference in the structures of the algebras themselves—namely, in the properties of the concept congruence. In this note I shall show that a slightly more general definition retains all the properties of the congruence given by Bell and restores several analogies to rational arithmetic lost by the Bell definition. All the notation and terminology of the paper of Bell (to which reference should be made for results not here repeated) other than those relating to congruence are followed in the present treatment. In particular, we utilize the two (dual) interpretations of arithmetic operations and relations in ?: Name Symbol Interpretation I Interpretation II (s) Arithmetic sum: asß: a+ß, aß; (p) Arithmetic product: apß: aß, ct+ß; (g) G. CD.: agß: a+ß, aß; (l) L. C. M.: alß: aß, a+ß; (f) Arithmetic zero: f: <o, e; (v) Arithmetic unity: v. t, «; (d) a divides/3: adß: a\ß, ß\a. 2. Residuals. It will be convenient to amplify slightly Bell's treatment of residuals. By the residual of b with respect to a in Si, bra, is meant the quotient of a by the G. C. D. of a and b. Transforming this into a form equivalent for 21and suitable, by the non-appearance of the concept quotient, for analogy in ?, Bell uses for 2 substantially the following: ßra is the G.
    [Show full text]
  • The Linbox Project for Linear Algebra Computation a Practical Tutorial
    The LinBox Project for Linear Algebra Computation A Practical Tutorial Daniel S. Roche Symbolic Computation Group School of Computer Science University of Waterloo MOCAA 2008 University of Western Ontario 8 May 2008 Dan Roche (U. Waterloo) LinBox Tutorial MOCAA2008 1/30 Goals for Today I want to convince you that LinBox is. the tool for exact linear algebra easy to install and use (if you want it to be) worth getting involved with Dan Roche (U. Waterloo) LinBox Tutorial MOCAA2008 2/30 1 Foundations History Major Contributors Mathematical Background 2 Design Middleware Heirarchy Genericity 3 Practicalities Levels of Use Details 4 Conclusions Dan Roche (U. Waterloo) LinBox Tutorial MOCAA2008 3/30 Foundations History Significant Publications 1986 Wiedemann: Solving sparse linear equations over finite fields 1991 Kaltofen & Saunders: On Wiedemann’s Algorithm 1993 Coppersmith: Block Lanczos, Block Wiedemann 1995 Montgomery: Implementation of Block Lanczos 1997 Villard: Analysis of Block Wiedemann 2001 Giesbrecht; Dumas, Saunders, & Villard: Smith forms 2001 Chen, Eberly, Kaltofen, Saunders, Turner, Villard: Efficient Matrix Preconditioners for Black Box Linear Algebra 2002 Dumas, Gautier, Giesbrecht, Giorgi, Hovinen, Kaltofen, Saunders, Turner, Villard: Linbox: A Generic Library For Exact Linear Algebra 2002 Dumas, Gautier, Pernet: FFLAS: Finite Field Linear Algebra Subroutines Dan Roche (U. Waterloo) LinBox Tutorial MOCAA2008 4/30 Foundations History LinBox Milestones 2000 Initial design meetings 2002 World Scientific paper 2004 BLAS is thoroughly integrated 2005 LinBox 1.0 Released JGD gives tutorial at ISSAC in Beijing LinBox included in open-source computer algebra CD 2006 Maple interface and web computation server 2007 SAGE integration 2008 Linbox 1.5 Dan Roche (U.
    [Show full text]
  • The Selberg Trace Formula & Prime Orbit Theorem
    The Selberg Trace Formula & Prime Orbit Theorem Yihan Yuan May 2019 A thesis submitted for the degree of Honours of the Australian National University Declaration The work in this thesis is my own except where otherwise stated. Yihan Yuan Acknowledgements I would like to express my gratitude to my supervisor, Prof.Andrew Hassell, for his dedication to my honours project. Without his inspiring and patient guid- ance, non of this could have be accomplished. I would like also to thank my colleague Kelly Maggs, for his help and encour- agement, so I can work with confidence and delight, even in hard times. Furthermore, I would like to thank my colleague Dean Muir and Diclehan Erdal, for their precious advice about writing styles for this thesis. Finally, I would like to thank my families for their warming support to my study, despite their holding a suspicious attitude about whether I can find a job after graduating as a mathematician. v Abstract The purpose of this thesis is to study the asymptotic property of the primitive length spectrum on compact hyperbolic surface S of genus at least 2, defined as a set with multiplicities: LS = fl(γ): γ is a primitive oriented closed geodesic on Sg: where l(γ) denotes the length of γ. In particular, we will prove the Prime Orbit Theorem. That is, for the counting function of exponential of primitive lengths, defined as l π0(x) = #fl : l 2 LS and e ≤ xg; we have the asymptotic behavior of π0(x): x π (x) ∼ : 0 ln(x) The major tool we will use is the Selberg trace formula, which states the trace of a certain compact self-adjoint operator on L2(S) can be expressed as a sum over conjugacy classes in hyperbolic Fuchsian groups.
    [Show full text]
  • Cryptology and Computational Number Theory (Boulder, Colorado, August 1989) 41 R
    http://dx.doi.org/10.1090/psapm/042 Other Titles in This Series 50 Robert Calderbank, editor, Different aspects of coding theory (San Francisco, California, January 1995) 49 Robert L. Devaney, editor, Complex dynamical systems: The mathematics behind the Mandlebrot and Julia sets (Cincinnati, Ohio, January 1994) 48 Walter Gautschi, editor, Mathematics of Computation 1943-1993: A half century of computational mathematics (Vancouver, British Columbia, August 1993) 47 Ingrid Daubechies, editor, Different perspectives on wavelets (San Antonio, Texas, January 1993) 46 Stefan A. Burr, editor, The unreasonable effectiveness of number theory (Orono, Maine, August 1991) 45 De Witt L. Sumners, editor, New scientific applications of geometry and topology (Baltimore, Maryland, January 1992) 44 Bela Bollobas, editor, Probabilistic combinatorics and its applications (San Francisco, California, January 1991) 43 Richard K. Guy, editor, Combinatorial games (Columbus, Ohio, August 1990) 42 C. Pomerance, editor, Cryptology and computational number theory (Boulder, Colorado, August 1989) 41 R. W. Brockett, editor, Robotics (Louisville, Kentucky, January 1990) 40 Charles R. Johnson, editor, Matrix theory and applications (Phoenix, Arizona, January 1989) 39 Robert L. Devaney and Linda Keen, editors, Chaos and fractals: The mathematics behind the computer graphics (Providence, Rhode Island, August 1988) 38 Juris Hartmanis, editor, Computational complexity theory (Atlanta, Georgia, January 1988) 37 Henry J. Landau, editor, Moments in mathematics (San Antonio, Texas, January 1987) 36 Carl de Boor, editor, Approximation theory (New Orleans, Louisiana, January 1986) 35 Harry H. Panjer, editor, Actuarial mathematics (Laramie, Wyoming, August 1985) 34 Michael Anshel and William Gewirtz, editors, Mathematics of information processing (Louisville, Kentucky, January 1984) 33 H. Peyton Young, editor, Fair allocation (Anaheim, California, January 1985) 32 R.
    [Show full text]