Indexed metadata

Improved Sidorenko bound for hypergraph Turan densities

Shuyan Chen, Xinmin Hou, Xizhi Liu

Source record

Source: arXiv

Published: Oct 13, 2026

arXiv: 2610.18944

Open original source ↗

Source abstract

For every fixed integer r≥3r\ge3, we prove that the Turán density of every rr-uniform hypergraph FF with m≥1m\ge1 edges satisfies π(F)≤1−crm−(r−1)/rπ(F)\le1-c_rm^{-(r-1)/r}, where cr>0c_r>0 depends only on rr. This improves Sidorenko's general bound, whose gap from 11 is of order m−1m^{-1}. Complete rr-uniform hypergraphs show that the exponent (r−1)/r(r-1)/r is optimal. The proof combines a potential argument for partial embeddings with the Lovász Local Lemma.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Improved Sidorenko bound for hypergraph Turan densities — Mathematical Frontier Network