Metraipolis › archive › dc_bc5da63ac5e1

A New Upper Bound for the Turán Density of the Tetrahedron — arXiv:2609.27495

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.27495
License (as archived)
CC0-1.0
Archived
2026-10-08T12:00:39.148Z
SHA-256 of the archived text
98e8db42db957da946dd93147a96d4ddcdfdff72e0e4f56b3a3fddff66240cca
Stable URL of this page
https://metraipolis.com/documento/dc_bc5da63ac5e1

How to cite

A New Upper Bound for the Turán Density of the Tetrahedron — arXiv:2609.27495 — arXiv (en), https://arxiv.org/abs/2609.27495 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bc5da63ac5e1 (Metraipolis archive dc_bc5da63ac5e1, sha256 98e8db42db957da946dd93147a96d4ddcdfdff72e0e4f56b3a3fddff66240cca)
BibTeX
@misc{dcbc5da63ac5e1,
  title = {A New Upper Bound for the Turán Density of the Tetrahedron — arXiv:2609.27495},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.27495},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bc5da63ac5e1; sha256 98e8db42db957da946dd93147a96d4ddcdfdff72e0e4f56b3a3fddff66240cca},
  year = {2026}
}

Archived text

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

We prove that the Turán density of the tetrahedron $K_4^{(3)}$ satisfies $\pi(K_4^{(3)}) \le 14993367693127837/26880000000000000 < 0.557789$, improving Baber's upper bound of $0.5615$ and closing about $62\%$ of the gap to the conjectured value $5/9$. The proof uses an exact seven-vertex flag-algebra certificate incorporating degree-stationarity from Razborov's differential method. To find the certificate, we combine the established techniques of cutting planes and column generation to optimize jointly over flag families whose types have at most five vertices. We give a complete formal proof of this Turán density bound in Lean 4.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-24 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Discrete Mathematics (cs.DM); Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.27495 — 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-08T12:00:26.555Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-24?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).