English

An elementary proof for a generalization of a Pohst's inequality

Number Theory 2021-06-03 v2 Combinatorics

Abstract

Let Pn(y1,,yn):=1i<jn(1yiyj)P_n(y_1,\ldots,y_n):= \prod_{1\leq i<j\leq n}\left( 1 -\frac{y_i}{y_j}\right) and Pn:=sup(y1,,yn)Pn(y1,,yn)P_n:= \sup_{(y_1,\ldots,y_n)}P_n(y_1,\ldots,y_n) where the supremum is taken over the nn-ples (y1,,yn)(y_1,\ldots,y_n) of real numbers satisfying 0<y1<y2<<yn0 <|y_1| < |y_2|< \cdots < |y_n|. We prove that Pn2n/2P_n \leq 2^{\lfloor n/2\rfloor} for every nn, i.e., we extend to all nn the bound that Pohst proved for n11n\leq 11. As a consequence, the bound for the absolute discriminant of a totally real field in terms of its regulator is now proved for every degree of the field.

Keywords

Cite

@article{arxiv.2101.06163,
  title  = {An elementary proof for a generalization of a Pohst's inequality},
  author = {Francesco Battistoni and Giuseppe Molteni},
  journal= {arXiv preprint arXiv:2101.06163},
  year   = {2021}
}

Comments

10 pages