2022/10/27 by Raposo, Gabriel
#11R27 #11R29 (Secondary) #11Y40 (Primary) #Combinatorics (math.CO) #FOS: Mathematics #Number Theory (math.NT)
paper · doi:10.48550/arxiv.2210.15141
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.