{"id":"9a7572b5-08f1-4e97-9023-8239686b2239","arxiv_id":"2508.20696","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For every r≥3 there exist r-uniform hypergraphs whose uniform Turán density is 1/4, and others whose uniform Turán density is binom(r,2)^{-binom(r,2)}; the r≥5 cases are the first explicit non-zero values.","lead":"An extremal combinatorics paper proves, for every hypergraph uniformity r≥3, that there exist r-uniform hypergraphs with uniform Turán density exactly 1/4 and exactly binom(r,2)^{-binom(r,2)}. These are the first non-zero uniform Turán densities known for uniformities r≥5, a gap that had been open since the 1980s.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Lemma 15's proof drops a factor of q: the bound should be |W_{i,j}| ≥ (a_{i,j}/q)|V_{a,b}|, so the intersection argument needs Σa > q, not Σa > 1; as printed this leaves a gap in Theorem 11.","rationale":"The reader's conditional verdict is appropriate. The central theorems are plausible and the lower-bound constructions in Sections 4 and 7 are sound; the hierarchical application of the Rödl–Schacht regularity and counting lemmas in Sections 6–7 follows the standard pattern, and I do not see a concrete parameter mismatch there. The real load-bearing defect is inside Lemma 15, where the final contradiction relies on an inequality off by a factor of q. The reader mentioned this as a scaling issue in the rationale but placed the weakest assumption on Theorems 17–18; I would promote the Lemma 15 gap to primary because it is a concrete algebraic error in the proof of the density theorem, not merely a reliance on an external lemma. The Section 8 assertion about the (k,4)-reduced graph counterexample is indeed unproved, but it belongs to the concluding remarks and does not affect Theorems 10–13. If the author corrects Lemma 15 and supplies the missing factor q, the main claim likely stands; as printed, the reader's CONDITIONAL verdict is the right one, so I recommend no change in verdict.","tokens_in":24414,"tokens_out":21393,"duration_ms":195100,"concrete_test":"Recompute Lemma 15 with c=binom(r,2) and q=ceil(2^c/ε): (1) write |W_{i,j}|=(a_{i,j}+o(1))/q |V_{a,b}| from the profile definition; (2) redo the AM-GM step from ∏(a_{i,j}+1)/q ≥ π_r+ε to obtain the exact lower bound Σ a_{i,j} ≥ c(q(π_r+ε)^{1/c}-1); (3) check whether this lower bound exceeds q (equivalently, whether q(c(π_r+ε)^{1/c}-1)>c). If yes, Lemma 15 can be repaired by replacing the two wrong factor-q lines; if no, the claimed contradiction requires a new argument and Theorem 11's upper bound is unproved.","verdict_should_be":"UNCHANGED","load_bearing_attack":"In the proof of Lemma 15, a_{i,j} = floor(q |V_{t_i,t_j}∩W|/|V_{t_i,t_j}|), so for W_{i,j}=V_{a,b}∩W the correct consequence is |W_{i,j}| ≥ (a_{i,j}/q)|V_{a,b}|. The text instead states |W_{i,j}| ≥ a_{i,j}|V_{a,b}|, inflating each set by a factor q. To force W_{i,j}∩W_{i',j'}≠∅ one therefore needs Σ a_{i,j} > q. The displayed AM-GM chain, however, concludes with a bound equivalent to Σ a_{i,j} > 1 (the factor q is also dropped in passing from c(q∏((a+1)/q)^{1/c}-1) to c((π_r+ε)^{1/c}-1/q)). Thus the contradiction in Lemma 15 is not justified as printed. This is load-bearing: Lemma 15 is the only source of the inconsistent descriptive sequence σ needed in Step 5 of the upper-bound proof of Theorem 11, and hence for the claimed exact values π_u(F)=π_r for r≥4. The gap appears repairable: with c=binom(r,2) and q=ceil(2^c/ε), the corrected AM-GM lower bound Σ a ≥ c(q(π_r+ε)^{1/c}-1) does exceed q, so restoring the missing factor q would make the intersection argument work. But the manuscript currently contains two mutually masking scaling slips rather than a valid proof.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"This paper studies the uniform Turán density π_u(F) of r-uniform hypergraphs. The main results are Theorem 2 and Theorem 3, asserting that for every r≥3 there exists an r-graph F with π_u(F)=1/4 and an r-graph F with π_u(F)=binom(r,2)^{-binom(r,2)}. These are derived from two structural theorems: Theorem 10 identifies a class of quasi-linear, head-tail-mixing r-graphs with π_u=1/4, and Theorem 11 identifies a class of quasi-linear, inconsistent r-graphs with π_u=π_r. The existence of such hypergraphs is established in Theorems 12 and 13 via explicit constructions from nowhere-empty linear hypergraphs. The upper-bound proofs use the hypergraph regularity lemma and the associated counting lemma, applied through auxiliary reduced hypergraphs. The paper concludes with a conjecture on the minimum positive value of π_u and a discussion of the limitations of palette characterizations for r≥4.","tokens_in":24677,"tokens_out":19264,"duration_ms":150027,"significance":"The paper is significant: it provides the first explicit values of the uniform Turán density for all uniformities r≥4, giving two distinct values (1/4 and binom(r,2)^{-binom(r,2)}) for every r. The lower-bound constructions in Theorems 12 and 13 are concrete and fully verified, and the paper does not rely on fitting parameters to a predetermined answer. The conceptual framework (quasi-linear hypergraphs, descriptive sequences, head-tail mixing) is natural and likely to be reused. The conjectures on the minimum positive value and on the zero-density characterization are well posed, and the counterexample to the palette approach for r=4 is a valuable caution. However, because the upper-bound proof of Theorem 11 rests on Lemma 15, whose printed proof contains a scaling error, the full set of claims is conditional on a repair of that lemma.","major_comments":[{"comment":"The proof of Lemma 15 as printed contains a scaling error that invalidates the contradiction argument. From the definition a_{i,j} = floor(q |V_{t_i,t_j} ∩ W| / |V_{t_i,t_j}|), the correct lower bound for the set W_{i,j} ⊆ V_{a,b} is |W_{i,j}| ≥ (a_{i,j}/q)|V_{a,b}|, not |W_{i,j}| ≥ a_{i,j}|V_{a,b}| as claimed in the paragraph 'Let W_{i,j} be the set...'. Therefore the intersection argument requires Σ a_{i,j} > q, not Σ a_{i,j} > 1. The displayed AM-GM chain concludes with a bound equivalent to Σ a_{i,j} > 1: the factor q is dropped in passing from C(q∏((a_{i,j}+1)/q)^{1/C} − 1) to C((π_r+ε)^{1/C} − 1/q). The contradiction in Lemma 15 is thus not justified. This is load-bearing because Lemma 15 is the only source of the inconsistent descriptive sequence σ used in Step 5 of the upper-bound proof of Theorem 11, and hence for the claimed exact value π_u(F) = π_r for r≥4. The gap appears repairable: with C = binom(r,2) and q = ceil(2^C/ε), the corrected AM-GM lower bound Σ a ≥ C(q(π_r+ε)^{1/C} − 1) = q(1+ε/π_r)^{1/C} − C exceeds q, so restoring the missing factor q would justify the intersection argument. The proof should be rewritten accordingly.","section":"Section 5, Lemma 15"}],"minor_comments":[{"comment":"In the definition of the lower-bound construction for Theorem 11, the condition 'for all 1≤i<j≤n' should read 'for all 1≤i<j≤r'.","section":"Section 7.3"},{"comment":"The definition of μ as '4rr/ε' should be '4r^r/ε'.","section":"Section 7.2"},{"comment":"The sentence 'we can finish as in the proof of Theorem 10' would benefit from an explicit note that the two Z entries of the descriptive sequence σ play the same role as the head-tail pair in Theorem 10, so the well-definedness of the functions f_i carries over without change.","section":"Section 7.3"},{"comment":"There are a number of typographical errors, including 'tehnique' (Section 1), 'desctiptive' (Section 4), 'important role important role' (Section 3), and the unneeded comma at the end of Theorem 12. These should be corrected.","section":"Throughout"},{"comment":"The expressions 'q3' and '32r−2+1' should be 'q^3' and '3^{2r-2}+1'.","section":"Section 5, Lemma 15"}],"recommendation":"major_revision","confidential_remarks":"The paper is by the same author as reference [11], which is used for the r=3 base cases; this is a normal dependency and not a circularity issue. The central claims are plausible and the gap in Lemma 15 is local and repairable, but the proof as submitted is not complete. I recommend major revision rather than rejection, provided the author restores the missing factor q in Lemma 15 and verifies that the corrected bound yields Σ a_{i,j} > q."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: this is the paper that finally gets uniform Turán density off zero for r-graphs with r≥5. For every r≥3 it gives quasi-linear r-graphs with π_u=1/4 and with π_u=binom(r,2)^{-binom(r,2)}; for r≥5 neither value was previously known, and the π_r value matches the conjectured minimum positive value, so this is a genuine landmark.\n\nThe lower bounds are clean and fully proved: palettes—random colorings of pairs—that are locally d-dense and F-free by construction, with no parameter fitting. The upper-bound strategy is the right generalization of Reiher's reduced hypergraph method: build a (k,r)-reduced graph from the second layer of the regularity partition, find a large index set whose 2r-2-tuples all admit the right descriptive sequence, then use the counting lemma with the sequence as a template. The parameter hierarchy is heavy, but I did not see any hidden circularity; the self-citations are to the r=3 base cases and the palette theorem, and the r≥4 arguments stand on their own.\n\nThe soft spot is real and it is in Lemma 15. As printed, the proof drops a factor q. The profile entry a_{i,j} is floor(q|V∩W|/|V|), so the correct consequence is |W_{i,j}| ≥ (a_{i,j}/q)|V_{a,b}|, not |W_{i,j}| ≥ a_{i,j}|V_{a,b}|. To force an intersection you then need Σa_{i,j} > q, and the AM-GM line only gives Σa > 1. The same proof also loses q when passing from c(q(∏(a+1)/q)^{1/c}-1) to c((π_r+ε)^{1/c}-1/q). The slips roughly cancel in the direction of being too weak. I checked the intended fix: with c=binom(r,2) and q=ceil(2^c/ε), the corrected lower bound is Σa ≥ q(1+ε/π_r)^{1/c}-c, which is comfortably bigger than q. So this is repairable, but as written Lemma 15 is not proved, and Lemma 15 is the sole source of the inconsistent descriptive sequence in the upper bound for Theorem 11. A referee has to ask for this to be rewritten.\n\nSmaller point: the concluding example of a (k,4)-reduced graph with no positive-density palette blowup is asserted with a one-line sketch. It is not needed for the main theorems, but if it stays in the paper it needs a proof.\n\nVerdict: important, technically serious, and publishable after the Lemma 15 fix. I would send it to a top combinatorics journal and ask for a careful revision; I would not desk reject.","headline":"The first non-zero uniform Turán densities for every r≥5 are here, with a real but repairable gap in Lemma 15.","tokens_in":25334,"tokens_out":6721,"would_cite":true,"duration_ms":61805,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05C65","05C35","05D10","05D40"],"pacs":[],"model":"deepseek-v4-flash","headline":"For every $r\\ge 3$, there are $r$-uniform hypergraphs with uniform Tur\\'an density exactly $1/4$ and exactly $\\binom{r}{2}^{-\\binom{r}{2}}$.","keywords":["uniform Turan density","hypergraphs","quasi-linear hypergraphs","descriptive sequences","reduced hypergraphs","hypergraph regularity lemma","extremal combinatorics","Ramsey theory"],"falsifier":"For $r=4$ and $\\varepsilon=0.01$, searching for a reduced hypergraph of density $0.26$ whose large index sets all miss the sequence $XX\\ldots XZZYY\\ldots Y$ would test Lemma 14; finding one would refute the $1/4$ upper bound.","tokens_in":1831,"feed_emoji":"🧮","tokens_out":2804,"duration_ms":107736,"temperature":0.7,"pith_summary":"The paper establishes the first explicit values of the uniform Tur\\'an density---the density threshold above which every large-enough locally dense $r$-uniform hypergraph is forced to contain a copy of a given pattern $F$---for all uniformities $r\\ge 3$. It proves that for every $r$, some $r$-graph has uniform Tur\\'an density exactly $1/4$ and some $r$-graph has uniform Tur\\'an density exactly $\\binom{r}{2}^{-\\binom{r}{2}}$. Before this work, no non-zero uniform Tur\\'an density was known for any $r\\ge 5$, so the set of attainable values was effectively unexplored outside 3-graphs. The proof isolates a structural class of hypergraphs (quasi-linear hypergraphs with controlled twin-pair intersections) and shows that two prescribed descriptive sequences force the density to take these two values exactly.","feed_headline":"Exact uniform Turán densities now exist for every r≥3","feed_subtitle":"One construction hits exactly 1/4; another hits π_r, the conjectured positive minimum, for every r≥3.","key_machinery":"The machinery that carries the argument is the quasi-linear hypergraph, an $r$-graph in which every edge has a unique twin edge sharing exactly two vertices while all other edge intersections have size at most one, together with descriptive sequences: strings of $2r-2$ letters $X,Y,Z$ (with $r-2$ of each of $X$ and $Y$, and two $Z$'s) that record the order in which the vertices of a twin pair appear. A twin pair described by $XX\\ldots XZZYY\\ldots Y$ is one in which the head (first two vertices) of one edge is the tail (last two vertices) of the other, and head-tail-mixing means every vertex order contains such a coincidence; the inconsistent sequences are those in which the shared pair plays different numeric roles inside the two edges. The density theorems are proved by passing through reduced hypergraphs, auxiliary graphs formed from the second layer of the regularity partition, and using two Ramsey-type lemmas (Lemmas 14 and 15) that force large sets of indices in which every relevant tuple admits the required descriptive sequence. The hypergraph regularity lemma and counting lemma then upgrade that combinatorial certificate to an actual subgraph copy in the original dense hypergraph.","core_discovery":"The central assertion is that exact uniform Tur\\'an density is governed by the relative order of vertices in twin pairs of edges. For every $r\\ge 3$, every quasi-linear, head-tail-mixing $r$-graph $F$ that admits the descriptive sequence $XX\\ldots XZZYY\\ldots Y$ has $\\pi_u(F)=1/4$, and every quasi-linear, inconsistent $r$-graph $F$ that admits all inconsistent descriptive sequences of order $r$ has $\\pi_u(F)=\\binom{r}{2}^{-\\binom{r}{2}}$. Such hypergraphs are shown to exist for every $r$, so the values $1/4$ and $\\pi_r$ are genuine uniform Tur\\'an densities in every uniformity. The lower bounds come from explicit random pair-coloring constructions producing locally dense $F$-free hypergraphs; the upper bounds use the hypergraph regularity lemma and counting lemma to show that any locally $(d+\\varepsilon)$-dense hypergraph must contain $F$.","pith_inferences":["If Conjecture 20 is true, Theorem 3 implies that the set of positive uniform Tur\\'an densities has a jump at exactly $\\pi_r$ for every $r$, matching the known 3-graph jump at $1/27$.","The Section 8 counterexample to the palette-blowup lemma for 4-graphs suggests that a full palette characterization of uniform Tur\\'an density may be impossible for $r\\ge 4$; the descriptive-sequence method here bypasses that obstruction, so a promising next step is to ask whether the theorems extend to hypergraphs with larger edge intersections.","The existence proof for the inconsistent case builds hypergraphs on multidimensional grids via lexicographic Ramsey theory; this hints that explicit extremal hypergraphs for $\\pi_r$ may be constructible with far fewer vertices than the nowhere-empty random construction suggests."],"forward_implications":["For every $r\\ge 3$ the value $1/4$ occurs as a uniform Tur\\'an density, giving the first explicit non-zero values for $r\\ge 5$.","The value $\\binom{r}{2}^{-\\binom{r}{2}}$ is attained for every $r$; if the paper's Conjecture 20 is correct, this number is the minimum positive uniform Tur\\'an density for $r$-graphs.","All $r$-graphs in the head-tail-mixing class described by $XX\\ldots XZZYY\\ldots Y$ are density-forcing at $1/4$: every locally $(1/4+\\varepsilon)$-dense $r$-graph contains every such $F$.","The lower-bound constructions are simple random palettes, so the extremal examples are cheap to describe and essentially explicit.","The two results unify previously separate 3-graph and 4-graph statements into a single uniformity-independent theorem."],"supporting_citations":[{"why":"Supplies the hypergraph regularity lemma (Theorem 17), the partition hierarchy on which the upper-bound arguments rest.","marker":"[21]"},{"why":"Supplies the hypergraph counting lemma (Theorem 18) that converts regularity certificates into subgraph copies.","marker":"[20]"},{"why":"Introduces reduced hypergraphs, generalized here to $(k,r)$-reduced graphs, the auxiliary structure connecting local density to descriptive sequences.","marker":"[15]"},{"why":"Ramsey's theorem is used to find monochromatic cliques in the auxiliary colorings behind Lemmas 14 and 15.","marker":"[14]"},{"why":"Provides the multidimensional lexicographic Ramsey statement (Lemma 6) that powers the existence proof for inconsistent descriptive sequences.","marker":"[6]"},{"why":"Supplies the packing theorem used to find large families of almost-disjoint $r$-tuples in the lower-bound density arguments.","marker":"[18]"},{"why":"Establishes the 3-graph case $\\pi_u(K_4^{3-})=1/4$ that Theorem 2 generalizes to every $r$.","marker":"[8]"},{"why":"Provides the earlier 4-graph example with uniform Tur\\'an density $1/4$ that Theorem 2 also generalizes.","marker":"[9]"},{"why":"Constructs the 3-graph with minimum positive uniform Tur\\'an density $1/27$ that Theorem 3 generalizes to $\\pi_r$.","marker":"[7]"}],"fun_headline_variants":["First exact Turán densities for all r≥3 hypergraphs","Explicit Turán densities now proven for every r≥3","Two new exact Turán density values, valid for each r≥3","Uniform Turán density: first exact values for all r≥3","Exact π_u: 1/4 and π_r achieved for every r≥3"],"cache_read_input_tokens":27264,"weakest_assumption_plain":"The upper-bound proofs assume that the cited hypergraph regularity and counting lemmas work with the exact chain of smallness conditions chosen in Section 7; if those lemmas fail at that level of precision, the claim that every sufficiently dense locally dense hypergraph contains $F$ collapses.","fun_headline_variants_meta":{"raw":{"variants":["First exact Turán densities for all r≥3 hypergraphs","Explicit Turán densities now proven for every r≥3","Two new exact Turán density values, valid for each r≥3","Uniform Turán density: first exact values for all r≥3","Exact π_u: 1/4 and π_r achieved for every r≥3"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000411,"raw_usage":{"total_tokens":2147,"prompt_tokens":981,"completion_tokens":1166,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":597,"completion_tokens_details":{"reasoning_tokens":1071}},"tokens_in":597,"tokens_out":1166,"duration_ms":9705,"temperature":1.0,"reasoning_tokens":1071,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-15T16:43:25.605319+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"For $r=4$ and $\\varepsilon=0.01$, searching for a reduced hypergraph of density $0.26$ whose large index sets all miss the sequence $XX\\ldots XZZYY\\ldots Y$ would test Lemma 14; finding one would refute the $1/4$ upper bound.","supporting_citations":[{"cited_title":"R¨ odl and M","cited_arxiv_id":null,"evidence_quote":"Supplies the hypergraph regularity lemma (Theorem 17), the partition hierarchy on which the upper-bound arguments rest."},{"cited_title":"R¨ odl and M","cited_arxiv_id":null,"evidence_quote":"Supplies the hypergraph counting lemma (Theorem 18) that converts regularity certificates into subgraph copies."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Introduces reduced hypergraphs, generalized here to $(k,r)$-reduced graphs, the auxiliary structure connecting local density to descriptive sequences."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Ramsey's theorem is used to find monochromatic cliques in the auxiliary colorings behind Lemmas 14 and 15."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the multidimensional lexicographic Ramsey statement (Lemma 6) that powers the existence proof for inconsistent descriptive sequences."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the packing theorem used to find large families of almost-disjoint $r$-tuples in the lower-bound density arguments."},{"cited_title":"Glebov, J","cited_arxiv_id":null,"evidence_quote":"Establishes the 3-graph case $\\pi_u(K_4^{3-})=1/4$ that Theorem 2 generalizes to every $r$."},{"cited_title":"Gunderson and J","cited_arxiv_id":null,"evidence_quote":"Provides the earlier 4-graph example with uniform Tur\\'an density $1/4$ that Theorem 2 also generalizes."},{"cited_title":"Garbe, D","cited_arxiv_id":null,"evidence_quote":"Constructs the 3-graph with minimum positive uniform Tur\\'an density $1/27$ that Theorem 3 generalizes to $\\pi_r$."}],"review_version":2}