A Detailed Proof of Pohst's Inequality
Abstract
In 1977 Pohst conjectured a certain inequality for $n$ variables and give a computerassisted proof for $n\leq 10$. We give a proof for all $n$ using a combinatorial argument. This inequality yields a better bound for the regulator in terms of the discriminant for totally real number fields.
 Publication:

arXiv eprints
 Pub Date:
 October 2022
 DOI:
 10.48550/arXiv.2210.15141
 arXiv:
 arXiv:2210.15141
 Bibcode:
 2022arXiv221015141R
 Keywords:

 Mathematics  Number Theory;
 Mathematics  Combinatorics;
 11Y40 (Primary);
 11R27;
 11R29 (Secondary)
 EPrint:
 12 pages, 9 figures