Pith. sign in

REVIEW 4 minor 43 references

Intervals of uniform Tur\'an densities

T0 review · 0 major / 4 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The set of uniform Turán densities of 3-graph families contains the interval [1−δ, 1].

desk verdict Proves a terminal interval of uniform Turán densities by realizing limits of palette chains; the construction is novel and the internal logic is consistent, with the main caveat being reliance on a recent external palette characterization. read the letter →

arxiv 2608.04790 v1 pith:BHFNBEPK submitted 2026-08-05 math.CO

Heng Li , Xizhi Liu , Oleg Pikhurko This is my paper · ORCID
classification math.CO MSC 05C6505D9905C50
keywords uniformTurándensitypalettespaletteLagrangian2-liftsspectralgapinfinitefamiliesterminalinterval3-graphs
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper proves that the set $\Pi_{\therefore,\infty}$ of uniform Turán densities of possibly infinite families of 3-uniform hypergraphs contains a terminal interval: some $[1-\delta, 1]$ lies entirely inside it. This is the first interval statement for uniform Turán densities, and it implies that $\Pi_{\therefore,\infty}$ has positive Lebesgue measure and Hausdorff dimension $1$. The key move is to realize decreasing limits of finite-palette Lagrangians as exact densities of infinite forbidden families, bypassing the unresolved question of whether $\Pi_{\therefore,\infty}$ is closed. A tower of spectrally controlled graph 2-lifts plus a multiscale stability estimate produces a palette chain whose Lagrangian limits fill an interval, and complete joins push that interval to $1$.

What carries the argument

The central object is a palette $P=(C,T)$: a finite set of colors and a set of allowed ordered triples of colors. Its palette Lagrangian $\lambda(P)$ is the maximum over weightings $x\in\Delta_C$ of the cubic polynomial $\Lambda_P(x)=\sum_{(a,b,c)\in T} x_a x_b x_c$. The proof uses a sequence of palettes connected by homomorphisms whose Lagrangians decrease to a limit $x$; Proposition 3.1 converts such a projective chain into an infinite forbidden family with uniform Turán density exactly $x$. The interval construction rests on a tower of positive 2-lifts of a regular graph, with signings chosen by the Bilu–Linial theorem to control the spectrum, so that the root palette's uniform weighting remains uniquely optimal through arbitrary levels (Theorem 4.5). The global cubic expander inequality (Lemma 4.4) is the analytic core: it turns any imbalance between lifted copies of a color into a quadratic penalty, while the base-4 digit lemma (Lemma 5.2) fills an interval by the redundant digit set $\{0,1,2,3,4\}$. Finally, the complete join $J_M(P)$ maps a density $x$ to $1-(1-x)/M^2$ while preserving palette homomorphisms, which pushes the interval to $1$.

What would settle it

Construct an infinite family $\mathcal F$ of 3-graphs for which the supremum of $d(Q)$ over palettes $Q$ that color no member of $\mathcal F$ is strictly less than $\pi(\mathcal F)$; such a counterexample to Theorem 2.5 would break the upper bound in Proposition 3.1 and invalidate the interval construction. More directly, with an explicit choice of the constants in the proof one could search for a number in $(1-\delta,1)$ and attempt to prove it is not the uniform Turán density of any infinite family.

Watch

Extended reading notes

Core claim

The central claim is that every real number sufficiently close to $1$ is the uniform Turán density of some possibly infinite family of $3$-graphs. Equivalently, there is a $\delta>0$ such that $[1-\delta, 1]\subseteq \Pi_{\therefore,\infty}$. The proof works by constructing compatible chains of finite palettes whose Lagrangians decrease to a chosen limit $x$; Proposition 3.1 shows such a limit is realized as $\pi(\mathcal F)$ for a suitable infinite family $\mathcal F$. The chain is built from 2-lifts of a large regular graph, and a global cubic expander inequality guarantees that the uniform weighting stays the unique Lagrangian maximizer despite deletions of up to four tripartite perfect matchings per level. Choosing deletion counts as base-4 digits fills a non-degenerate interval of limits, and the $M$-fold complete join maps that interval onto a terminal interval ending at $1$.

Load-bearing premise

The argument assumes the cited palette characterization that the uniform Turán density of any family equals the supremum of unweighted densities of palettes that color none of its members; this equality is taken from the literature for infinite families and is the bridge that turns a Lagrangian limit into an exact density.

