Advertisement

Zeta Types and Tannakian Symbols as a Method for Representing Mathematical Knowledge

Conference paper
  • 663 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10383)

Abstract

We present two closely related notions called (1) a zeta type and (2) a Tannakian symbol. These are data types for representing information about number-theoretic objects, and we argue that a database built out of zeta types and Tannakian symbols could lead to interesting discoveries, similar to what has been achieved for example by the OEIS, the LMFDB, and other existing databases of mathematical objects. We give several examples illustrating what database records would look like, and we describe a tiny prototype database which has already been used to find and automatically prove new theorems about multiplicative functions.

Keywords

Number theory Multiplicative functions Tannakian symbols Zeta types Zeta functions L-functions Automated conjecture-making Automated theorem proving 

Notes

Acknowledgements

Aspects of this work has been presented in various talks, including at CICM 2016, at AITP 2017 (Conference on Artificial Intelligence and Theorem Proving), at the Representation Theory 2016 Conference in Uppsala, and at seminars in Stockholm and in Leicester. We would like to acknowledge the encouragement and many helpful comments received on these occasions, and in particular we thank Michael Kohlhase, Volodymyr Mazorchuk, Frank Neumann, Florian Rabe, Andreas Strömbergsson, and Josef Urban.

(Slides from some of these talks are available on the first author’s webpage; andreasholmstrom.org. Together with the other documents mentioned, they may serve as a complement to this paper.)

Finally, we also want to thank Magnus Hellebust Haaland and Olav Hellebust Haaland for implementing the Berlekamp-Massey algorithm for us in Sage; many of the automated procedures for computing with Tannakian symbols rely on this implementation.

References

  1. 1.
    Brown, F., Schnetz, O.: Modular forms in quantum field theory. Commun. Number Theor. Phys. 7(2), 293–325 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Costa, E., Tschinkel, Y.: Variation of Neron-Severi ranks of reductions of K3 surfaces. Exp. Math. 23, 475–481 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Encyclopedia of Mathematics: Berlekamp-Massey algorithm. https://www.encyclopediaofmath.org/index.php/Berlekamp-Massey_algorithm
  4. 4.
    Encyclopedia of Mathematics: Dirichlet convolution. https://www.encyclopediaofmath.org/index.php/Dirichlet_convolution
  5. 5.
    Espeseth, A., Holmstrom, A., Vik, T.: New perspectives on multiplicative functions: Lambda-rings and Tannakian symbols. Preprint in preparation (draft version available upon request, but see also [6])Google Scholar
  6. 6.
    Espeseth, A., Vik, T.: Motivic symbols and classical multiplicative functions. Research report, Norwegian Contest for Young Scientists (2016, submitted). http://andreasholmstrom.org/wp-content/2016/05/motivic-symbols-classical-final-version.pdf
  7. 7.
    Harvey, D.: Counting points on hyperelliptic curves in average polynomial time. Ann. of Math. 179(2), 783–803 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Harvey, D.: Computing zeta functions of arithmetic schemes. Proc. Lond. Math. Soc. 111(6), 1379–1401 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Holmstrom, A.: Towards automated conjecture-making in higher arithmetic geometry. In: CEUR Workshop Proceedings, vol. 1785, pp. 204–218 (2016)Google Scholar
  10. 10.
    Kedlaya, K.S.: Computing zeta functions via p-Adic cohomology. In: Buell, D. (ed.) ANTS 2004. LNCS, vol. 3076, pp. 1–17. Springer, Heidelberg (2004). doi: 10.1007/978-3-540-24847-7_1 CrossRefGoogle Scholar
  11. 11.
    Larson, C.E., Van Cleemput, N.: Automated conjecturing I: Fajtlowicz’s Dalmatian heuristic revisited. Artif. Intell. 231, 17–38 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    The LMFDB Collaboration: The L-functions and modular forms database. http://www.lmfdb.org
  13. 13.
    McCarthy, P.J.: Introduction to Arithmetical Functions. Springer, New York (1986)CrossRefzbMATHGoogle Scholar
  14. 14.
    Online Encyclopedia of Integer Sequences. http://oeis.org/
  15. 15.
    Redmond, D., Sivaramakrishnan, R.: Some properties of specially multiplicative functions. J. Number Theor. 13(2), 210–227 (1981)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    The Sage Developers: SageMath, the Sage Mathematics Software System, Version 7.6 (2017). http://www.sagemath.org
  17. 17.
    Stanley, R.: Enumerative Combinatorics, vol. 1, 2nd edn. Cambridge University Press, Cambridge (2014)zbMATHGoogle Scholar
  18. 18.
    Vik, T., Classical multiplicative functions. GitHub repository (2017). https://github.com/torstein-vik/zeta-types-smc/blob/master/Classical-Multiplicative-Functions/
  19. 19.
    Zeilberger, D.: A holonomic systems approach to special functions identities. J. Comput. Appl. Math. 32(3), 321–368 (1990)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Stockholm UniversityStockholmSweden
  2. 2.Fagerlia vgsÅlesundNorway

Personalised recommendations