An Improved Lower Bound for the de Bruijn--Erdős Consecutive Gap Problem

Abstract

Let (xn)n≥ 1 be a sequence of distinct points on the unit circle. After the first n points are inserted, the circle is divided into n intervals. For a fixed integer r≥ 1, let Mn(r) and mn(r) denote respectively the largest and smallest total lengths of r consecutive intervals. A theorem of de Bruijn and Erdős gives \[ n∞Mn(r)mn(r)≥ 1+1r . \] The case r=1 is sharp and gives the classical factor 2. The cases r≥ 2 remain much less understood. We prove the improved lower bound \[ n∞Mn(r)mn(r) ≥ 1+rr2-1 (r≥ 2). \] In particular, for two consecutive intervals the lower bound becomes 5/3, improving the de Bruijn--Erdős bound 3/2.

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…