Abstract
In 1977 Pohst conjectured a certain inequality for $n$ variables and gave a computer-assisted 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.
Citation
Gabriel Raposo. "A proof of Pohst's inequality." Funct. Approx. Comment. Math. 70 (1) 71 - 83, March 2024. https://doi.org/10.7169/facm/2110
Information
