An improved lower bound for Erdos--Szekeres products

Abstract

In 1959, Erdos and Szekeres posed a series of problems concerning the size of polynomials of the form Pn(z) = Πj=1n (1 - zsj), where s1, …, sn are positive integers. Of particular interest is the quantity f(n) = ∈fs1,…,sn 1 |z|=1 |Pn(z)|. They proved that n∞ f(n)1/n = 1, and also established the classical lower bound f(n) 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. This gives the first improvement of the classical lower bound for the Erdos--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 Erdos--Szekeres proof could be fixed, the O'Hara--Rodriguez bound would yield exactly this inequality.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…