Metraipolis › archive › dc_b381c7d41585

Deletion thresholds and exponential examples for complete sequences — arXiv:2609.25107

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.25107
License (as archived)
CC0-1.0
Archived
2026-10-08T15:55:44.204Z
SHA-256 of the archived text
3d752acdfeda5b385aac625ef968401f2154de35c6510bb223c510abfa0ae28e
Stable URL of this page
https://metraipolis.com/documento/dc_b381c7d41585

How to cite

Deletion thresholds and exponential examples for complete sequences — arXiv:2609.25107 — arXiv (en), https://arxiv.org/abs/2609.25107 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b381c7d41585 (Metraipolis archive dc_b381c7d41585, sha256 3d752acdfeda5b385aac625ef968401f2154de35c6510bb223c510abfa0ae28e)
BibTeX
@misc{dcb381c7d41585,
  title = {Deletion thresholds and exponential examples for complete sequences — arXiv:2609.25107},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.25107},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b381c7d41585; sha256 3d752acdfeda5b385aac625ef968401f2154de35c6510bb223c510abfa0ae28e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.25107. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We prove that the pairs of integers $0\le m<n$ for which a nondecreasing integer sequence can remain complete after every deletion of $m$ terms and become incomplete after every deletion of $n$ terms are exactly those with $m\le1$. Here a sequence is complete if every sufficiently large integer is a finite sum of terms with distinct indices. This answers Erdős Problem 348, posed by Graham and later included in the book of Erdős and Graham. The proof uses a central-interval theorem: if a complete nondecreasing positive integer sequence $(a_i)$ has prefix sums $S_j$ with $S_j-a_{j+1}\to\infty$, then each sufficiently long prefix represents every integer from any fixed completeness threshold $T$ to $S_j-T$. We also refute Graham's conjecture, later repeated by Erdős and Graham, that $(\lfloor t\gamma^n\rfloor)_{n\ge1}$ is complete for every $t>0$ and $1<\gamma<(1+\sqrt5)/2$. We obtain the counterexample by combining Dubickas's fractional-part theorem with an elementary sign adjustment. For a common base in this range, we further construct two such sequences whose interleaving is incomplete and whose coefficient ratio is not a rational multiple of any integer power of the base.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-23 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.25107 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T15:16:21.658Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).