{"id":"48874ea3-4fe2-4e23-9e35-74c6e8de2aa7","arxiv_id":"2411.13371","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The fundamental quasisymmetric functions in superspace receive explicit combinatorial formulas for their product, coproduct, antipode, and expansion of Schur functions.","lead":"This paper derives explicit formulas for the product, coproduct, and antipode of fundamental quasisymmetric functions in superspace, and extends the classical expansion of Schur functions in terms of these functions. Specialists in combinatorial Hopf algebras and supersymmetric symmetric functions will find a complete toolkit for working with this basis.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Proposition 4.6's signed product formula rests on an asserted bijection φ whose reversal and sign preservation are not proved; this is the central gap and should be verified.","rationale":"The reader's weakest-assumption analysis correctly identifies the sign-preserving bijection φ in the proof of Proposition 4.6 as the load-bearing unproved step. My independent reading confirms that the proof of (4.1) depends entirely on this bijection: the reduction from LαLβ to overlapping shuffles is only valid if φ is a bijection with the stated sign property. The manuscript itself flags the bijection reversal with 'It is not difficult to see', which is precisely the kind of asserted-but-unproved step that warrants conditional acceptance. I checked the surrounding material: the coproduct (Proposition 3.1), the antipode algorithm (Section 5), and the Schur expansion (Proposition 6.3) do not introduce an obvious internal inconsistency, though Proposition 6.3's proof is likewise terse. The product formula, however, is foundational for the Hopf-algebra structure and for the paper's claimed completeness, so the sign-preserving bijection is the single most load-bearing concern. A computational enumeration over small cases would settle whether the asserted bijection actually fails or whether only the written proof is incomplete. Until such a check is supplied, the conditional verdict is appropriate.","tokens_in":23725,"tokens_out":7601,"duration_ms":80126,"concrete_test":"Implement the construction in the proof of Proposition 4.6 for all pairs of dotted compositions with total degree ≤ 6 and fermionic degree ≤ 2 (or a larger finite range) and check: (1) every element of S2 has exactly one preimage under φ, i.e., φ is a bijection; and (2) for each (Q, γ′), the signs computed as (−1)^(#dots below Q) and (−1)^(#dots below P) coincide. Equivalently, brute-force expand both sides of (4.1) in the M-basis using Definitions 2.3 and 2.9 and compare coefficients. A single mismatch would refute Proposition 4.6; a complete match over the tested range would not replace a proof but would localize the gap to the written justification.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The product formula (4.1) in Proposition 4.6 is the engine of the paper, but its proof reduces to a bijection φ: S1 → S2 satisfying Γ(P) = γ′ and sign(P) = sign(Q) (Section 4, proof of Proposition 4.6). The construction of φ is described only in the forward direction; the final paragraph states 'It is not difficult to see that these steps can be reversed and φ is a bijection' without proof. More importantly, the required equality sign(P) = sign(Q) is asserted but never argued. The sign for a fundamental shuffle is (−1)^(#dots below Q), with dots placed where entries of wα and wβ are simultaneously dotted, while the sign for an overlapping shuffle P is counted in the coarser (α′, β′)-grid; the deformation changes the grid and the relevant dots. Without a proof that the deformation preserves the number of dots below the path, or a direct verification, the signed expansion (4.1), and everything built on it, is not fully established. The worked examples (Figures 3, 7, 8) are not exhaustive and do not cover sign preservation or inverse construction in general.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"This paper studies the fundamental quasisymmetric functions in superspace L_α, indexed by dotted compositions, which were introduced only in passing in [6]. The authors claim four structural results: a coproduct formula Δ(L_α) = Σ L_η ⊗ L_γ over concatenations and near concatenations (Prop 3.1); a signed product formula L_α L_β = Σ_γ sign(γ) L_γ over 'fundamental shuffles' (Prop 4.6), proved by a deformation bijection to the overlapping-shuffle product of monomials from [6]; an antipode algorithm built on two bilinear operations • and ⊙, a compatibility theorem (Thm 5.3), a column decomposition (5.24), and an explicit column formula (Prop 5.5); and an expansion of skew Schur functions in superspace s_{Λ/Ω} = Σ_T (−1)^{inv(T)} L_comp(T) over dot-standard s-tableaux (Prop 6.3). The paper also introduces the sets D(α), E(α), F(α), which characterize the refinement order ⪯ and give compact rewritings of M_α and L_α. The cofundamental basis is explicitly excluded, with the authors stating that it does not have noteworthy properties.","tokens_in":23899,"tokens_out":38855,"duration_ms":346934,"significance":"If the missing proof details are supplied, the paper delivers the complete Hopf-algebra structure (product, coproduct, antipode) on the fundamental basis of sQSym and the natural superspace analogue of the classical Schur-to-fundamental expansion, providing strong confirmation that the definition of L_α from [6] is the right one. The paper has real strengths: the coproduct proof (Prop 3.1) is clean; the antipode recursion is explicit and algorithmic, with the noncommutative signs spelled out; the arguments reduce to the published monomial-basis results of [6] and the duality results of [1], with no fitted parameters or assumed target formulas; and the worked examples (Figures 3, 7, 8) check the signed product and the antipode in small cases. The principal risk is the unproved bijection φ underlying Proposition 4.6, which is load-bearing for the product formula; the proof of Proposition 6.3 is also compressed. Both issues appear fixable in a revision.","major_comments":[{"comment":"The central bijection φ: S1 → S2 is asserted, not proved. The forward construction is described in detail, but the proof ends with 'It is not difficult to see that these steps can be reversed and φ is a bijection', and neither of the two required properties is established. (a) Reversal is not immediate: when a − (γ'_i + ... + γ'_k) or γ'_i + ... + γ'_{k+1} − a is zero, the diagonal step of P degenerates to a vertical or horizontal step, and the inverse map must decide whether a given H/V step of P came from a genuine step of Q or from a degenerate split of a non-dotted part γ_h; injectivity and surjectivity at these degenerate configurations are exactly what needs proof. (b) Sign preservation sign(P) = sign(Q) is never argued: the sign of Q counts dots below Q in the (α,β)-grid where both a w_α entry and a w_β entry are dotted, while the sign of P counts dots below P in the coarser (α',β')-grid; the deformation replaces runs of H/V steps by single diagonal steps and changes the grid cellulation, so equality of the dot counts is not evident and requires a proof or a direct sign-preserving reformulation. Relatedly, the claim preceding the definition of fundamental paths that 'the set of paths we obtain does not depend on which permutations w_α and w_β we choose' is also stated without proof, although it is needed for the set in (4.1) to be well defined. Since (4.1) is the product formula that motivates the paper, a complete proof of the bijection and of the sign equality must be supplied.","section":"Section 4, proof of Proposition 4.6"},{"comment":"The coefficient matching for the Schur expansion is compressed past the point of verification. The key sentence 'if β ≼ comp(T), then a tableau T of weight β can be obtained by merging and relabeling the letters of T' is the crux of the equality (6.2), but the merge step is not shown to preserve the s-tableau rules of [9]: merging letters i and i+1 must keep each added cell a horizontal strip, must keep the circle-movement condition (a moved circle stays one row below its original position), and in the fermionic case must respect the 'new circle' column condition. The sign statement ('with the same sign since the standardisation does no change the order of the circles') also needs a justification, since inv(T) is read from the word of circle fillings while standardization changes letter values throughout the tableau. The companion assertion that std(T) is dot-standard of the same shape is motivated by the sentence that follows it, but the inverse direction deserves an explicit bijection between s-tableaux of weight β and the monomial summands of L_comp(T).","section":"Section 6, proof of Proposition 6.3"}],"minor_comments":[{"comment":"The third corner is printed as '(j, i − 1)' and should read '(i, j − 1)'.","section":"Section 4, definition of Cell (i,j)"},{"comment":"Example 4.8 states that α = (˙2, 1) and β = (˙1, 2), which is the swap of the pair ((˙1, 2), (˙2, 1)) used in Example 4.7 and Figure 3; the two should be reconciled.","section":"Example 4.8"},{"comment":"'Partial partial order' should be 'partial order'.","section":"Figure 1 caption"},{"comment":"In the displayed sum over Z, the range should be {1, . . . , n+m−1} \\ E(α) rather than {1, . . . , n−1} \\ E(α), since the monomial in (2.5) runs over n+m indices.","section":"Proof of Proposition 2.11"},{"comment":"In the definition of the sets B and C, 'α ⊙ β ≼ σ' should read 'σ ≼ α ⊙ β' to match the surrounding argument.","section":"Proof of Proposition 5.2"},{"comment":"The sign cancellations for the case where α1 is dotted are summarized in a single sentence and should be displayed in full; also 'equalites' is a typo for 'equalities'.","section":"End of the proof of Theorem 5.3"}],"recommendation":"major_revision","confidential_remarks":"I would condition acceptance on a complete proof of the bijection φ in Proposition 4.6, including the sign equality sign(P) = sign(Q), and on an expanded proof of Proposition 6.3. The manuscript builds on the authors' own JCTA 2019 paper [6], but the cited results are published and are used as inputs, not as conclusions, so I see no circularity. The paper fits math.CO well and the worked examples are a genuine asset; the product-formula gap is the only matter that stands between the current version and a convincing paper."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Plainly: the paper is a serious and mostly-correct structural study, but the proof of its key product formula is incomplete. The bijection φ in Proposition 4.6 is not shown to be invertible or sign-preserving, and that is a load-bearing gap. Everything else is in decent shape.\n\nThe genuinely new content is the signed shuffle product formula (Prop. 4.6), the antipode recursion using the column decomposition (Section 5), and the Schur expansion via dot-standard tableaux (Prop. 6.3). The coproduct was already in [1] and the fundamentals were defined in [6], so the credit goes to those three results. The antipode section is genuinely clever: the column decomposition (5.23) plus the recursion (5.24) gives a workable algorithm, and the non-super case drops out correctly. The Schur expansion is a natural extension, and the standardization argument, while brief, is plausible.\n\nThe soft spot is Section 4. In the proof of Proposition 4.6, the map φ is described only in the forward direction. The sentence “It is not difficult to see that these steps can be reversed and φ is a bijection” is doing real work, and the sign equality sign(P) = sign(Q) is asserted without argument. The sign for a fundamental shuffle is counted in the (α,β)-grid with dots placed where wα and wβ entries are simultaneously dotted, while the overlapping-shuffle sign is counted in the coarser (α′,β′)-grid. The deformation changes the grid and the relevant dot placement; the worked examples (Figures 3, 7, 8) do not cover the general case. Since the product formula is the engine of the paper—the antipode recursion and likely the Schur expansion rely on the algebra structure—this is a genuine gap. I do not think the statement is false; the examples are consistent and the pattern looks right. But as written, the proof is incomplete.\n\nMinor issue: the proof of Proposition 6.3 is compressed; the correspondence between monomials and tableaux is asserted rather than fully shown. That is secondary.\n\nWho this is for: researchers in combinatorial Hopf algebras, quasisymmetric functions, and superspace analogues. It deserves a serious referee rather than a desk rejection. My recommendation: send it to review, and ask the authors to supply the missing bijection reversal and the sign-preservation argument for φ before acceptance.","headline":"The signed product formula for fundamentals in superspace is likely correct, but the proof hinges on an unproved bijection that the authors must fix.","tokens_in":24465,"tokens_out":3539,"would_cite":true,"duration_ms":34949,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05E05","16T30"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper derives explicit product, coproduct, antipode, and Schur expansions for fundamental quasisymmetric functions in superspace.","keywords":["fundamental quasisymmetric functions","superspace","dotted compositions","Hopf algebra","antipode","Schur functions in superspace","shuffle product","standard tableaux"],"falsifier":"Enumerate all pairs $(Q,\\gamma')$ for a small example with multi-cell diagonal steps, such as $\\alpha=(\\dot{1},4)$ and $\\beta=(\\dot{2},\\dot{3},3)$, apply the map $\\varphi$, and compare $\\operatorname{sign}(P)$ with $\\operatorname{sign}(Q)$; a single mismatch, or a pair not reached, would disprove Proposition 4.6. Symbolically expanding both sides of equation (4.2) into monomials for the same example provides an independent check of the coefficient equality.","tokens_in":23487,"feed_emoji":"🧮","tokens_out":10042,"duration_ms":91548,"temperature":0.7,"pith_summary":"The paper works out the full algebraic structure of the fundamental quasisymmetric functions in superspace, a basis for functions of both commuting and anticommuting variables indexed by dotted compositions. It proves that the product of two such functions expands as a signed sum over fundamental shuffles, that the coproduct splits into concatenations and near-concatenations, and that the antipode can be computed by a recursive column algorithm. It also extends to superspace the classic expansion of skew Schur functions into fundamental quasisymmetric functions, with signs governed by dot-standard tableaux. If the results are right, superspace symmetric functions enjoy the same combinatorial control that fundamental quasisymmetric functions provide in the ordinary setting.","feed_headline":"Signed shuffles control superspace quasisymmetric functions","feed_subtitle":"A signed shuffle product, a near-concatenation coproduct, and a column algorithm pin down the Hopf structure.","key_machinery":"The load-bearing objects are dotted compositions, compositions whose parts may carry a dot to record the anticommuting variables, together with three sets attached to them: $D(\\alpha)$ (descent-like partial sums), $E(\\alpha)$ (interior positions of dotted parts), and $F(\\alpha)$ (partial sums at dotted parts). These sets give a practical criterion for the strong refinement order and a compact formula for $L_\\alpha$ as a constrained sum. The product formula is carried by the fundamental shuffle, a lattice path in the grid formed by the two factors that may step horizontally, vertically, or diagonally across several cells when dotted labels are involved, with sign $(-1)^{d}$, where $d$ is the number of dotted cells below the path. The proof of the product formula hinges on a sign-preserving bijection $\\varphi$ between fundamental shuffles together with refinements and overlapping shuffles together with refined factor compositions. The antipode algorithm rests on two bilinear operations $\\bullet$ and $\\odot$ on monomial quasisymmetric functions in superspace, corresponding to concatenation and near-concatenation, and on the unique decomposition of a dotted composition into columns.","core_discovery":"The central claim is that the fundamental quasisymmetric functions in superspace $L_\\alpha$ form a Hopf algebra, meaning an algebra equipped with a compatible product, coproduct, and antipode, with fully explicit operations on the fundamental basis. The product is $L_\\alpha L_\\beta = \\sum_\\gamma \\operatorname{sign}(\\gamma) L_\\gamma$, where the sum runs over fundamental shuffles of $\\alpha$ and $\\beta$ and the sign is $(-1)$ raised to the number of dotted cells below the shuffle path. The coproduct is $\\Delta(L_\\alpha) = \\sum L_\\eta \\otimes L_\\gamma$ over decompositions $\\alpha = \\eta \\cdot \\gamma$ and $\\alpha = \\eta \\odot \\gamma$, where $\\cdot$ is concatenation and $\\odot$ is near-concatenation. The antipode is obtained by decomposing any dotted composition into columns, using the column formula $S(L_\\alpha) = (-1)^{\\ell(\\alpha)+\\binom{m_\\alpha}{2}} \\sum_\\beta L_\\beta$ over maximal dotted compositions $\\beta$ with $\\beta \\unrhd \\operatorname{rev}(\\alpha)$, and recombining with the $\\bullet$ product. Finally, the skew Schur function in superspace satisfies $s_{\\Lambda/\\Omega} = \\sum_T (-1)^{\\operatorname{inv}(T)} L_{\\operatorname{comp}(T)}$, summed over dot-standard $s$-tableaux $T$ of shape $\\Lambda/\\Omega$.","pith_inferences":["Editorial inference: the set encoding via $D(\\alpha), E(\\alpha), F(\\alpha)$ is likely to support transfer-matrix or generating-function algorithms for multiplying fundamentals, avoiding explicit path enumeration.","Editorial inference: the sign-preserving bijection $\\varphi$ suggests a hidden associativity at the level of fundamental shuffle paths; making the bijection fully explicit could yield a direct proof that the path product is associative, independent of the underlying algebra.","Editorial inference: because the cofundamental basis is set aside for lacking explicit product and antipode formulas, the paper indirectly raises the question of which bases in superspace are good; a dual analysis through noncommutative ribbon Schur functions might reveal that cofundamentals should be replaced by a different indexing convention."],"forward_implications":["Any product $L_\\alpha L_\\beta$ can be written as an explicit finite signed sum of fundamentals indexed by lattice paths, without solving linear systems.","The antipode of a fundamental can be evaluated by a terminating algorithm: split the dotted composition into columns, apply the closed column formula, and stitch the results together with the $\\bullet$ product, with signs from the fermionic degrees.","Skew Schur functions in superspace decompose into fundamentals with coefficients $\\pm 1$, indexed by dot-standard $s$-tableaux, matching the ordinary case where Schur functions expand into fundamentals with standard tableaux.","The formulas determine the product, coproduct, and antipode on the fundamental basis, giving a complete Hopf-algebra description of quasisymmetric functions in superspace analogous to the classical theory."],"supporting_citations":[{"why":"It defines the monomial basis, the two partial orders on dotted compositions, the fundamental basis $L_\\alpha$, and the antipode on monomials, which every later proof builds on.","marker":"[6]"},{"why":"It supplies the dual Hopf algebra of noncommutative ribbon Schur functions in superspace and the antipode formulas that verify the coproduct and guide the antipode computations.","marker":"[1]"},{"why":"It gives the non-superspace shuffle product and the $D(\\alpha)$ inclusion criterion for strong refinement that the fundamental shuffle and set encoding generalize.","marker":"[8]"},{"why":"It provides the overlapping-shuffle and lattice-path framework for quasisymmetric Schur functions that fundamental shuffles and their sign convention extend to superspace.","marker":"[10]"},{"why":"It defines Schur functions in superspace, superpartitions, and $s$-tableaux, the objects appearing in the Schur expansion of Proposition 6.3.","marker":"[9]"}],"fun_headline_variants":["Superspace quasisymmetric functions form a Hopf algebra","Signed shuffles define Hopf structure on superspace quasisymmetrics","Explicit product, coproduct, antipode for superspace quasisymmetrics","Superspace Schur functions expand into quasisymmetric basis"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The signed product formula rests on a bijection between two kinds of lattice-path shuffles constructed in the proof of Proposition 4.6; the paper asserts that the construction can be reversed and preserves the sign, but does not prove this in full detail.","fun_headline_variants_meta":{"raw":{"variants":["Superspace quasisymmetric functions form a Hopf algebra","Signed shuffles define Hopf structure on superspace quasisymmetrics","Explicit product, coproduct, antipode for superspace quasisymmetrics","Superspace Schur functions expand into quasisymmetric basis"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.00077,"raw_usage":{"total_tokens":3388,"prompt_tokens":900,"completion_tokens":2488,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":516,"completion_tokens_details":{"reasoning_tokens":2410}},"tokens_in":516,"tokens_out":2488,"duration_ms":17101,"temperature":1.0,"reasoning_tokens":2410,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T16:29:25.916309+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Enumerate all pairs $(Q,\\gamma')$ for a small example with multi-cell diagonal steps, such as $\\alpha=(\\dot{1},4)$ and $\\beta=(\\dot{2},\\dot{3},3)$, apply the map $\\varphi$, and compare $\\operatorname{sign}(P)$ with $\\operatorname{sign}(Q)$; a single mismatch, or a pair not reached, would disprove Proposition 4.6. Symbolically expanding both sides of equation (4.2) into monomials for the same example provides an independent check of the coefficient equality.","supporting_citations":[{"cited_title":"Hop f algebra structure of symmetric and quasisymmetric functi ons in superspace","cited_arxiv_id":null,"evidence_quote":"It defines the monomial basis, the two partial orders on dotted compositions, the fundamental basis $L_\\alpha$, and the antipode on monomials, which every later proof builds on."},{"cited_title":"On the Hopf algebra of noncommutative symmetric functions in superspace","cited_arxiv_id":"2205.11813","evidence_quote":"It supplies the dual Hopf algebra of noncommutative ribbon Schur functions in superspace and the antipode formulas that verify the coproduct and guide the antipode computations."},{"cited_title":"Grinberg and V","cited_arxiv_id":null,"evidence_quote":"It gives the non-superspace shuffle product and the $D(\\alpha)$ inclusion criterion for strong refinement that the fundamental shuffle and set encoding generalize."},{"cited_title":"An introduction to quasisymmetric Schur functions","cited_arxiv_id":null,"evidence_quote":"It provides the overlapping-shuffle and lattice-path framework for quasisymmetric Schur functions that fundamental shuffles and their sign convention extend to superspace."},{"cited_title":"Pieri rules for Schur funct ions in superspace","cited_arxiv_id":null,"evidence_quote":"It defines Schur functions in superspace, superpartitions, and $s$-tableaux, the objects appearing in the Schur expansion of Proposition 6.3."}],"review_version":1}