Editorial extensions

If this is right

  • $\Pi_{\therefore,\infty}$ has positive Lebesgue measure and Hausdorff dimension $1$.
  • Every number in $[1-\delta,1]$ is the uniform Turán density of some infinite family of $3$-graphs.
  • The projective-chain realization principle (Proposition 3.1) supplies a general way to turn decreasing limits of finite-palette Lagrangians into exact densities, without knowing whether $\Pi_{\therefore,\infty}$ is closed.
  • The same terminal interval $[1-\delta,1]$ lies in every uniformity $r\geq 3$ (Corollary 6.1).
  • Since there are only countably many finite families, any interval statement necessarily uses infinite forbidden families.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A natural next question is whether the whole set $\Pi_{\therefore,\infty}$ is a finite union of intervals; the present construction suggests the palette-chain machinery may be flexible enough to fill intervals elsewhere in the density set, not just near $1$.
  • The complete-join step indicates a general transfer principle: any non-degenerate interval of attainable densities can be moved to a terminal interval by joining, so analogous results might hold for other palette-defined density sets.
  • The explicit size of $\delta$ depends on spectral expansion constants from the Bilu–Linial theorem and on the root graph size $N_0$; tracking these constants could give a concrete (if small) terminal interval and testable numerical bounds.
  • The proof leaves open whether finitely many forbidden 3-graphs can already realize an interval; the countability obstruction is not a proof of impossibility, and a positive answer would require a different construction.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

0 major / 4 minor

Summary. The paper proves that the set Π_{∴,∞} of uniform Turán densities of possibly infinite families of 3-graphs contains a terminal interval [1−δ,1], and consequently has positive Lebesgue measure and Hausdorff dimension 1. The proof combines a projective-chain realization principle (Proposition 3.1), a spectrally controlled tower of 2-lifts (Proposition 2.7), a multiscale stability theorem for palette Lagrangians (Theorem 4.5), a digit-coding lemma that produces an interval of branch limits (Theorem 5.3), and complete joins that push this interval toward 1 (Lemma 5.4 and Theorem 1.1). The extension to all uniformities is stated in Corollary 6.1.

Significance. If correct, this is a substantial structural result: it answers, in the uniformly dense setting, the analogue of the Frankl–Rödl–Talbot terminal-interval question, and it gives positive measure and Hausdorff dimension 1 for Π_{∴,∞}. The proof is largely constructive, with explicit constants and no fitted parameters, and the main lemmas are stated with proofs that I could follow. The central caveat is that Proposition 3.1's upper bound uses the arbitrary-family palette characterization of Theorem 2.5, cited from Lamaison [20] and Lin–Sun–Wang–Zhou [21] rather than proved here. This is a transparent external dependency, not an internal circularity; the stress-test concern that a failure of Theorem 2.5 for infinite families would collapse the upper bound is accurate, but it is a property of the cited theorem, not a defect in this manuscript.

minor comments (4)
  1. [Proof of Theorem 1.1, Section 5.2] The sentence containing '((M+1)/M)^2− →1 < A/B' appears garbled; it should read '((M+1)/M)^2 → 1 < A/B'.
  2. [Throughout] The symbol 'Π ,∞' is missing its subscript '∴' in the rendered text; please ensure the notation Π_{∴,∞} is typeset consistently.
  3. [Section 2.1] The heading 'F act 2.2' should read 'Fact 2.2'.
  4. [Section 2.2] The expression C√(d log^3 d) should clarify that log^3 d means (log d)^3, to avoid confusion with iterated logarithms.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the claimed terminal interval is obtained from explicit palette-tower constructions whose Lagrangians are computed exactly, with the only load-bearing external ingredients being independent theorems by other authors.

full rationale

