Fast algorithms for zeta functions of algebraic varieties

点击翻译按钮获取中文摘要

The project aims to develop new algorithms for counting the number of solutions to polynomial equations in several variables. This fundamental counting problem appears in many areas of mathematics and computer science, such as number theory and cryptography. The aim of the project is to develop algorithms that are more efficient and that are able to handle much larger problems than existing algorithms. The new algorithms are expected to have applications to the numerical investigation of important unsolved problems in number theory, such as the Sato-Tate, Lang-Trotter and Birch-Swinnerton-Dyer conjectures.