Magic functions for the Smyth-Siegel trace problem

Number Theory
Wednesday, September 20, 2023 - 3:30pm for 1 hour (actually 50 minutes)
Skiles 006
Naser Sardari – Penn State – nzt5208@psu.edu
Alexander Dunn

We study the Schur-Siegel-Smyth trace problem. We introduce a new linear programming problem that inclues Smyths' constraints, and we give an exact solution to it. This improves the best known lower bound on the Siegel trace problem which is based on Smyths' method. In a special case, we recover Siegel's original upper bound.  Our method unifies Siegel's and Smyth's work under the same framework. This is joint work with Bryce Orloski.