Metraipolis › archive › dc_eed6a60253ae
Kneserized Anticoncentration and Reverse Absorption for Graham's Rearrangement Conjecture — arXiv:2608.10015
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.10015
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T06:27:20.766Z
- SHA-256 of the archived text
d1569d542887f3ba57a8f9be6345ca8bdb557babd24856f9910715e84c9365af- Stable URL of this page
https://metraipolis.com/documento/dc_eed6a60253ae
How to cite
Kneserized Anticoncentration and Reverse Absorption for Graham's Rearrangement Conjecture — arXiv:2608.10015 — arXiv (en), https://arxiv.org/abs/2608.10015 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_eed6a60253ae (Metraipolis archive dc_eed6a60253ae, sha256 d1569d542887f3ba57a8f9be6345ca8bdb557babd24856f9910715e84c9365af)
BibTeX
@misc{dceed6a60253ae,
title = {Kneserized Anticoncentration and Reverse Absorption for Graham's Rearrangement Conjecture — arXiv:2608.10015},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.10015},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_eed6a60253ae; sha256 d1569d542887f3ba57a8f9be6345ca8bdb557babd24856f9910715e84c9365af},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.10015. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We establish a Kneser-based anticoncentration estimate for uniform subset sums in composite cyclic groups. The estimate contains a periodic loss and is weaker than its prime-modulus counterpart. Nevertheless, together with known small- and large-set results, it proves that, for every fixed $t\geq2$ such that $\mathbb{Z}_t$ is strongly sequenceable and every sufficiently large prime $p$, every subset of $\mathbb{Z}_{tp}\setminus\{0\}$ has a valid ordering, thus establishing the analogue of Graham's rearrangement conjecture for this family of composite cyclic groups. We then identify the structural source of this loss. An inverse theorem shows that failure of the stabilizer-free growth underlying prime-type anticoncentration forces almost all of the set into a proper subgroup or one of its cosets. We exploit this structure by reverse absorption. Iterating the resulting dichotomy between non-periodic anticoncentration and structured concentration proves that every subset of \[ \mathbb{Z}_k\setminus\{0\}, \qquad k=\prod_{i=1}^{s}p_i^{e_i}, \qquad \sum_{i=1}^{s}e_i\leq L, \qquad p_1<\cdots<p_s\leq\gamma p_1, \] admits a valid ordering whenever $L$ and $\gamma$ are fixed and the primes $p_i$ are sufficiently large.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-12 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Number Theory (math.NT).
Pagina del lavoro: https://arxiv.org/abs/2608.10015 — 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-19T06:20:30.679Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-12?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).