Number Theory, Potential Theory, and Convex Optimization

Pennsylvania State Univ University Park, University Park PA

Investigators

Abstract

The research and broader impacts of this award will contribute to current developments in number theory, computer science, and mathematical physics. Computer scientists and mathematicians are interested in the classification and optimal approximation of integral polynomials with real roots. The PI and his Ph.D. student (Bryce Orloski) will prove new (optimal) results and introduce new strategies in this direction. Their methods and algorithms will have applications in mathematical physics (ground states of interacting particle systems) and information theory (error-correcting codes). The PI is passionate and invested in teaching Mathematics to underrepresented minorities. He will use his funding to support his graduate students. The PI will organize a workshop on number theory and convex optimization at Penn State University in the third summer of the grant. The workshop will introduce around 20 advanced graduate students and beginning postdocs to an active area of research and enable them to start their work in this area, particularly in collaboration with each other or senior mathematicians. On a more technical level, understanding the distribution of roots of integral polynomials with real roots sheds light on the distribution of the roots of the zeta function of abelian varieties over finite fields, the distribution of eigenvalues of the adjacency matrices of graphs and the distribution of the eigenvalues of the symmetric integral matrices. The PI and his Ph.D. student (Bryce Orloski) will classify the possible asymptotic distributions of the conjugates of algebraic integers over a given number field. The main goal is to identify the leading exponent of the asymptotic number of algebraic integers with some adelic constraints with the generalized transfinite diameter defined by David Cantor and Robert Rumely. Moreover, they propose a new method since the work of Smyth in 1984 and derive new bounds for the Schur-Siegel-Smyth trace problem by formulating a convex optimization problem in potential theory. They will prove the existence of a unique analytic solution to this optimization problem as the solution to some linear and integral equations. They will develop and implement an efficient algorithm for approximating the optimal solution. Furthermore, physicists have used the linear programming (conformal bootstrap) method to constrain the spectrum of two-dimensional conformal field theories. The PI's project on the optimality of the hexagonal lattice and the extremal values of the first nontrivial eigenvalues of the Laplacian operator will prove new results for these problems and introduce new methods in this direction with applications in Mathematical Physics. This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.