English

An improved lower bound for Erd\H{o}s--Szekeres products

Number Theory 2025-09-23 v2 Classical Analysis and ODEs Combinatorics

Abstract

In 1959, Erd\H{o}s and Szekeres posed a series of problems concerning the size of polynomials of the form Pn(z)=j=1n(1zsj), P_n(z) = \prod_{j=1}^n (1 - z^{s_j}), where s1,,sns_1, \dots, s_n are positive integers. Of particular interest is the quantity f(n)=infs1,,sn1maxz=1Pn(z). f(n) = \inf_{s_1,\dots,s_n\ge 1} \max_{|z|=1} |P_n(z)|. They proved that limnf(n)1/n=1\lim_{n\to\infty} f(n)^{1/n} = 1, and also established the classical lower bound f(n)2nf(n) \ge \sqrt{2n}. However, despite extensive effort over more than six decades, no stronger general lower bound had been established. In this paper, we obtain the new bound f(n)2n. f(n) \ge 2\sqrt{n}. This gives the first improvement of the classical lower bound for the Erd\H{o}s--Szekeres problem in the general case since 1959. In particular, our result confirms a remark of Billsborough et al., who observed that if the original Erd\H{o}s--Szekeres proof could be fixed, the O'Hara--Rodriguez bound would yield exactly this inequality.

Keywords

Cite

@article{arxiv.2509.14182,
  title  = {An improved lower bound for Erd\H{o}s--Szekeres products},
  author = {Quanyu Tang},
  journal= {arXiv preprint arXiv:2509.14182},
  year   = {2025}
}

Comments

7 pages. v2: Added more references and corrected some typos