A Generalization of the Schur-Siegel-Smyth Trace Problem
Kyle Pratt, George Shakan, Alexandru Zaharescu

TL;DR
This paper generalizes the Schur-Siegel-Smyth trace problem, which concerns the lower bounds of the average trace of totally positive algebraic integers, by framing it within a broader mathematical context.
Contribution
It demonstrates that the classical trace problem is a special case of a more general problem, expanding the scope of the original question.
Findings
The classical trace problem is a specific instance of a broader mathematical framework.
Elementary bounds show the absolute trace is always at least one.
The paper suggests a new perspective for approaching the trace problem.
Abstract
Let be a totally positive algebraic integer, and define its absolute trace to be , the trace of divided by the degree of . Elementary considerations show that the absolute trace is always at least one, while it is plausible that for any , the absolute trace is at least with only finitely many exceptions. This is known as the Schur-Siegel-Smyth trace problem. Our aim in this paper is to show that the Schur-Siegel-Smyth trace problem can be considered as a special case of a more general problem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Geometry · Analytic Number Theory Research · Mathematical Dynamics and Fractals