The derivation chain is not circular. Theorem 1.1 is obtained by three independent mechanisms: Proposition 3.1 turns decreasing Lagrangian limits of projective palette chains into uniform Turán densities of infinite families; Theorem 4.5 computes those Lagrangians exactly from spectral lift identities and expansion estimates; and Section 5 converts the exact loss formula into an interval via a digit-coding lemma and complete joins. No parameter is fitted to the target value, and no step assumes the conclusion. The main external inputs are Theorem 2.4 from Král', Kučerák, Lamaison and Tardos, Theorem 2.5 from Lamaison and from Lin, Sun, Wang and Zhou, and the Bilu–Linial signing theorem; none of these is authored by the present authors, and none is used merely as a renamed form of the target result. The proof of Proposition 3.1 is self-contained once Theorem 2.5 and Theorem 2.4 are granted: it enumerates all finite palettes with Lagrangian above x, builds separator graphs via balanced blow-ups, and verifies both density bounds without invoking the endpoint x as an input. The palette lift identity (Lemma 4.2), the matching bound (Lemma 4.3), the cubic expander inequality (Lemma 4.4), and the telescoping multiscale bound (Theorem 4.5) are demonstrated inside the paper. The self-citations [22], [23], and [32] appear only as background in the introduction and are not used in any proof, so they are not load-bearing. A genuine assumption risk remains: the upper-bound half of Proposition 3.1 relies on the arbitrary-family palette characterization, and the paper itself notes that the extension in [21] requires an additional compactness argument; if that external theorem failed for infinite families, the upper bound would collapse. But that is a correctness risk about an independent cited result, not circularity. Since all internal steps are explicit computations with no fitted parameters and no self-referential forcing, the appropriate finding is no significant circularity.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

