Saved in:
Bibliographic Details
Main Author: Korsky, Samuel
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2605.30959
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914616032886784
author Korsky, Samuel
author_facet Korsky, Samuel
contents Let $(x_n)_{n\geq 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\geq 1$, let $M_n^{(r)}$ and $m_n^{(r)}$ denote respectively the largest and smallest total lengths of $r$ consecutive intervals. A theorem of de Bruijn and Erdős gives \[ \limsup_{n\to\infty}\frac{M_n^{(r)}}{m_n^{(r)}}\geq 1+\frac1r . \] The case $r=1$ is sharp and gives the classical factor $2$. The cases $r\geq 2$ remain much less understood. We prove the improved lower bound \[ \limsup_{n\to\infty}\frac{M_n^{(r)}}{m_n^{(r)}} \geq 1+\frac{r}{r^2-1} \qquad (r\geq 2). \] In particular, for two consecutive intervals the lower bound becomes $5/3$, improving the de Bruijn--Erdős bound $3/2$.
format Preprint
id arxiv_https___arxiv_org_abs_2605_30959
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle An Improved Lower Bound for the de Bruijn--Erdős Consecutive Gap Problem
Korsky, Samuel
Combinatorics
Let $(x_n)_{n\geq 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\geq 1$, let $M_n^{(r)}$ and $m_n^{(r)}$ denote respectively the largest and smallest total lengths of $r$ consecutive intervals. A theorem of de Bruijn and Erdős gives \[ \limsup_{n\to\infty}\frac{M_n^{(r)}}{m_n^{(r)}}\geq 1+\frac1r . \] The case $r=1$ is sharp and gives the classical factor $2$. The cases $r\geq 2$ remain much less understood. We prove the improved lower bound \[ \limsup_{n\to\infty}\frac{M_n^{(r)}}{m_n^{(r)}} \geq 1+\frac{r}{r^2-1} \qquad (r\geq 2). \] In particular, for two consecutive intervals the lower bound becomes $5/3$, improving the de Bruijn--Erdős bound $3/2$.
title An Improved Lower Bound for the de Bruijn--Erdős Consecutive Gap Problem
topic Combinatorics
url https://arxiv.org/abs/2605.30959