{"id":"2afe9573-bb9b-4601-bea8-850d30c7039b","arxiv_id":"1908.06789","paper_version":2,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"A requested bijective proof of the minimal-excludant theorem, with an r-gap generalization and new truncated-series identities.","lead":"This paper constructs an explicit bijection proving that the sum of minimal excludants over all partitions of n equals the number of two-colored partitions of n into distinct parts, a result previously proved only by generating functions. It extends the bijection to least r-gaps and proves several new identities connecting the mex function to overpartitions and distinct-part partitions.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"§2.1's staircase-profile bijection is the load-bearing step, but the key geometric lemma—that α and β have distinct parts, satisfy the stated length difference, and that the listed inverse reverses φ—is asserted without proof.","rationale":"I read the paper in good faith. The generating-function results are standard, and the new identities in Sections 3–5 appear to follow from known truncated theta formulas. The one place where the central claim could fail is the bijection in Section 2.1, and this is also the only step that is not fully demonstrated: the staircase-profile assertions are stated, not proved, and the inverse construction is described but not shown to invert φ. This is precisely the reader's weakest_assumption. I do not see an internal contradiction or a false theorem; the construction is a known adaptation of Sylvester and Wright. However, because the paper's stated purpose is to provide a purely combinatorial proof, an unproved geometric lemma in the core bijection is a real gap. The verdict should therefore be CONDITIONAL: accept once the profile lemma is proved or a precise reference with proof is supplied. If the authors supply that proof, no mathematical change to the results is needed.","tokens_in":10416,"tokens_out":18261,"duration_ms":200429,"concrete_test":"Implement φ and the two inverse cases of §2.1 for all partitions λ of n − k(k+1)/2, with n ≤ 30 and k ≥ 0, and check φ^{-1}(φ(λ)) = λ for every pair, with the recovered k equal to the original k. If any counterexample appears, the claimed bijection is wrong as stated. If it passes, the construction is sound; the missing deliverable is then a written proof of the profile lemma (explicit formulas for α and β in terms of λ and k), which should be added before final acceptance.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The paper's central contribution is a bijective proof of Theorem 1.1. The map φ in §2.1 is defined by drawing a staircase profile; the proof then asserts (i) α and β have distinct parts, (ii) k ≤ ℓ(α) − ℓ(β) ≤ k+1, and (iii) the inverse, which removes k rows from the conjugate of the shifted diagram of one color class, exactly reverses φ. None of these facts is proved in the text. The connection to Sylvester and Wright makes the construction plausible, and the theorem itself is already known from generating functions, so the risk is not that the result is false; it is that the advertised combinatorial proof is incomplete at exactly the point on which Theorem 1.1, Proposition 3.1, and Theorem 6.1 depend. As written, a reader cannot verify from the text that φ is a bijection without supplying a substantial geometric argument.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper provides a bijective proof of the Andrews–Newman theorem σmex(n)=D2(n), together with a combinatorial proof of the parity characterization of σmex(n), several truncated-series identities involving σmex(n), and a generalization to the sum of least r-gaps. The central construction in Section 2.1 adapts the Sylvester–Wright staircase-profile bijection: from a partition λ of n−k(k+1)/2, append a rotated staircase of height k, draw the staircase profile, and read off a two-color partition into distinct parts from the column lengths left and row lengths right of the profile. The inverse is specified by deleting k rows from the conjugate shifted diagram of the appropriate color class. Theorem 6.1 extends the construction to σr mex(n).","tokens_in":10614,"tokens_out":4843,"duration_ms":49323,"significance":"If the missing geometric verification is supplied, the paper answers an explicit question of Andrews and Newman with a purely combinatorial proof, and it generalizes the interpretation to a natural r-gap statistic. The paper also contains several new analytic identities and connects them to overpartition statistics and Watson-type identities. The exposition includes worked examples and the bijection is defined in both directions, which is valuable. However, the load-bearing step of the main bijection is asserted without proof, so the advertised combinatorial proof is not yet complete as written.","major_comments":[{"comment":"The core geometric assertion after Definition 1 — that for the diagram obtained by appending the rotated staircase η(k), the column lengths α left of the staircase profile and the row lengths β right of the profile have distinct parts and satisfy k ≤ ℓ(α)−ℓ(β) ≤ k+1 — is stated without proof. The converse construction in (i)–(ii) is also asserted to produce the inverse of φ for every µ ∈ D2(n), but no verification is given. Since the theorem's bijective proof rests entirely on this staircase-profile lemma, the reader cannot currently verify that φ is a bijection from the text alone. The worked Example 2.3 illustrates one case, but it does not replace a general proof.","section":"§2.1"},{"comment":"The proof of Proposition 3.1 says that applying the Section 2.1 transformation 'is now straightforward' and gives no details. Because the bijectivity of that transformation is precisely the unproved geometric lemma identified above, the gap transfers to the count D3^(k)(n). The conditions in the definition of D3^(k)(n) are intricate, so the reader needs an explicit demonstration that the bijection preserves exactly those conditions.","section":"§3, Proposition 3.1"},{"comment":"The bijection ξ in the proof of Theorem 6.1 is built directly on φ and φ−1 from Section 2.1. The verification that ξ and ξ−1 are inverse, and in particular that applying φ−1 to µ0/r ∪ α1/r produces a partition of t1+t2 − j(j+1)/2 for some nonnegative integer j, relies on the same unproved distinctness and length-difference properties. Thus the r-gap generalization inherits the same incompleteness.","section":"§6, Theorem 6.1"}],"minor_comments":[{"comment":"In the second paragraph after Example 2.1, 'λ(1) and λ(2) are partitions into distinct parts' should presumably read 'λ(0) and λ(1)', since only two colors are used at that point.","section":"§2.1"},{"comment":"The convention 'D1(x) = 0 if x is not a positive integer' is inconsistent with the usual value D1(0)=1, which is needed in the coefficient extraction for n=0. Please use 'nonnegative integer' or explicitly set D1(0)=1.","section":"§5, Theorem 5.1"},{"comment":"The overpartition statistic M̅k is notationally very close to the partition statistic Mk used in Section 3; a distinct symbol or a clearer typographical distinction would reduce confusion.","section":"§4"},{"comment":"Several typos and OCR artifacts remain, including 'W orcester' in the affiliation, 'o f n' in the abstract, and nonstandard inequality symbols. A careful proofreading pass is recommended.","section":"General"}],"recommendation":"major_revision","confidential_remarks":"The paper is likely correct, but the advertised combinatorial proof is incomplete at the exact point that constitutes its main novelty. This is a local and fixable gap: the authors should add a self-contained proof of the staircase-profile lemma (or give a complete citation with the relevant statement) and then verify the inverse construction. I recommend major revision rather than rejection because the missing argument is within the scope of the paper and the surrounding results are solid."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"You should know this paper does what it says: it gives a combinatorial proof of the Andrews–Newman result sigma_mex(n)=D2(n), plus a parity proof and a whole family of truncated identities. The main theorem itself is not new, but the bijection in Section 2.1 is, and it is clearly laid out in both directions with an example. The r-gap generalization in Theorem 6.1, using Glaisher's bijection, is a nice touch. The analytic proofs in Sections 3–5 are standard manipulations of known generating functions and are sound. The citation pattern is fine: the authors build on their own earlier work and on Yee, where the relevant identities already appeared.\n\nThe soft spot is exactly the one flagged in the stress test. The map phi in Section 2.1 is defined by drawing a staircase profile and then asserting that the resulting alpha and beta have distinct parts, satisfy k ≤ ell(alpha) − ell(beta) ≤ k+1, and that the specified inverse really does reverse phi. None of that is proved in the text. This is the hinge for Theorem 1.1, Proposition 3.1, and Theorem 6.1. If the authors had cited Wright's article as containing the precise geometric lemma, or had inserted a short proof, this would be fine. As written, a reader either takes the construction on faith or has to reconstruct a nontrivial argument. This is a moderate gap, not a fatal one: the result is already known through generating functions, so there is no danger of the theorem collapsing. But the paper's central claim is that it provides a purely combinatorial proof, and that proof is incomplete at the critical step.\n\nProposition 3.1 is similar in miniature: the proof is one sentence saying the transformation is straightforward. Given that the same staircase construction is involved, it would benefit from a few more details.\n\nThis is a careful paper by people who know the area, and I would send it to a serious referee. My recommendation: accept, but ask the authors to spell out the staircase-profile lemma or to point the reader to a self-contained reference for it. It would strengthen what is otherwise a nice contribution that partition-theory readers will find genuinely useful.","headline":"Solid, useful partition-theory paper that delivers the requested mex bijection and an r-gap generalization, but the load-bearing staircase-profile step is asserted rather than proved in the text.","tokens_in":737,"tokens_out":790,"would_cite":true,"duration_ms":26920,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["11A63","11P81","05A19"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves the minimal-excludant theorem by an explicit staircase-profile bijection: sum of minimal excludants equals the number of two-color distinct-part partitions, with the bijection also proving r-gap generalizations and parity…","keywords":["minimal excludant","mex","least r-gap","partition bijection","staircase profile","two-color partitions","truncated theta series","overpartitions"],"falsifier":"Take any Ferrers diagram with an appended rotated staircase of height k, draw the staircase profile, and check directly that the column lengths on the left and the row lengths on the right are distinct parts satisfying k <= ell(alpha)-ell(beta) <= k+1; a diagram where a length repeats or where the declared inverse does not remove a rotated staircase invalidates the bijection. Short of that, enumerating all partitions of n for n = 0 through 30 and comparing sigma_mex(n) with D2(n) would settle Theorem 1.1 numerically.","tokens_in":10235,"feed_emoji":"🧩","tokens_out":9698,"duration_ms":84027,"temperature":0.7,"pith_summary":"The paper seeks a purely combinatorial proof of a theorem that was previously established analytically: the sum sigma_mex(n) of minimal excludants, taken over all partitions of n, equals D2(n), the number of partitions of n into distinct parts in two colors. The contribution is a direct bijection, built from a staircase-profile construction, that makes the equality visible as a matching of partitions rather than an identity of series. The same construction proves the parity criterion for sigma_mex and extends to r-gaps: sigma_r mex(n), the sum of least r-gaps, equals the number of two-color partitions whose color-0 parts are distinct multiples of r and whose color-1 parts appear at most 2r-1 times. A sympathetic reader cares because the bijection exposes a structural reason for the identity and supplies combinatorial proofs of several truncated series identities, inequalities, and convolution formulas involving sigma_mex.","feed_headline":"A bijection proves the minimal-excludant theorem","feed_subtitle":"A staircase-profile map matches partitions of n to two-color distinct-part partitions, and extends to least r-gaps.","key_machinery":"The central object is the staircase-profile bijection phi, adapted from a classical proof of the triple product identity: given a partition $\\lambda$ and a nonnegative integer k, append a rotated staircase of height k to $\\lambda$'s Ferrers diagram and draw the zig-zag staircase profile; $\\alpha$ (column lengths left of the profile) and $\\beta$ (row lengths right of the profile) are distinct-part partitions whose part-count difference lies between k and k+1, and coloring $\\alpha$ with color k mod 2 and $\\beta$ with color k+1 mod 2 produces a two-color distinct-part partition. The inverse removes the top k rows from the conjugate of the shifted diagram of the color class with more parts. This map carries the identity sigma_mex(n) = sum_{k>=0} p(n - k(k+1)/2) to the counting of D2(n), and its r-scaled version, together with the standard bounded-multiplicity bijection, proves Theorem 6.1.","core_discovery":"The paper's central claim is that the equality sigma_mex(n) = D2(n), first obtained analytically, is a bijection. For each k >= 0 and each partition lambda of n - k(k+1)/2, append the rotated Ferrers diagram of the staircase k + (k-1) + ... + 1 to the top of lambda's Ferrers diagram, run the staircase profile (a zig-zag line of alternating right and down steps) through the combined diagram, and split the boxes: the column lengths to the left of the profile form a partition alpha into distinct parts, the row lengths to the right form a partition beta into distinct parts, and k <= ell(alpha) - ell(beta) <= k+1. Coloring alpha and beta with opposite colors gives a two-color distinct-part partition of n; running the recipe backward, removing the top k rows from the conjugate of the shifted diagram of the color class with more parts, is the inverse. The same construction, applied to the parts of lambda divisible by r after dividing by r, plus the standard bounded-multiplicity bijection for the remaining parts, proves the r-gap generalization sigma_r mex(n) counts two-color partitions whose color-0 parts are distinct multiples of r and whose color-1 parts occur at most 2r-1 times.","pith_inferences":["The same staircase-profile mechanism should transfer to any partition statistic whose generating function is a sum over triangular shifts of the ordinary partition function; every identity expressible as sum_{k>=0} p(n - k(k+1)/2) is a candidate for a two-color interpretation of the same kind.","The r-gap bijection suggests a nested family of constructions: iterating the bounded-multiplicity map should interpret sums of higher-order gap statistics, such as the second least r-gap, in terms of partitions with three or more color classes with prescribed multiplicity bounds.","Because the parity proof relies only on a color-swapping involution, a parallel parity criterion is plausible for sigma_r mex(n), linking its parity to partitions into distinct parts divisible by r and their generalized pentagonal thresholds.","The combinatorial framework may also yield algorithmic dividends: the explicit inverse map gives a way to compute, from any two-color distinct-part partition, the original partition and the value of its minimal excludant without enumerating all partitions of n."],"forward_implications":["The equality sigma_mex(n) = D2(n) is now realized by an explicit bijection, so each partition's minimal excludant is encoded in the color-count difference of its matched two-color distinct-part partition.","The parity statement follows combinatorially from color interchange and the pentagonal number theorem: sigma_mex(n) is odd exactly when n is twice a generalized pentagonal number.","The r-gap generalization (Theorem 6.1) identifies sigma_r mex(n) with the number of two-color partitions whose color-0 parts are distinct multiples of r and whose color-1 parts occur at most 2r-1 times.","The truncated identities in Section 3 produce an infinite family of linear inequalities for sigma_mex and give the sums on the right a three-color distinct-part interpretation.","Sections 4 and 5 link sigma_mex to overpartitions and to gap-free two-color partitions, yielding convolution formulas such as sigma_mex(n) = sum_{j=0}^n pod(j) D2^*(n-j)."],"supporting_citations":[{"why":"states the analytic theorem sigma_mex(n)=D2(n) that the bijection reproves.","marker":"[4]"},{"why":"supplies the identity sigma_mex(n)=sum_k p(n-k(k+1)/2) and the r-gap generating function that the bijection operationalizes.","marker":"[5]"},{"why":"contains the constructive partition theory and staircase-profile idea from which the bijection is adapted.","marker":"[12]"},{"why":"gives the short enumerative bijection for the triple product identity used as the direct template.","marker":"[13]"},{"why":"provides the truncated pentagonal number theorem and the M_k(n) generating functions used in Theorem 1.3.","marker":"[2]"},{"why":"supplies the combinatorial proof of the truncated triple product identity invoked in the combinatorial proof of Theorem 1.3.","marker":"[14]"}],"fun_headline_variants":["Staircase profile yields bijective proof of mex theorem","Bijection matches minimal excludants to two-color partitions","Combinatorial proof extends to least r-gaps via staircase","Staircase map gives purely combinatorial mex identity","Mex theorem proven by staircase-profile bijection"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The construction rests on a geometric fact about the staircase profile that the text states rather than fully verifies: the column lengths on the left and the row lengths on the right always form distinct parts whose counts differ by exactly k or k+1, so the inverse recipe (removing the top k rows from the conjugate shifted diagram of the larger color class) really reverses the map.","fun_headline_variants_meta":{"raw":{"variants":["Staircase profile yields bijective proof of mex theorem","Bijection matches minimal excludants to two-color partitions","Combinatorial proof extends to least r-gaps via staircase","Staircase map gives purely combinatorial mex identity","Mex theorem proven by staircase-profile bijection"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000742,"raw_usage":{"total_tokens":3336,"prompt_tokens":999,"completion_tokens":2337,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":615,"completion_tokens_details":{"reasoning_tokens":2260}},"tokens_in":615,"tokens_out":2337,"duration_ms":17731,"temperature":1.0,"reasoning_tokens":2260,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T12:35:24.939383+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take any Ferrers diagram with an appended rotated staircase of height k, draw the staircase profile, and check directly that the column lengths on the left and the row lengths on the right are distinct parts satisfying k <= ell(alpha)-ell(beta) <= k+1; a diagram where a length repeats or where the declared inverse does not remove a rotated staircase invalidates the bijection. Short of that, enumerating all partitions of n for n = 0 through 30 and comparing sigma_mex(n) with D2(n) would settle Theorem 1.1 numerically.","supporting_citations":[{"cited_title":"Andrews, D","cited_arxiv_id":null,"evidence_quote":"states the analytic theorem sigma_mex(n)=D2(n) that the bijection reproves."},{"cited_title":"Ballantine, M","cited_arxiv_id":null,"evidence_quote":"supplies the identity sigma_mex(n)=sum_k p(n-k(k+1)/2) and the r-gap generating function that the bijection operationalizes."},{"cited_title":"Sylvester, F","cited_arxiv_id":null,"evidence_quote":"contains the constructive partition theory and staircase-profile idea from which the bijection is adapted."},{"cited_title":"Wright, An enumerative proof of an identity of Jacobi, J","cited_arxiv_id":null,"evidence_quote":"gives the short enumerative bijection for the triple product identity used as the direct template."},{"cited_title":"Andrews, M","cited_arxiv_id":null,"evidence_quote":"provides the truncated pentagonal number theorem and the M_k(n) generating functions used in Theorem 1.3."},{"cited_title":"Yee, A truncated Jacobi triple product theorem, J","cited_arxiv_id":null,"evidence_quote":"supplies the combinatorial proof of the truncated triple product identity invoked in the combinatorial proof of Theorem 1.3."}],"review_version":1}