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

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Whole-Cofactor Peeling, Extreme-Point LP Rank Rounding, and Shifted-Interval Hinge Duality for Erdล‘s Problem 708

C. Bergstrรถm
1 citations
Zenodo (CERN European Organization for Nuclear Research)
Limits and Structures in Graph Theory
preprint

Whole-Cofactor Peeling, Extreme-Point LP Rank Rounding, and Shifted-Interval Hinge Duality for Erdล‘s Problem 708

C. Bergstrรถm
preprint en
1 citations

Abstract

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

Zenodo (CERN European Organization for Nuclear Research)
Limits and Structures in Graph Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon