{"id":"2251dead-d87e-4f4b-86a8-ddbb0df344c5","arxiv_id":"2411.16091","paper_version":1,"verdict":"REJECT","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"high","formal_verification":"none","parameter_count":0,"one_line_summary":"For cross-intersecting families of k-subsets and ℓ-subsets with empty total intersection, the paper gives the exact second extremal product |A||B| and the unique extremal pairs when n ≥ 2ℓ > 2k or n > 2ℓ = 2k.","lead":"This paper identifies the second-largest possible product of sizes for two cross-intersecting families of k-subsets and ℓ-subsets of [n] with no common element, and describes the unique extremal families. It extends the classic Matsumoto-Tokushige bound and the Frankl-Kupavskii size-sensitive results into a new parameter range.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Proposition 4.1's convexity argument is invalid: an interior maximum does not have zero second derivative, and the displayed formula for φ'' is not the true second derivative of the binomial polynomial; the middle range of |A| is therefore not covered.","rationale":"The reader's verdict identifies the most load-bearing weakness correctly. The paper's main contribution, Theorem 1.5, is an exact second-extremal result with uniqueness, and the proof splits into ranges for |A|. The ranges not covered by Propositions 3.1–3.5 and Corollary 3.6 are handled by Proposition 4.1, whose polynomial argument is the only bridge over the middle region when n ≥ ℓ². The failure of the convexity/maximum argument means that the inequality φ(x) < Γ is not proved on the interval, so the product bound (11) is not derived for those sizes of |A|. This is not a mere cosmetic issue: without Proposition 4.1, the fourth bullet in the proof of Theorem 1.5 has no support. I did not find an independent proof of the missing claim elsewhere in the paper, nor is there machine-checked verification or numerical evidence that would compensate. The paper is seriously written and the overall strategy is plausible, but the central claim is not established by the submitted argument. The correct verdict remains REJECT, so no adjustment to the reader's verdict is needed. Secondary issues, such as the apparent reference to Theorem 2.4 where Theorem 2.3 is meant in Proposition 4.2, are not the main obstacle and do not change this assessment.","tokens_in":23884,"tokens_out":8307,"duration_ms":77440,"concrete_test":"Compute the true second derivative of φ(x) in (12) symbolically with a CAS for a nontrivial admissible parameter triple (e.g., n=25, k=2, ℓ=5) and compare it with the printed expression; this will confirm the missing factor 2. Then, to test whether the inequality itself survives, evaluate φ(x) − Γ exactly (rational arithmetic) at every integer x in [n−ℓ−1, n−4] for all admissible n,k,ℓ up to n=200. If any value is nonnegative, Proposition 4.1 is false; if all values are negative, the theorem may be true but the submitted proof still lacks a valid replacement for the convexity step.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central theorem depends on Proposition 4.1, which is the only place covering the middle ranges of |A| when n ≥ ℓ² in the proof of Theorem 1.5. Its proof reduces inequality (11) to showing φ(x) < Γ for all x in [n−ℓ−1, n−4]. The endpoint checks φ(n−5) < Γ, φ(n−ℓ−1) < Γ and φ(n−4) < Γ are not enough unless the interior is controlled. The text attempts this via convexity but contains two invalid steps. First, the displayed second derivative is not correct: for f(x) = binom(x,r), the true second derivative is f(x)·[(Σ 1/(x−i))² − Σ 1/(x−i)²] = 2·f(x)·Σ_{i<j} 1/((x−i)(x−j)), so the printed expression is missing the factor 2 or has not been derived from the binomial polynomial. Second, the argument says: 'If φ''(x) > 0 for all x ... So assume φ''(x) ≤ 0 for some x. Let x0 be an arbitrary maximum element. So φ''(x0) = 0.' This is logically false: an interior maximum only forces φ'(x0)=0 and φ''(x0) ≤ 0; it need not be an inflection point. If the maximum is at an endpoint, φ'' at that endpoint is irrelevant. Thus the dichotomy 'either φ is convex or its maximum has zero second derivative' is not established, and the bound φ(x)<Γ in the interior is left unproved. Since Proposition 4.1 is essential for the fourth case in the proof of Theorem 1.5, the main theorem is not established by the submitted text.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies the product size |A||B| of two cross-intersecting families A in C([n],k) and B in C([n],ell) under the nontriviality condition that the total intersection of all sets in A union B is empty. For n >= 2ell > 2k or n > 2ell = 2k, it claims two sharp upper bounds with unique extremal families, along with a sharpness example. The proof develops several size-sensitive inequalities in Section 3 and then, in Section 4, reduces the remaining middle range of |A| to a polynomial inequality phi(x) < Gamma. The authors state that the proof recovers results of Frankl and Kupavskii. The main theorem is thus a natural 'second extremal' complement to Matsumoto-Tokushige and Pyber.","tokens_in":1277,"tokens_out":1353,"duration_ms":86133,"significance":"If correct, the main theorem would settle a natural extremal problem for non-trivial cross-intersecting families in the ell > k range, giving explicit extremal configurations and a sharpness example. The paper draws on standard tools (Kruskal-Katona, Lovasz, Moers, Hilton) and the size-sensitive inequalities in Section 3 are potentially useful. However, the central proof depends on Proposition 4.1, whose written proof contains serious gaps in the analysis of the polynomial phi(x). These gaps are load-bearing: without them, the middle range of |A| is not covered and the main theorem is not established. The significance of the claimed result is therefore not realized by the submitted text.","major_comments":[{"comment":"The displayed formula for phi''(x) is not the second derivative of the binomial-coefficient polynomial. For f(x) = binom(x,r), the correct second derivative is f(x)[(sum_{i=0}^{r-1} 1/(x-i))^2 - sum_{i=0}^{r-1} 1/(x-i)^2] = 2 f(x) sum_{0 <= i < j <= r-1} 1/((x-i)(x-j)). The expression printed in the proof contains only products of consecutive factors, omitting all cross terms. Consequently, the claim that phi''(x) > 0 for all x in the interval is unsupported, and the subsequent dichotomy in the proof has no valid basis.","section":"Section 4.2, Eq. (12)"},{"comment":"The statement 'Let x0 be an arbitrary maximum element. So phi''(x0) = 0' is logically false. For a twice-differentiable function on an open interval, an interior maximum satisfies phi'(x0) = 0 and phi''(x0) <= 0; it need not be an inflection point with phi''(x0) = 0. The dichotomy 'either phi is convex on the whole interval or its maximum has zero second derivative' is therefore not established. Since the endpoint checks in Lemmas 4.4-4.7 do not control the interior (n-ell-1, n-5), the bound phi(x) < Gamma is left unproved for that interval.","section":"Section 4.2, proof of Proposition 4.1"},{"comment":"The proof asserts that the Lovasz parameter x satisfies n-ell-1 <= x <= n-5 (or n-5 < x <= n-4 in the second case) without derivation. These bounds on x are load-bearing because the subsequent argument verifies phi(x) < Gamma only at the endpoints and attempts to control the interior by the invalid convexity step. A derivation of these bounds from the size hypotheses on |A| is needed; otherwise the interval over which phi is studied is not justified.","section":"Section 4.2, proof of Proposition 4.1"}],"minor_comments":[{"comment":"The symbol B prime is reused for the family {B in C([3,n],ell-1) : {1} union B in B} and later for the family of complements {[3,n]\\B : B in B prime}. This notational clash makes the proof harder to follow and should be fixed.","section":"Section 4.2"},{"comment":"There is a typographical inconsistency: the proof says 'n-5 < x <= n-4 for n <= ell^2', while Lemma 4.6 and the end of the proof use n >= ell^2. The intended condition appears to be n >= ell^2.","section":"Section 4.2"},{"comment":"The text contains 'positive intgers'; it should read 'positive integers'.","section":"Theorem 1.4"}],"recommendation":"major_revision","confidential_remarks":"The main theorem is interesting and the paper has a plausible overall strategy, but the gap in Proposition 4.1 is substantial and load-bearing. The authors should be asked to supply a correct proof of the interior bound phi(x) < Gamma, including a correct convexity or alternative argument, and to justify the stated range of x. If such a proof cannot be provided, the paper should not be accepted. There is no indication of circularity; the reliance on standard theorems is appropriate."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: the paper's ℓ > k result is a genuine extension and the machinery is mostly sound, but Proposition 4.1 has a load-bearing flaw. I checked the step the stress-test flags, and it holds up.\n\nThe displayed formula for φ''(x) in Section 4.2 is not the true second derivative of the binomial polynomials. For binom(x,r), the actual second derivative involves all pairwise reciprocal products, 2Σ_{i<j} 1/((x−i)(x−j)), not just adjacent products. The paper's sum is missing the cross terms. Worse, the inequality asserting that the first reciprocal sum is smaller than the second appears reversed: the first sum has more positive terms, so it should be larger. Then the line \"let x0 be an arbitrary maximum element. So φ''(x0) = 0\" is also wrong—an interior maximum only forces φ''(x0) ≤ 0, not equality. These are not cosmetic issues. Proposition 4.1 is the only place covering the middle ranges of |A| in the proof of Theorem 1.5 when n ≥ ℓ², so inequality (11) is not established for those ranges.\n\nThat said, the paper has real merit. The extremal constructions are explicit and the two candidate bounds are natural. The use of Mörs's equality criterion for uniqueness is elegant, and recovering Frankl–Kupavskii as a by-product is a useful consistency check. The citation pattern is fine; the self-citation to Wu–Xiong is used for context and recovery, not as a load-bearing input.\n\nMy guess is the overall claim is true and the gap is repairable, but the submitted text does not prove it. A serious referee should ask for a corrected proof of Proposition 4.1—specifically a correct second-derivative computation and a valid convexity or maximum argument. I would not desk-reject this; it deserves refereeing. But it should not be accepted in current form.","headline":"The ℓ > k result is a real extension and the early sections are solid, but Proposition 4.1 has a load-bearing flaw in its derivative analysis, so the main theorem is not proven as written.","tokens_in":24728,"tokens_out":4483,"would_cite":true,"duration_ms":40880,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05D05","05A20"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper proves that, in the stated range, nontrivial cross-intersecting family products attain one of two explicit sharp bounds, with unique extremal structures.","keywords":["cross-intersecting families","nontrivial extremal problem","product of family sizes","shadow methods","binomial coefficient inequalities","size-sensitive inequalities","unique extremal configurations"],"falsifier":"Evaluate $\\varphi(x)-\\Gamma$ for an admissible triple with $n\\ge \\ell^2$ and $n\\ge 2\\ell>2k$ at an interior point of $[n-\\ell-1,n-4]$, for example $x=n-\\ell-2$; if any value is nonnegative, Proposition 4.1's covering of the middle range fails. A finite check over small parameters, say $\\ell\\le 8$ and all permitted $k,n$, would settle whether the bound is true or false.","tokens_in":23686,"feed_emoji":"🧩","tokens_out":11927,"duration_ms":102124,"temperature":0.7,"pith_summary":"Two families $\\mathcal{A}\\subseteq \\binom{[n]}{k}$ and $\\mathcal{B}\\subseteq \\binom{[n]}{\\ell}$ are cross-intersecting when every set in $\\mathcal{A}$ meets every set in $\\mathcal{B}$, and nontrivial when no single element lies in every member of $\\mathcal{A}\\cup\\mathcal{B}$. The paper determines the exact extremal value of the product $|\\mathcal{A}||\\mathcal{B}|$ for nontrivial pairs, under the range $n\\ge 2\\ell>2k$ or $n>2\\ell=2k$. There are exactly two extremal shapes up to isomorphism, giving two sharp closed-form upper bounds. The range of $n$ is best possible, and the size-sensitive inequalities proved along the way recover the known equal-size nontrivial extremal result.","feed_headline":"Two shapes maximize nontrivial cross-intersecting family products","feed_subtitle":"Both upper bounds are sharp, with unique extremal families, settling the next case after the classical star maximum.","key_machinery":"The proof has two layers. A family of size-sensitive inequalities is built from regular bipartite graphs whose two parts are adjacent layers of the disjointness graph on set families: when a pair is maximal, the neighbor ratio $|N(X)|/|X|$ is bounded below, which lets one replace a part of $\\mathcal{B}$ and the corresponding part of $\\mathcal{A}$ and compare the new product with the old. For the middle range of $|\\mathcal{A}|$, the proof compresses to lexicographically initial families, then uses the shadow transform: from $|\\mathcal{B}'|=\\binom{x}{n-\\ell-1}$ the analytic shadow bound yields $|\\mathcal{A}'|\\le \\binom{n-2}{k-1}-\\binom{x}{k-1}$, so $|\\mathcal{A}||\\mathcal{B}|$ is dominated by the polynomial $\\varphi(x)$ in equation (12). The target is to show $\\varphi(x)<\\Gamma$ for every integer $x\\in[n-\\ell-1,n-4]$, where $\\Gamma$ is the maximum of the two claimed bounds; endpoint checks are binomial-ratio estimates, and the interior is handled by a second-derivative argument that, as written, relies on an invalid concavity step. The equality analysis uses a uniqueness criterion for shadow equality to force the two extremal structures.","core_discovery":"Under the stated range, any nontrivial cross-intersecting pair must satisfy one of two inequalities: $|\\mathcal{A}||\\mathcal{B}| \\le \\bigl(\\binom{n-1}{k-1}+\\binom{n-2}{k-1}\\bigr)\\binom{n-2}{\\ell-2}$, with equality only for $\\mathcal{A}=\\{A: 1\\in A \\text{ or } 2\\in A\\}$ and $\\mathcal{B}=\\{B: [2]\\subseteq B\\}$; or $|\\mathcal{A}||\\mathcal{B}| \\le \\bigl(\\binom{n-1}{k-1}+1\\bigr)\\bigl(\\binom{n-1}{\\ell-1}-\\binom{n-k-1}{\\ell-1}\\bigr)$, with equality only for $\\mathcal{A}=\\{A: 1\\in A\\}\\cup\\{[2,k+1]\\}$ and $\\mathcal{B}=\\{B: 1\\in B,\\ B\\cap[2,k+1]\\ne\\emptyset\\}$, up to isomorphism. The dichotomy is exhaustive, so every nontrivial cross-intersecting pair falls under one of the two sharp bounds. The theorem also shows that the numerical range on $n$ is best possible, giving explicit examples just outside the range where the product exceeds both bounds.","pith_inferences":["A natural next step the authors do not take is to verify the polynomial bound $\\varphi(x)<\\Gamma$ computationally for small admissible parameter triples; since the interval of $x$ has length $O(\\ell)$, the check is finite and could repair or refute the middle-range step.","If the polynomial bound is repaired, the same shadow-and-polynomial reduction may extend to the third extremal product or to nontrivial cross-intersecting families under weaker constraints on $n$.","The uniqueness proof suggests a stability statement: families whose product is close to the second extremum should be close, in symmetric difference, to one of the two displayed shapes; the paper does not prove such a statement."],"forward_implications":["If Theorem 1.5 is correct, the exact extremal product for nontrivial cross-intersecting families is known in the stated range, with two explicit extremal families up to isomorphism.","The range $n\\ge 2\\ell>2k$ or $n>2\\ell=2k$ is sharp: just outside it, explicit examples beat both bounds, so the numerical condition is not an artifact of the method.","The size-sensitive inequalities proved here recover the known nontrivial extremal bound for the equal-size case, placing that earlier result inside the same framework.","The dichotomy gives a practical way to recognize extremality: compare $|\\mathcal{A}|$ to the two thresholds and test membership in the two listed shapes."],"supporting_citations":[{"why":"Supplies the maximum-product theorem for cross-intersecting families whose second extremum this paper classifies.","marker":"[16]"},{"why":"Introduces the product-size formulation for two cross-intersecting families of different ranks.","marker":"[18]"},{"why":"Gives the size-sensitive inequality for equal ranks that the new inequalities generalize and recover.","marker":"[7]"},{"why":"Completes the nontrivial equal-size extremal problem and supplies the comparison case for the sharpness examples.","marker":"[19]"},{"why":"Provides the analytic shadow bound used to dominate the product by the polynomial $\\varphi(x)$.","marker":"[15]"},{"why":"Supplies the shadow uniqueness criterion used to identify the extremal families.","marker":"[17]"},{"why":"Is half of the shadow-minimum theorem used throughout the size-sensitive arguments.","marker":"[14]"},{"why":"Is the other half of the shadow-minimum theorem, together with the initial-segment bound.","marker":"[12]"},{"why":"Gives the lexicographic compression lemma that lets the proof assume the families are initial segments.","marker":"[10]"}],"fun_headline_variants":["Two sharp bounds solve nontrivial cross-intersecting families","Exact second maximum for cross-intersecting families","Unique extremal shapes give optimal cross-intersecting product","Sharp dichotomy: two bounds for cross-intersecting pairs"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The middle-range inequality in Proposition 4.1 depends on the auxiliary polynomial $\\varphi(x)$ staying strictly below the target maximum $\\Gamma$ at every integer $x$ from $n-\\ell-1$ to $n-4$; the written proof of that bound invokes a second-derivative argument that misstates the expansion of $\\varphi''(x)$ and confuses a stationary point with an inflection point.","fun_headline_variants_meta":{"raw":{"variants":["Two sharp bounds solve nontrivial cross-intersecting families","Exact second maximum for cross-intersecting families","Unique extremal shapes give optimal cross-intersecting product","Sharp dichotomy: two bounds for cross-intersecting pairs"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000796,"raw_usage":{"total_tokens":3723,"prompt_tokens":1385,"completion_tokens":2338,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":1001,"completion_tokens_details":{"reasoning_tokens":2280}},"tokens_in":1001,"tokens_out":2338,"duration_ms":16356,"temperature":1.0,"reasoning_tokens":2280,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T13:33:35.602809+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Evaluate $\\varphi(x)-\\Gamma$ for an admissible triple with $n\\ge \\ell^2$ and $n\\ge 2\\ell>2k$ at an interior point of $[n-\\ell-1,n-4]$, for example $x=n-\\ell-2$; if any value is nonnegative, Proposition 4.1's covering of the middle range fails. A finite check over small parameters, say $\\ell\\le 8$ and all permitted $k,n$, would settle whether the bound is true or false.","supporting_citations":[{"cited_title":"Matsumoto, N","cited_arxiv_id":null,"evidence_quote":"Supplies the maximum-product theorem for cross-intersecting families whose second extremum this paper classifies."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Introduces the product-size formulation for two cross-intersecting families of different ranks."},{"cited_title":"Frankl, A","cited_arxiv_id":null,"evidence_quote":"Gives the size-sensitive inequality for equal ranks that the new inequalities generalize and recover."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Completes the nontrivial equal-size extremal problem and supplies the comparison case for the sharpness examples."},{"cited_title":"Lov´ asz, Problem 13.31, in: Combinatorial Problems and Exer cises, North Holland, 1979","cited_arxiv_id":null,"evidence_quote":"Provides the analytic shadow bound used to dominate the product by the polynomial $\\varphi(x)$."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the shadow uniqueness criterion used to identify the extremal families."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Is half of the shadow-minimum theorem used throughout the size-sensitive arguments."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Is the other half of the shadow-minimum theorem, together with the initial-segment bound."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Gives the lexicographic compression lemma that lets the proof assume the families are initial segments."}],"review_version":1}