A Detailed Proof of Pohst's Inequality
Abstract
In 1977 Pohst conjectured a certain inequality for n variables and give a computer-assisted proof for n≤ 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.