{"id":"cd1dd98e-e3b3-433f-894d-48dd33da7cf4","arxiv_id":"2608.01568","paper_version":1,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":8.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"Sharp edges in linear crown-free hypergraphs are exactly the common lines of k-1 glued projective planes, and this rigidity yields a strict improvement to the extremal edge bound.","lead":"This paper proves that the only way an edge can attain the sharp lower bound in a linear crown-free hypergraph is if it sits inside several projective planes glued along that edge. It then uses that rigidity to improve the best known edge-count bound for all uniformities, a gap that shrinks like one over r squared.","discovery_kind":"unification","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified: the central classification and repulsion arguments are internally consistent; only a minor omitted justification in Theorem 1.2 is readily repairable.","rationale":"The reader's verdict of ACCEPT appears correct. I examined the main proof chain: Lemma 2.1 and Proposition 2.2 translate crown-freeness into a rainbow-matching condition; Lemma 4.2 and Lemma 4.3 establish exact pair degree; Lemmas 4.5 and 4.6 give a coherent affine block decomposition; Theorem 4.7 and Theorem 1.1 yield the projective-plane classification. The repulsion proof has only a minor elision in the application of Lemma 5.1 to Π2, but the missing justification is easily supplied and does not affect the conclusion. The global defect envelope in Proposition 6.1 is sound, the endpoint minimization is correct, and Lemma 6.2 supplies the integral gap exactly when needed. The near-sharp packet localization is intricate, but its inequalities are internally consistent, and the conditional constant-gap theorem is explicitly presented as conditional. The reader's weakest assumption, linearity, is structurally load-bearing but is part of the stated problem setting rather than a vulnerability; I found no separate load-bearing concern. Therefore the verdict should remain unchanged.","tokens_in":18678,"tokens_out":47786,"duration_ms":416659,"concrete_test":"Independently complete the omitted step in Theorem 1.2: prove that each edge g_i chosen outside Π1 cannot meet e, because otherwise it would share two points of Π1 and linearity would force it to be a line of Π1, contradicting its choice; then rerun the line-counting argument for M. If this step cannot be completed, the repulsion theorem requires revision.","verdict_should_be":"UNCHANGED","load_bearing_attack":"After checking the proof chain from the colored matching reformulation through Theorem 4.7, sharp-state repulsion, the defect envelope, and the unconditional coefficient gap, I find no load-bearing gap. The one spot that deserves attention is in the proof of Theorem 1.2: when the proof applies Lemma 5.1 to Π2 to assert that each chosen edge g_i contains at most one point of Π2, it does not explicitly justify that g_i is not a line of Π2. This is true: g_i contains an affine point w_i of Π1 and is chosen outside Π1, so if g_i met e it would share two points of Π1 and would be forced by linearity to be a line of Π1; hence g_i does not meet e, whereas every line of Π2 meets e. Thus the application of Lemma 5.1 is valid. Linearity is indeed the structural foundation, but it is a hypothesis of the problem rather than an unstated assumption. The sharp iff glued projective planes classification, the repulsion count, the packing inequality (8), and the coefficient gaps (15)/(16) all check out. The near-sharp packet theorem is intricate but its estimates are self-consistent, and the conditional constant-gap closure is clearly labelled as conjectural.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"This paper studies linear r-uniform hypergraphs that contain no copy of the k-crown C^r_{1,k}. The main local result is the reciprocal-degree inequality Φ_H(e) ≥ r/D for every edge e, where D = (k-1)(r-1)+1. The paper classifies all equality cases: e is sharp exactly when e and every edge meeting it form t = k-1 projective planes of order q = r-1 whose common intersection is precisely the line e. Around this classification it proves a repulsion theorem (every edge meeting a sharp edge contains at least q-t+2 vertices of degree at most D^-), a strengthened quadratic packing bound, the nonexistence of nonempty D-regular crown-free linear hypergraphs, and unconditional global coefficient gaps strictly smaller than D/r. It also develops a quantitative near-sharp packet localization theorem and a conditional constant-gap closure based on an explicitly stated conjecture. The proofs combine a colored matching reformulation, a matching-blocker inequality, a greedy degree-witness lemma, and finite-geometric classification lemmas.","tokens_in":18868,"tokens_out":40009,"duration_ms":320845,"significance":"If correct, this is a substantial advance in linear Turán theory. The sharp structural classification of equality in the local reciprocal-degree bound is new and is derived rather than assumed, with no reliance on Desarguesian planes. The repulsion and packing estimates are explicit, and the unconditional improvement over Adak's coefficient D/r is significant. The paper carefully separates the unconditional results from the conditional conjecture-based part, and the near-sharp localization is presented with quantitative bounds. The authors also re-prove the local reciprocal-degree inequality rather than importing it as a black box, which strengthens the reliability of the whole chain.","major_comments":[],"minor_comments":[{"comment":"When Lemma 5.1 is applied to Π_2 to conclude that each chosen edge g_i contains at most one point of Π_2, the proof should explicitly verify that g_i is not a line of Π_2. This is true because g_i contains the affine point w_i of Π_1, whereas Π_2 shares only the line e with Π_1 and w_i is not on e. The same one-line justification is also needed for the earlier application of Lemma 5.1 to Π_1. The claim is correct, but the hypothesis of Lemma 5.1 is currently skipped.","section":"§5 (Theorem 1.2)"},{"comment":"The sentence 'Summing (28) over E(K) and using (31) within the component' is imprecise: (31) is an equality for the whole hypergraph, whereas for a single component K one only gets ∑_{e∈E(K)} Φ_H(e) = ∑_{v∈V(K)} deg_K(v)/d_H(v) ≤ |V(K)|. This inequality suffices for the argument, but the equality case, which is used to prove strictness, should be spelled out: equality would force every edge of K to be sharp and d_H(v)=deg_K(v) for every vertex v, making K D-regular and contradicting the first part.","section":"§6 (Corollary 1.5)"},{"comment":"The phrase 'any common point of their outside sets is therefore an additional intersection' is confusing, since two edges from different colors do not share a vertex of e. It should be rephrased to say that a common point of A∈F_i(e) and B∈F_j(e) would be an intersection of the corresponding full edges, and linearity therefore permits at most one such point.","section":"§2 (Lemma 2.1)"},{"comment":"The displayed difference between the coefficients should be D/(r(r(D-1)+1)); the present typesetting appears to show D/r times (r(D-1)+1), which is not the intended quantity. Please correct the formatting.","section":"§6 (after Eq. (17))"},{"comment":"In Lemma 4.2, the sentence 'At any stage, at most s+1≤t colors are either already used or forbidden' is correct only if s is understood as the number of selected sets before the current extension step. As written it could be misread, so a short clarification would help.","section":"§4 (Lemma 4.2)"}],"recommendation":"minor_revision","confidential_remarks":"The manuscript is well within the journal's scope, and in my assessment the central proof chain is sound. The issues I found are local presentation gaps rather than load-bearing errors, and the authors can fix them without changing the arguments. The citation pattern is appropriate, and the conditional part is clearly labelled as conjectural."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Dear colleague,\n\nIf you work on linear Turán problems, this paper is worth reading. It gives a finite-geometric classification of equality in Adak's reciprocal-degree bound for crown-free hypergraphs, and then turns that classification into a strict improvement over the D/r coefficient. The main theorems are new and the proofs hold together.\n\nThe centerpiece is Theorem 1.1: an edge is sharp exactly when its neighborhood consists of t projective planes of order r-1 glued along the common line e. The proof uses a colored matching system around the edge and classifies the sharp state via affine planes; that argument is clean and self-contained. The repulsion theorem, 1.2, is the key workhorse: any edge meeting a sharp edge has at least q-t+2 low-degree vertices. From there the packing inequality, the defect estimates, and the global coefficient gaps follow naturally. The k=3 exact component theorem is a nice bonus.\n\nCredit where due: the paper re-derives the local reciprocal-degree inequality from first principles, clearly labels the conditional result in Section 7, and openly notes that for r=k=3 the existing 3/2 coefficient is better than its own. There are no fitted parameters and no circular reasoning.\n\nThe soft spots are minor. For fixed k, the improvement over D/r is only ~1/r^2, so the main value is structural rather than a dramatic new bound. The near-sharp localization section is intricate and its unconditional payoff is qualitative; the constant gap depends on Conjecture 7.5, which is honestly stated. There is also a small omitted justification in the proof of Theorem 1.2 when applying Lemma 5.1 to the second plane: one must note that the chosen edges avoid e and hence cannot be lines of Π2. That is a one-line repair, so it does not affect my verdict.\n\nOverall, the math is sound, the writing is honest, and the paper deserves a serious referee. I'd bring it to a reading group and would cite it in my own work on linear hypergraphs.","headline":"A genuine structural result: equality forces glued projective planes, and repulsion yields a strict but modest global coefficient gap.","tokens_in":19450,"tokens_out":3743,"would_cite":true,"duration_ms":31314,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05C65","05D05","51E15"],"pacs":[],"model":"deepseek-v4-flash","headline":"In a crown-free linear hypergraph, an edge attaining the local reciprocal-degree bound is exactly a line shared by $k-1$ projective planes, and neighboring edges are repelled to lower degrees.","keywords":["linear hypergraph","k-crown","crown-free","projective plane","affine plane","reciprocal degree","rainbow matching","Turán number"],"falsifier":"Construct a linear $r$-uniform $k$-crown-free hypergraph with a sharp edge $e$ whose vertices all have degree $D=(k-1)(r-1)+1$ and whose neighborhood is not $k-1$ projective planes of order $r-1$ glued along $e$; for instance, $r=4$, $k=3$, $D=7$, $q=3$ already tests the classification. No such construction can exist if the classification theorem is true.","tokens_in":18428,"feed_emoji":"📐","tokens_out":8673,"duration_ms":72359,"temperature":0.7,"pith_summary":"This paper studies linear $r$-uniform hypergraphs that contain no $k$-crown $C^r_{1,k}$, an acyclic configuration of one base edge and $k$ pairwise disjoint petals meeting the base in distinct vertices. It proves that for every edge $e$, the sum of reciprocals of vertex degrees along $e$ is at least $r/D$ with $D=(k-1)(r-1)+1$. The central result classifies equality: $e$ is sharp exactly when $e$ together with all edges meeting it forms $k-1$ projective planes of order $r-1$ glued along the common line $e$. This rigidity is repulsive: any other edge meeting $e$ contains at least $r-k+2$ vertices of degree at most $D^-=(k-2)(r-1)+1$. From this local rigidity and repulsion, the paper derives a strict improvement over the previous global edge-count coefficient $D/r$ for every admissible parameter range.","feed_headline":"Sharp crown-free edges are glued projective planes","feed_subtitle":"This local rigidity repels neighboring edges and improves the edge-count coefficient below D/r.","key_machinery":"The engine is the local crown system around a fixed edge $e=\\{v_1,\\dots,v_r\\}$: for each $i$, the petal family $F_i(e)$ consists of the $(r-1)$-sets $f\\setminus\\{v_i\\}$ over all edges $f\\ne e$ through $v_i$. Linearity makes each $F_i(e)$ a matching, and a $C^r_{1,k}$-crown with base $e$ is exactly a rainbow matching of size $k$ in these $r$ color classes. The matching-blocker inequality bounds the total unused-color petal mass by incidences on a maximum rainbow matching. At equality every color class has size $(k-1)(r-1)$, so a perfect blocker forces the system to split into $t$ affine planes of order $r-1$; adjoining the base vertices completes them to $t$ projective planes glued along $e$. Sharp-state repulsion then follows from the fact that a line in one constituent plane can meet any other edge in at most one point.","core_discovery":"The central discovery is a finite-geometric classification of equality in the local reciprocal-degree bound. For a linear $C^r_{1,k}$-free $r$-graph $H$ and an edge $e$, the quantity $\\Phi_H(e)=\\sum_{v\\in e}1/d_H(v)$ is always at least $r/D$ with $D=(k-1)(r-1)+1$; the paper proves that equality holds exactly when $e$ and every edge meeting it form $t=k-1$ projective planes of order $q=r-1$ whose common intersection is precisely the line $e$. In other words, the petals through the vertices of $e$ split into $t$ affine planes of order $q$, and adjoining the base line completes each to a projective plane. No Desarguesian hypothesis is needed for this rigidity. The same structure then repels: any adjacent edge must contain many vertices of degree at most $D^-=(k-2)(r-1)+1$, and this local gap accumulates into a strict improvement over the previous global edge-count coefficient $D/r$.","pith_inferences":["The colored-matching argument is a template that should transfer to other acyclic configurations, such as uniform hypertrees or linear paths, where equality in a local degree bound might also force a rigid finite geometry.","Because the equality classification uses no Desarguesian assumption, the sharp-state construction can be realized from any projective plane, including non-Desarguesian ones; probing a non-Desarguesian order such as $q=9$ would test whether the repulsion constant depends on the plane's inner structure.","Theorem 7.3 reduces the asymptotic problem to an average defect estimate on neighbors of near-sharp edges; if the paper's Conjecture 7.5 holds, the edge-density limsup drops below $k-1$ for every fixed $k$, and the conjecture is likely easiest to test first for $t=2$, where the sharp component is just two glued planes.","The nonexistence of sharp states when no projective plane of order $r-1$ exists suggests that extremal density in crown-free hypergraphs may be sensitive to the arithmetic of $r-1$, not only to the shape of the forbidden configuration."],"forward_implications":["Sharp edges are pairwise disjoint, so equality neighborhoods cannot overlap through a vertex.","Every edge meets at most $k-2$ sharp edges, and the number of low-degree vertices is bounded below by $|V^-(H)|\\ge \\frac{r(D-1)(q-t+2)}{(t-1)D^-}|S(H)|$.","For fixed $k$ and all sufficiently large $r$, every such hypergraph satisfies $|E(H)|\\le \\frac{D(D-1)}{r(D-1)+1}|V(H)|$, improving the coefficient $D/r$ by $r^{-2}+O_k(r^{-3})$.","There is no nonempty $D$-regular linear $C^r_{1,k}$-free $r$-graph; more generally $r|E(H)|\\le D|V(H)|-c(H)$, where $c(H)$ is the number of edge-containing components.","For $k=3$, every connected component containing a sharp edge is exactly two projective planes of order $r-1$ glued along that edge, with $r+2(r-1)^2$ vertices and $1+2r(r-1)$ edges."],"supporting_citations":[{"why":"Supplies the reciprocal-degree localization $\\Phi_H(e)\\ge r/D$ and the base coefficient $D/r$ that the present paper refines.","marker":"[1]"},{"why":"Provides the rainbow-matching theory used to reformulate a $k$-crown as a rainbow matching of size $k$ in the local petal families.","marker":"[3]"},{"why":"Gives the Bruck-Ryser nonexistence criterion for projective planes, which makes Theorem 1.7 applicable to infinitely many uniformities.","marker":"[4]"},{"why":"Supplies the standard affine-to-projective completion used to turn $t$ affine planes into $t$ projective planes glued along the base edge.","marker":"[6]"},{"why":"Gives nonexistence of a projective plane of order 10, another input for the no-plane improvement.","marker":"[9]"},{"why":"Establishes the $3/2$ edge bound for 3-uniform crowns, the baseline comparison in the lowest-uniformity case.","marker":"[10]"},{"why":"Introduces higher-uniform crown configurations in linear $r$-graphs, the class studied here.","marker":"[11]"}],"fun_headline_variants":["Sharp edges = glued projective planes","Sharpness in crown-free graphs forces projective-plane glue","Sharp iff glued projective planes, repelling neighbors","Projective-plane gluing characterizes sharp crown-free edges"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that the hypergraph is linear, meaning any two edges share at most one vertex; if two edges could share two vertices, the petal families would not be matchings, the trace skeleton would fail, and the projective-plane classification and repulsion proof would not go through.","fun_headline_variants_meta":{"raw":{"variants":["Sharp edges = glued projective planes","Sharpness in crown-free graphs forces projective-plane glue","Sharp iff glued projective planes, repelling neighbors","Projective-plane gluing characterizes sharp crown-free edges"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000605,"raw_usage":{"total_tokens":2994,"prompt_tokens":1291,"completion_tokens":1703,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":907,"completion_tokens_details":{"reasoning_tokens":1645}},"tokens_in":907,"tokens_out":1703,"duration_ms":12401,"temperature":1.0,"reasoning_tokens":1645,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-15T15:09:30.297517+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Construct a linear $r$-uniform $k$-crown-free hypergraph with a sharp edge $e$ whose vertices all have degree $D=(k-1)(r-1)+1$ and whose neighborhood is not $k-1$ projective planes of order $r-1$ glued along $e$; for instance, $r=4$, $k=3$, $D=7$, $q=3$ already tests the classification. No such construction can exist if the classification theorem is true.","supporting_citations":[{"cited_title":"Zhang, H","cited_arxiv_id":null,"evidence_quote":"Introduces higher-uniform crown configurations in linear $r$-graphs, the class studied here."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Establishes the $3/2$ edge bound for 3-uniform crowns, the baseline comparison in the lowest-uniformity case."},{"cited_title":"An Upper Bound on the Linear Tur\\'{a}n Number of $k$-Crowns","cited_arxiv_id":"2604.10467","evidence_quote":"Supplies the reciprocal-degree localization $\\Phi_H(e)\\ge r/D$ and the base coefficient $D/r$ that the present paper refines."},{"cited_title":"Aharoni and E","cited_arxiv_id":null,"evidence_quote":"Provides the rainbow-matching theory used to reformulate a $k$-crown as a rainbow matching of size $k$ in the local petal families."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Gives the Bruck-Ryser nonexistence criterion for projective planes, which makes Theorem 1.7 applicable to infinitely many uniformities."},{"cited_title":"Dembowski,Finite Geometries, Springer-Verlag, Berlin, 1968","cited_arxiv_id":null,"evidence_quote":"Supplies the standard affine-to-projective completion used to turn $t$ affine planes into $t$ projective planes glued along the base edge."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Gives nonexistence of a projective plane of order 10, another input for the no-plane improvement."}],"review_version":2}