Metraipolis › archive › dc_786ae6c86910

A logarithmic error term for subset sums of zero-sum-free sets — arXiv:2610.38373

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.38373
License (as archived)
CC0-1.0
Archived
2026-11-01T02:37:40.353Z
SHA-256 of the archived text
75f47252e2c5472a81663b3909390b79b1db15a460d6be4f1a001cdd4c50df61
Stable URL of this page
https://metraipolis.com/documento/dc_786ae6c86910

How to cite

A logarithmic error term for subset sums of zero-sum-free sets — arXiv:2610.38373 — arXiv (en), https://arxiv.org/abs/2610.38373 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_786ae6c86910 (Metraipolis archive dc_786ae6c86910, sha256 75f47252e2c5472a81663b3909390b79b1db15a460d6be4f1a001cdd4c50df61)
BibTeX
@misc{dc786ae6c86910,
  title = {A logarithmic error term for subset sums of zero-sum-free sets — arXiv:2610.38373},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.38373},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_786ae6c86910; sha256 75f47252e2c5472a81663b3909390b79b1db15a460d6be4f1a001cdd4c50df61},
  year = {2026}
}

Archived text

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

For a positive integer $k$, let $f(k)$ be the minimum number of distinct nonempty subset sums of a zero-sum-free $k$-element set, where the minimum is taken over all finite abelian groups. We prove $f(k)\ge \frac{k^2}{2}-13k\log(k+1)-116k$. Together with the classical upper bound, this gives $f(k)=k^2/2+O(k\log k)$, with the optimal leading coefficient. As a consequence, the Olson constant of every finite abelian group $G$ satisfies $\mathrm{Ol}(G)\le\sqrt{2|G|}+O(\log|G|)$. The argument combines a triangular lower bound for repeated supports, a count using blocks of two and three copies, and a greedy expansion argument. No restriction is imposed on the order of the group or on the stabilizer of the set of subset sums.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO) ; Number Theory (math.NT).
Pagina del lavoro: https://arxiv.org/abs/2610.38373 — 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-11-01T02:15:28.247Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).