Metraipolis › archive › dc_8208530fcb62

Arithmetic Progressions in a Random Binary Subset-Sum Set — arXiv:2609.33067

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.33067
License (as archived)
CC0-1.0
Archived
2026-10-07T23:28:59.941Z
SHA-256 of the archived text
fdaf583a5fb630375fd010056aa80703a6a7bab8af73100685eaa3e59e9eb862
Stable URL of this page
https://metraipolis.com/documento/dc_8208530fcb62

How to cite

Arithmetic Progressions in a Random Binary Subset-Sum Set — arXiv:2609.33067 — arXiv (en), https://arxiv.org/abs/2609.33067 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8208530fcb62 (Metraipolis archive dc_8208530fcb62, sha256 fdaf583a5fb630375fd010056aa80703a6a7bab8af73100685eaa3e59e9eb862)
BibTeX
@misc{dc8208530fcb62,
  title = {Arithmetic Progressions in a Random Binary Subset-Sum Set — arXiv:2609.33067},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.33067},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8208530fcb62; sha256 fdaf583a5fb630375fd010056aa80703a6a7bab8af73100685eaa3e59e9eb862},
  year = {2026}
}

Archived text

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

Let $u=(u_n)_{n\ge0}$ be a binary sequence, and define \[ X_0=1,\qquad X_{n+1}=2X_n+u_n \qquad(n\ge0). \] Let $A_u$ be the set of all nonempty finite subset sums of the sequence $(X_n)$, and let $L_u(N)$ denote the maximum length of an arithmetic progression contained in $A_u\cap[1,N]$. We prove that there are absolute constants $c>0$ and $N_0\geq 1$ such that, for every binary sequence $u$, \[ L_u(N)\ge \exp\!\left(c\sqrt{\frac{\log N}{\log\log N}}\right) \] for all $N\geq N_0$. Moreover, if the random variables $u_n$ are independent and uniformly distributed on $\{0,1\}$, then, almost surely, \[ L_u(N)\ll_u N^{2/3}\exp\!\left(C\sqrt{\log N\log\log N}\right), \] where $C>0$ is an absolute constant. Furthermore, every eventually periodic binary sequence satisfies $L_u(N)\gg_u N^{1/2}$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.33067 — 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-07T23:08:10.784Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).