The argument introduces no free parameters fitted to data. It relies on standard results in spectral graph theory (Bilu-Linial) and on the palette classification theorems from the literature (Král' et al. [19], Lamaison [20], Lin et al. [21]). These theorems are external to this paper; if any of them is faulty, the construction would not yield the claimed interval.

assumptions (4)
  • standard math Bilu-Linial signing theorem provides signings with ||A_s||_{op} ≤ C sqrt(d log^3 d) for graphs of maximum degree at most d.
    Used in Proposition 2.7 to build the spectrally controlled tower of 2-lifts; if false, the spectral gap condition in Lemma 4.4 fails.
  • domain assumption Palette separation theorem (Theorem 2.4, from [19]): there exists a 3-graph that is P-colorable but not Q-colorable iff there is no homomorphism P→Q and no homomorphism P→rev(Q).
    Used in Proposition 3.1 to build the forbidden graphs F_j; a core bridge from palettes to 3-graphs.
  • domain assumption Arbitrary-family palette characterization (Theorem 2.5, from [20] and [21, Theorem 1.4]): π(F) = sup {d(Q) : no member of F is Q-colorable}.
    Used in Proposition 3.1 for the upper bound on π(F); the entire pointwise realization depends on this.
  • domain assumption Extension of palette separation and palette characterization to r-palettes for all r≥3 (Section 6, citing [21, Theorems 1.4 and 1.6]).
    Used in the concluding section to transfer the interval to all uniformities; stated but not proved in this paper.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Intervals of uniform Tur\'an densities." pith.science (2026). https://pith.science/paper/BHFNBEPK

@misc{pith2026260804790,
  author       = {Pith},
  title        = {Pith review of: Intervals of uniform Tur\'an densities},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/BHFNBEPK}},
  note         = {Machine review of arXiv:2608.04790}
}
abstract

We prove that the set $\Pi_{\therefore,\infty}$ of uniform Tur\'an densities of possibly infinite families of $3$-graphs contains a terminal interval: there exists $\delta>0$ such that $[1-\delta,1]\subseteq\Pi_{\therefore,\infty}$. Consequently, $\Pi_{\therefore,\infty}$ has positive Lebesgue measure and Hausdorff dimension $1$.

Figures

Figures reproduced from arXiv: 2608.04790 by the authors.

Figure 1
Figure 1. The two possible Ls-liftings of a base edge uv: the parallel matching for s(uv) = +1 and the crossed matching for s(uv) = −1. Let G = (V, E) be a graph. A signing is a map s: E → {+1, −1}. Its signed adjacency matrix As is defined by (As)uv := ( s(uv), uv ∈ E, 0, uv /∈ E. The positive 2-lift Ls(G) has vertex set V × {+1, −1} and edge set E(Ls(G)) =  {u σ , vs(uv)σ }: uv ∈ E, σ ∈ {+1, −1} [PITH_FULL_IMAGE:figures/f… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

43 extracted references · 27 canonical work pages

  1. [21]

    H. Lin, G. Sun, G. Wang, and W. Zhou. Uniform Tur´ an densities of k-uniform hypergraphs, 2026. arXiv:2605.15105

    arXiv 2026

  2. [20]

    Lamaison

    A. Lamaison. Palettes determine uniform Tur´ an density, 2024. arXiv:2408.09643

    arXiv 2024

  3. [1]

    Baber and J

    R. Baber and J. Talbot. Hypergraphs do jump.Combin. Probab. Comput., 20(2):161–171, 2011

    2011

  4. [2]

    Bilu and N

    Y. Bilu and N. Linial. Lifts, discrepancy and nearly optimal spectral gap.Combinatorica, 26(5):495– 519, 2006

    work page 2006

  5. [3]

    Buci´ c, J

    M. Buci´ c, J. W. Cooper, D. Kr´ aˇl, S. Mohr, and D. Munh´ a Correia. Uniform Tur´ an density of cycles. Trans. Amer. Math. Soc., 376(7):4765–4809, 2023

    work page 2023

  6. [4]

    P. Erd˝ os. On extremal problems of graphs and generalized graphs.Israel J. Math., 2:183–190, 1964. 17

    work page 1964

  7. [5]

    Erd˝ os and M

    P. Erd˝ os and M. Simonovits. A limit theorem in graph theory.Studia Sci. Math. Hungar., 1:51–57, 1966

    1966

  8. [6]

    Erd˝ os and V

    P. Erd˝ os and V. T. S´ os. On Ramsey-Tur´ an type theorems for hypergraphs.Combinatorica, 2(3):289– 295, 1982

    work page 1982

Show all 43 references
  1. [7]

    Erd˝ os and A

    P. Erd˝ os and A. H. Stone. On the structure of linear graphs.Bull. Amer. Math. Soc., 52:1087–1091, 1946

    1946

  2. [8]

    Frankl, Y

    P. Frankl, Y. Peng, V. R¨ odl, and J. Talbot. A note on the jumping constant conjecture of Erd˝ os.J. Combin. Theory Ser. B, 97(2):204–216, 2007

    2007

  3. [9]

    Frankl and V

    P. Frankl and V. R¨ odl. Hypergraphs do not jump.Combinatorica, 4(2-3):149–159, 1984

    1984

  4. [10]

    F¨ uredi

    Z. F¨ uredi. Tur´ an type problems. InSurveys in combinatorics, 1991 (Guildford, 1991), volume 166 of London Math. Soc. Lecture Note Ser., pages 253–300. Cambridge Univ. Press, Cambridge, 1991

    1991

  5. [11]

    Garbe, D

    F. Garbe, D. Kr´ al’, and A. Lamaison. Hypergraphs with minimum positive uniform Tur´ an density. Israel J. Math., 259(2):701–726, 2024

    2024

  6. [12]

    Glebov, D

    R. Glebov, D. Kr´ al’, and J. Volec. A problem of Erd˝ os and S´ os on 3-graphs.Israel J. Math., 211(1):349–366, 2016

    2016

  7. [13]

    W. T. Gowers. Quasirandomness, counting and regularity for 3-uniform hypergraphs.Combin. Probab. Comput., 15(1-2):143–184, 2006

    2006

  8. [14]

    C. Grosu. On the algebraic and topological structure of the set of Tur´ an densities.J. Combin. Theory Ser. B, 118:137–185, 2016

    2016

  9. [15]

    Katona, T

    G. Katona, T. Nemetz, and M. Simonovits. On a problem of Tur´ an in the theory of graphs.Mat. Lapok, 15:228–238, 1964

    1964

  10. [16]

    P. Keevash. Hypergraph Tur´ an problems. InSurveys in combinatorics 2011, volume 392 ofLondon Math. Soc. Lecture Note Ser., pages 83–139. Cambridge Univ. Press, Cambridge, 2011

    2011

  11. [17]

    D. King, S. Piga, M. Sales, and B. Sch¨ ulke. On possible uniform Tur´ an densities, 2025. arXiv:2504.21220

    2025 arXiv

  12. [18]

    D. King, M. Sales, and B. Sch¨ ulke. Lagrangians are attained as uniform Tur´ an densities, 2024. arXiv:2412.07297

    2024 arXiv

  13. [19]

    Kr´ al’, F

    D. Kr´ al’, F. Kuˇ cer´ ak, A. Lamaison, and G. Tardos. Uniform Tur´ an density—palette classification,

  14. [22]

    Liu and D

    X. Liu and D. Mubayi. The number 4/9 is a non-jump for 3-graphs, 2026. arXiv:2605.13567

    2026 arXiv

  15. [23]

    Liu and O

    X. Liu and O. Pikhurko. Intervals of hypergraph Tur´ an densities, 2026. arXiv:2605.25914

    2026 arXiv

  16. [24]

    Lo and K

    A. Lo and K. Markstr¨ om.ℓ-degree Tur´ an density.SIAM J. Discrete Math., 28(3):1214–1225, 2014

    2014

  17. [25]

    McDiarmid

    C. McDiarmid. On the method of bounded differences. InSurveys in Combinatorics, pages 148–188. Cambridge University Press, 1989

    1989

  18. [26]

    Mubayi and Y

    D. Mubayi and Y. Zhao. Co-degree density of hypergraphs.J. Combin. Theory Ser. A, 114(6):1118– 1132, 2007

    2007

  19. [27]

    Nagle, V

    B. Nagle, V. R¨ odl, and M. Schacht. The counting lemma for regulark-uniform hypergraphs.Random Structures Algorithms, 28(2):113–179, 2006

    2006

  20. [28]

    Y. Peng. Non-jumping numbers for 4-uniform hypergraphs.Graphs Combin., 23(1):97–110, 2007

    2007

  21. [29]

    Y. Peng. Using Lagrangians of hypergraphs to find non-jumping numbers. II.Discrete Math., 307(14):1754–1766, 2007

    2007

  22. [30]

    Y. Peng. Using Lagrangians of hypergraphs to find non-jumping numbers. I.Ann. Comb., 12(3):307– 324, 2008. 18

    2008

  23. [31]

    Y. Peng. On jumping densities of hypergraphs.Graphs Combin., 25(5):759–766, 2009

    2009

  24. [32]

    Pikhurko

    O. Pikhurko. On possible Tur´ an densities.Israel J. Math., 201(1):415–454, 2014

    2014

  25. [33]

    C. Reiher. Extremal problems in uniformly dense hypergraphs.European J. Combin., 88:103117, 22, 2020

    2020

  26. [34]

    Reiher, V

    C. Reiher, V. R¨ odl, and M. Schacht. Embedding tetrahedra into quasirandom hypergraphs.J. Combin. Theory Ser. B, 121:229–247, 2016

    2016

  27. [35]

    Reiher, V

    C. Reiher, V. R¨ odl, and M. Schacht. Hypergraphs with vanishing Tur´ an density in uniformly dense hypergraphs.J. Lond. Math. Soc. (2), 97(1):77–97, 2018

    2018

  28. [36]

    Reiher, V

    C. Reiher, V. R¨ odl, and M. Schacht. On a generalisation of Mantel’s theorem to uniformly dense hypergraphs.Int. Math. Res. Not. IMRN, 2018(16):4899–4941, 2018

    2018

  29. [37]

    Reiher, V

    C. Reiher, V. R¨ odl, and M. Schacht. On a Tur´ an problem in weakly quasirandom 3-uniform hypergraphs.J. Eur. Math. Soc. (JEMS), 20(5):1139–1159, 2018

    2018

  30. [38]

    R¨ odl and M

    V. R¨ odl and M. Schacht. Regular partitions of hypergraphs: counting lemmas.Combin. Probab. Comput., 16:887–901, 2007

    2007

  31. [39]

    R¨ odl and M

    V. R¨ odl and M. Schacht. Regular partitions of hypergraphs: regularity lemmas.Combin. Probab. Comput., 16:833–885, 2007

    2007

  32. [40]

    R¨ odl and J

    V. R¨ odl and J. Skokan. Regularity lemma fork-uniform hypergraphs.Random Structures Algorithms, 25(1):1–42, 2004

    2004

  33. [41]

    M. Schacht. Restricted problems in extremal combinatorics. InICM—International Congress of Mathematicians. Vol. 6. Sections 12–14, pages 4646–4658. EMS Press, Berlin, 2023

    2023

  34. [42]

    Sidorenko

    A. Sidorenko. What we know and what we do not know about Tur´ an numbers.Graphs Combin., 11(2):179–199, 1995

    1995

  35. [43]

    P. Tur´ an. Eine Extremalaufgabe aus der Graphentheorie.Mat. Fiz. Lapok, 48:436–452, 1941. 19

    1941

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.