Speaker: Bryce Orloski (Penn State)

Title: Upper Bounds on the Schur-Siegel-Smyth Trace Problem

Abstract:

The Schur-Siegel-Smyth trace problem seeks the smallest limit point of the set of average conjugate values of totally positive algebraic integers. We give a history of the problem along with the main ideas used in the proof of improving the upper bound on the problem. We exploit the algorithmic nature of our approach to give a family of upper bounds that converge to the goal value of the trace problem and improve the best previously known upper bound to 1.81618.

link: https://huji.zoom.us/j/83882410661?pwd=eZ6Vxd1wrBNcopdswGbUGuObhCNAZB.1