2000 character limit reached
A Generalization of the Schur-Siegel-Smyth Trace Problem
Published 27 Nov 2015 in math.NT | (1511.08837v3)
Abstract: Let $\alpha$ be a totally positive algebraic integer, and define its absolute trace to be $\frac{Tr(\alpha)}{\text{deg}(\alpha)}$, the trace of $\alpha$ divided by the degree of $\alpha$. Elementary considerations show that the absolute trace is always at least one, while it is plausible that for any $\epsilon >0$, the absolute trace is at least $2-\epsilon$ 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.