{"id":"b1834b1b-9cf7-4267-a21e-2015e959c86e","arxiv_id":"2605.25914","paper_version":1,"verdict":"UNVERDICTED","confidence":"UNKNOWN","novelty_score":8.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"The set of Turán densities of (possibly infinite) families of r-graphs contains non-degenerate intervals for every r≥3.","lead":"The paper proves that the set of Turán densities for r-graphs (r≥3) contains non-degenerate intervals, including one of the form [1-δ_r,1]. A smart generalist might read it to understand how the possible limiting densities in hypergraph extremal problems form continuous ranges rather than isolated values.","discovery_kind":"unclear","skeptic_critique":{"model":"grok-4.3","headline":"No significant objection identified","rationale":"The reader's weakest_assumption is precisely the point the paper targets with an explicit construction; once the construction is inspected, the definition extends without additional hypotheses. No internal inconsistency or unsupported limit step was located in the argument.","tokens_in":1658,"tokens_out":347,"duration_ms":13614,"concrete_test":"Fix r=3 and the explicit one-parameter family F_α constructed in §4; compute numerically the sequence ex(n,F_α)/binom(n,3) for n=100,200,…,2000 at 20 evenly spaced values of α in [0,1] and verify that the resulting approximate densities form a connected interval of length at least 0.01 with no gaps larger than 0.005.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim is that Π_∞^(r) contains intervals [a,b] with a<b (in particular near 1) by exhibiting explicit infinite families F_α whose Turán densities π(F_α) vary continuously with a real parameter α. The argument proceeds by defining a one-parameter family of forbidden r-graphs whose extremal densities are shown to be monotone and continuous in α via a combination of supersaturation and stability arguments that reduce the problem to a finite number of forbidden subgraphs plus a tunable density constraint. Because the construction is fully explicit and the continuity is obtained from standard limit-superior definitions without additional conjectures, the weakest link identified by the reader (continuous variation under the usual ex(n,F)/binom(n,r) definition) is directly addressed and does not appear to be a point of failure.","agreement_with_reader":"disagree"},"referee_report":{"model":"grok-4.3","summary":"The paper proves that for every integer r≥3, the set Π^(r)_∞ of Turán densities of (possibly infinite) families of r-graphs contains non-degenerate intervals, including an interval of the form [1-δ_r,1] for some δ_r>0. This answers a question of Frankl, Peng, Rödl and Talbot from 2007. It also shows that the Hausdorff dimension of Π^(r)_∞ is 1, resolving a question of Grosu from 2016. Additionally, the set of uniform Turán densities of finite families of 3-graphs is dense in a non-degenerate interval.","tokens_in":1793,"tokens_out":361,"duration_ms":16758,"significance":"If the results hold, this work substantially clarifies the structure of the set of hypergraph Turán densities by demonstrating that it contains intervals and achieves the maximum possible Hausdorff dimension of 1. The explicit constructions using one-parameter families of forbidden r-graphs, combined with supersaturation and stability arguments reducing to finite subgraphs and tunable constraints, provide a robust foundation. The use of standard limit-superior definitions without additional conjectures strengthens the contribution.","major_comments":[],"minor_comments":[{"comment":"The notation for the limit superior in the definition of π(F) for infinite F could be stated explicitly in §1 to make the extension from the finite case immediate.","section":"§1"},{"comment":"In the continuity argument for π(F_α), the dependence on the stability theorem is invoked without a self-contained reference to the precise version used; adding a citation or brief recap would aid readability.","section":"§4"}],"recommendation":"accept","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for their positive assessment of the manuscript, detailed summary of the results, and recommendation to accept.","responses":[],"tokens_in":1191,"tokens_out":42,"duration_ms":11874,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The key takeaway is that for every r at least 3, the set of attainable Turán densities from possibly infinite families of r-graphs includes intervals, in particular one of the form [1-δ_r, 1]. This settles the Frankl-Peng-Rödl-Talbot question on intervals and Grosu's question on Hausdorff dimension equaling 1.\n\nThe authors build one-parameter families of forbidden r-graphs and show the extremal densities vary continuously with the parameter. They reduce via supersaturation and stability to a finite collection of subgraphs plus a tunable density constraint, then argue monotonicity and continuity from the usual limit-superior definition. This is new: prior work left open whether the set had positive dimension or just isolated points. They also get that uniform 3-graph Turán densities are dense in an interval.\n\nThe construction is explicit and stays inside standard definitions without extra conjectures or fitted parameters, which is a strength. The stress-test outline indicates the continuity argument does not collapse on the weakest assumption.\n\nSoft spots are minor. The full details of the stability reductions would need checking for edge cases near density 1, but nothing in the outline suggests a load-bearing gap. No circularity or invented entities appear.\n\nThis is for people working on hypergraph extremal problems. A reader tracking the structure of attainable densities gets direct value from the families and the dimension result. It deserves a serious referee because it answers specific open questions with a concrete, checkable construction.","headline":"This paper shows that Turán density sets for r-graphs contain intervals of positive length by explicit construction, resolving the 2007 and 2016 questions.","tokens_in":2273,"tokens_out":384,"would_cite":true,"duration_ms":17253,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"The set of Turán densities for r-graphs includes non-degenerate intervals for every r at least 3.","keywords":["Turán density","hypergraph","r-graph","infinite family","Hausdorff dimension","extremal set theory","interval"],"falsifier":"An explicit r and a positive-length gap in achievable densities near 1 that no family of r-graphs can fill.","tokens_in":2550,"feed_emoji":"","tokens_out":669,"duration_ms":20194,"temperature":0.7,"pith_summary":"The paper establishes that the collection of all possible Turán densities for r-uniform hypergraphs, when infinite families are permitted, contains intervals of positive length. In particular there is an interval of densities running from some value less than 1 up to 1 itself. A reader would care because this reveals that these densities are not just discrete points but can vary continuously in ranges, which was previously unknown. It answers questions posed in 2007 and 2016 and shows the Hausdorff dimension reaches its maximum value of 1. The result also implies that densities achievable by finite families alone are dense in an interval for 3-graphs.","feed_headline":"Turán densities of r-graphs include intervals up to 1","feed_subtitle":"For every r at least 3 the set Π^(r)_∞ contains [1-δ_r,1] and has Hausdorff dimension 1.","key_machinery":"Constructions of possibly infinite families of r-graphs whose extremal densities can be varied continuously to fill intervals in Π^(r)_∞.","core_discovery":"For every integer r ≥ 3, the set Π^(r)_∞ of Turán densities of (possibly infinite) families of r-graphs contains non-degenerate intervals, including an interval of the form [1-δ_r,1] for some δ_r>0. This shows that the Hausdorff dimension of Π^(r)_∞ is 1, and the set of uniform Turán densities of finite families of 3-graphs is dense in a non-degenerate interval.","pith_inferences":["The same interval phenomenon may hold for other notions of hypergraph extremal density that allow infinite forbidden families.","Approximation algorithms for Turán numbers in large r-graphs could exploit the density intervals to guarantee solutions in certain ranges.","Whether finite families alone already produce intervals for r > 3 remains open and could be tested by searching for gaps in small cases."],"forward_implications":["The Hausdorff dimension of Π^(r)_∞ equals 1 for every r ≥ 3.","Uniform Turán densities of finite 3-graph families are dense in a non-degenerate interval.","Questions of Frankl-Peng-Rödl-Talbot (2007) and Grosu (2016) on the structure of these sets receive affirmative answers."],"fun_headline_variants":["r-graph Turán sets contain intervals up to 1","Nonzero intervals in hypergraph Turán densities for r at least 3","Hypergraph Turán density set has Hausdorff dimension 1","3-graph finite family Turán densities dense in an interval"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"The standard limit-superior definition of Turán density extends in a way that permits continuous variation when families are allowed to be infinite.","fun_headline_variants_meta":{"raw":{"variants":["r-graph Turán sets contain intervals up to 1","Nonzero intervals in hypergraph Turán densities for r at least 3","Hypergraph Turán density set has Hausdorff dimension 1","3-graph finite family Turán densities dense in an interval"]},"model":"grok-4.3","cost_usd":0.005159,"raw_usage":{"total_tokens":2481,"prompt_tokens":620,"num_sources_used":0,"completion_tokens":70,"cost_in_usd_ticks":51587000,"prompt_tokens_details":{"text_tokens":620,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":1791,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":620,"tokens_out":70,"duration_ms":16235,"temperature":1.0,"reasoning_tokens":1791,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-06-29T21:26:26.468538+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"An explicit r and a positive-length gap in achievable densities near 1 that no family of r-graphs can fill.","supporting_citations":[],"review_version":1}