Metraipolis › archive › dc_2e221df84487
Branch-Sensitive Density Increments for $k$-Configurations — arXiv:2610.03750
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.03750
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T16:51:10.832Z
- SHA-256 of the archived text
b8e67b7f4e6c7d030d399580db0654ff7e30437122083bba73f7e13c6d396c24- Stable URL of this page
https://metraipolis.com/documento/dc_2e221df84487
How to cite
Branch-Sensitive Density Increments for $k$-Configurations — arXiv:2610.03750 — arXiv (en), https://arxiv.org/abs/2610.03750 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2e221df84487 (Metraipolis archive dc_2e221df84487, sha256 b8e67b7f4e6c7d030d399580db0654ff7e30437122083bba73f7e13c6d396c24)
BibTeX
@misc{dc2e221df84487,
title = {Branch-Sensitive Density Increments for $k$-Configurations — arXiv:2610.03750},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.03750},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2e221df84487; sha256 b8e67b7f4e6c7d030d399580db0654ff7e30437122083bba73f7e13c6d396c24},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.03750. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We refine the density-increment argument for $k$-configurations developed by Beker. The point is not to introduce a new inverse theorem, but to retain information that is lost when the graph-counting output is compressed into a single uniform alternative. For the transitive $K_k$ appearing in the $k$-configuration problem we keep a fixed moment throughout the graph recursion and obtain three genuinely different outputs: a row-degree anomaly, a non-centred grid anomaly, and a centred grid anomaly. The centred case is treated directly through positivity of the associated Gram moments, avoiding the usual unbalancing step. Each output is then routed through the appropriate local Kelley--Meka mechanism with its own density gain, rank cost, and width cost. A weighted iteration budget prevents the most expensive local branches from being charged the maximal number of times. For a finite abelian group $G$ of odd order and $A\subseteq G$ of density $\alpha$, write $L=\log(2/\alpha)$ and $\Lambda=L+\log(2k)$. We obtain a lower bound of the form \[ \Pp_{x_1,\ldots,x_k\in G}\!\left(\frac{x_i+x_j}{2}\in A\ \text{for all }1\le i\le j\le k\right) \ge \exp\!\bigl(-C\Phi(k,L,\Lambda)\bigr), \] where \[ \Phi(k,L,\Lambda)=k^{36}L^6\Lambda^6+k^{34}L^8\Lambda^5+k^{32}L^{14}\Lambda+k^{30}L^{16}. \] Consequently, in the Erdős--Moser application one may replace the exponent $68$ in Beker's $k$-configuration route by $36$; in particular the same reduction yields the sum-free lower bound with every exponent $c<1/36$.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.03750 — 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-06T15:19:19.950Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).