Metraipolis › archive › dc_6f4255fc16ce
A reformulation of the discrete Convexity Conjecture via $k$-thresholds — arXiv:2608.11183
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.11183
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T06:26:52.587Z
- SHA-256 of the archived text
d65d020d0310d7330fbafb41bcba25a9dd4ba8b901da8d0e6793a1446e3b0e26- Stable URL of this page
https://metraipolis.com/documento/dc_6f4255fc16ce
How to cite
A reformulation of the discrete Convexity Conjecture via $k$-thresholds — arXiv:2608.11183 — arXiv (en), https://arxiv.org/abs/2608.11183 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6f4255fc16ce (Metraipolis archive dc_6f4255fc16ce, sha256 d65d020d0310d7330fbafb41bcba25a9dd4ba8b901da8d0e6793a1446e3b0e26)
BibTeX
@misc{dc6f4255fc16ce,
title = {A reformulation of the discrete Convexity Conjecture via $k$-thresholds — arXiv:2608.11183},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.11183},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6f4255fc16ce; sha256 d65d020d0310d7330fbafb41bcba25a9dd4ba8b901da8d0e6793a1446e3b0e26},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.11183. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We introduce the notion of "$k$-thresholds'' and show that Talagrand's discrete convexity conjecture is equivalent to the assertion that, for some universal integer $k \ge 2$, the $k$-threshold of every increasing family is at most a universal constant times its expectation threshold. We prove a reduction theorem that bounds the $k$-threshold of any increasing graph property in terms of ordinary thresholds of graphs in suitable decompositions of its members. As a consequence, we determine, up to a constant factor, the $k$-threshold of every fixed graph in terms of a natural $k$-density parameter. We also prove that $k=2$ suffices for several classical spanning graph containment properties. More generally, we establish the conjectured comparison between $k$-thresholds and expectation thresholds for broad classes of graph containment properties whose target graphs have low degeneracy. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-12 in math.PR). Categorie arXiv: Combinatorics (math.CO) ; Probability (math.PR). Pagina del lavoro: https://arxiv.org/abs/2608.11183 — 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:00.089Z dalla pagina https://arxiv.org/catchup/math.PR/2026-08-12?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).