Whole-Cofactor Peeling, Extreme-Point LP Rank Rounding, and Shifted-Interval Hinge Duality for Erdลs Problem 708
Let ๐ด be a set of ๐ integers with maximum ๐. Let ๐(๐) be the smallest integer such that every interval of length ๐ contains a subset ๐ต of size at most ๐(๐) whose product is a multiple of the product of all elements in ๐ด. Erdลs and Surรกnyi proved that ๐(๐) is at least (2 โ ๐(1))๐ in 1959. Erdลs later posed the question of whether ๐(๐) โค (2 + ๐(1))๐. Previous methods, such as those by Chen, established bounds of ๐(๐) โค 11๐, but these methods struggle in the intermediate interval regime. We resolve this by combining extreme-point linear-programming rounding and shifted-interval hinge inequalities. We establish an 56501 unconditional bound of ๐(๐) โค ( + ๐(1))๐ โ 8.83๐. In other words, our method reduces the upper 6400 bound by approximately 20% compared to previous work. Finally, we verify our bounds using sliding-window evaluations up to ๐ = 15,120.This paper establishes the asymptotic bounds for the ErdลsโSurรกnyi function g(n). For exact small-n values and computational verification details, see the companion manuscript: 10.5281/zenodo.24366897
Authors
- C. Bergstrรถm (ORCID: https://orcid.org/0009-0008-7153-1817)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-18
- DOI
- https://doi.org/10.5281/zenodo.24342717
- Citations
- 1
- Primary Topic
- Limits and Structures in Graph Theory
- Type
- preprint