REVIEW 4 major objections 5 minor 3 references
Constructive Method for Finding the Coefficients of a Divided Symmetrization
T0 review · 4 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash
Pith's one-line read Divided symmetrizations of 2-hook partitions over path graphs have a Schur expansion whose terms and coefficients are produced by two finite combinatorial constructions.
desk verdict The main completeness theorem is false: N contains λ_n+ω_n by the paper's own definition, but the 2-hook construction never produces it, so Theorem 4.3 misses the s_{λ_n} term. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing objects are 2-hook permutations: integer $n$-tuples $t$ whose coordinates are a permutation of $\{1,\dots,n\}$ with $t_1=n$ and $t_n=1$, obtainable by satisfying $\lambda_n+\omega_n+v(E)=t$ for some pair set $E$. The strong 2-hook construction builds each such tuple by placing decreasing values on legal indices while carrying a pair set, and the induction relating states on $n$ and states on $n-1$ runs through $\alpha$-correspondence, a bijection between available indices that preserves the quantities $s$ and $M$ controlling legality. The coefficient computation then uses arc breaking: replacing pairs $(a,c)$ by $(a,b),(b,c)$ over a marked index $b$, which preserves the vector sum $v(E)$ and therefore justifies the same $t$. This identity, $v(E_a)=v(E_b)$, is what lets the paper sum justifying pair sets by sign without recomputing the algebraic expansion.
What would settle it
For a fixed small $n$, such as $n=5$ or $6$, enumerate all tuples $t$ for which some pair set $E\subseteq E_n$ satisfies $\lambda_n+\omega_n+v(E)=t$ with distinct coordinates, and compare that list with the outputs of the strong 2-hook construction; the paper's claim fails if the lists differ. A second check would test Theorem 4.2 by searching for a justifying pair set for a 2-hook permutation that cannot be obtained from the placement solution by arc breaks restricted to marked indices.
Extended reading notes
Core claim
The central result, Theorem 4.3, states that for the 2-hook $\lambda_n=(2,1,\dots,1,0)$ and any path graph $G$ on $n$ vertices, $\overrightarrow{D}_{\lambda,G}$ equals $$\sum_{t\in N_{\lambda_n,E_n}}\left(\sum_{E\in \mathcal{E}_t \cap \mathcal{P}(E_n-E(G))}(-1)^{|E|}\right)s_{l(t)},$$ where $N_{\lambda_n,E_n}$ is the set of 2-hook permutations, $\mathcal{E}_t$ is the set of all justifying pair sets for $t$, and $l(t)$ is the partition obtained by sorting the coordinates of $t$ and shifting by $(n-1,n-2,\dots,0)$. The paper proves that the strong 2-hook construction generates exactly the 2-hook permutations and that every justifying pair set can be reached from the construction's placement solution by breaking arcs only over marked indices. This yields the first complete combinatorial description of the Schur expansion for this family of divided symmetrizations.
Load-bearing premise
The load-bearing premise is that the four $\alpha$-correspondences asserted in the proof of Theorem 3.2, said to follow from basic calculations that are not shown, are all correct for every reachable state; if any one fails, the strong 2-hook construction could miss legitimate 2-hook permutations or include invalid ones, and the same inductive link would damage Theorem 4.2.
Editorial extensions
If this is right
- For every path graph $G$, the Schur expansion of $\overrightarrow{D}_{\lambda_n,G}$ is determined by the finite list of 2-hook permutations, so computing the expansion reduces to enumerating those permutations and their marked-arc breakings.
- Each coefficient is a signed count of justifying pair sets reachable by arc breaks over marked indices; this replaces algebraic expansion with a purely combinatorial sign sum.
- The number of terms satisfies $N_n=a(n-3)$ with $a(0)=1$, $a(1)=2$, $a(n)=4a(n-1)-2a(n-2)$, giving an exact count of the 2-hook permutations for each $n$.
- Because every $t\in N_{\lambda_n,E_n}$ other than $\lambda_n+\omega_n$ has $l(t)$ a hook-shaped partition, the Schur functions appearing in the expansion are only of hook shape.
Reading between the lines
- The paper explicitly notes that a 3-hook has multiple pair sets that cannot be reduced to a single placement solution, so the arc-breaking mechanism appears special to 2-hooks; a natural extension would be to identify the largest family of partitions for which a marked-arc reachability description still exists.
- A testable extension is to turn the $\alpha$-correspondence induction into a recursive algorithm that generates coefficients in time proportional to the number of 2-hook permutations, which the recurrence suggests grows roughly like $(2+\sqrt{2})^n$.
- The signed sum over arc-breakable pair sets resembles an evaluation of a graph invariant, so one could ask whether the coefficient of $s_{(2,1^{n-2})}$ in $\overrightarrow{D}_{\lambda_n,G}$ has a direct interpretation as a Tutte-polynomial or matching-polynomial evaluation.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies the divided symmetrization operator for partitions λ of length n and graphs G containing a path, focusing on the 2-hook shape λ_n=(2,1,...,1,0). It defines a set N of exponent vectors that can occur in the expansion and claims a combinatorial construction, the '2-hook construction', that generates exactly these vectors. A strengthened version, the 'strong 2-hook construction', is supposed to produce, for each such vector, a justifying pair set used to compute the coefficient. The main result, Theorem 4.3, gives a Schur-function expansion of the divided symmetrization in which the index set is N and each coefficient is an alternating sum over justifying pair sets obtained by arc breaks over marked indices. Section 5 gives a recurrence and a closed formula for the size of N.
Significance. If the main claims are correct, the paper supplies a fully combinatorial, constructive description of the Schur expansion for a previously unsolved family of divided symmetrizations. The intended mechanism—a state construction with associated pair sets plus an arc-breaking rule for recovering all justifications—is natural and would be a genuine extension of Postnikov's and Petrov's results. The statements are concrete and falsifiable, and the running example illustrates the intended combinatorics clearly. However, the manuscript as written has not secured these claims: the definition of the set being enumerated is internally inconsistent, the construction demonstrably misses a term under the literal reading of Lemma 2.1, and several load-bearing inductive verifications are asserted rather than shown.
major comments (4)
- [Sections 2 and 3] The construction does not enumerate the set defined in the paper. Under Lemma 2.1, the tuple λ_n+ω_n is justified by the empty pair set and has distinct coordinates, so it belongs to N_{λ_n,E_n}; it also has empty justifying pair set whenever the empty set is allowed in the coefficient sum. But the 2-hook construction starts from (n,0,...,0), never changes the first coordinate, and places the values n,n-1,...,1, so every completed tuple is a permutation of [n]. Since λ_n+ω_n has first coordinate n+1, it can never be produced. The proof of Theorem 3.2 explicitly begins with vectors t for which t_1,...,t_n form a permutation of [n] with t_1=n and t_n=1, thereby excluding this case. Thus Proposition 3.1 and Theorem 3.2 are false as stated. If the intended object is only the nontrivial 2-hook permutations, that should be stated, and the omitted s_{λ_n} term must be added separately in Theorem 4.3; if the intended object is the full N, the construction is incomplete.
- [Section 2] The set N_{λ,E} is not well defined because the exponent formulas are inconsistent. The rewriting immediately before equation (1) gives terms of the form λ+o_{E(G)}+v(E) with E ⊆ E_n-E(G), while Lemma 2.1 writes λ+ω_n+v(E). These are not the same: for n=3 and G=P_3, λ+o_G=(3,2,0) but λ+ω_n=(4,2,0). Since every subsequent statement about which tuples are '2-hook permutations' depends on the exponent convention, the paper must state which definition of N is being used and reconcile Lemma 2.1 with the preceding derivation.
- [Section 3] The induction proving completeness of the strong 2-hook construction depends on four asserted α-correspondences between states on n and states on n-1. These are introduced with the phrase 'Basic calculations using our rules show...' and none of the four correspondences is verified; the α-correspondence must simultaneously match the sets of available indices, the marking status, the vectors s and M, and the subsequent legal placements. Because the correctness of the induction and of the completeness argument rests on these assertions, the verification cannot be omitted. Please provide explicit checks or a standalone lemma with proof.
- [Section 4] The proof that every justifying pair set is obtainable by arc breaks over marked indices is incomplete in the case t_k=n-1 with k>2. The construction of E^b_A and E^b_B, the claim that these justify t_A and t_B, and the transfer of the arc-break sequences back to E_a are all asserted rather than proved; the notation is also inconsistent, since E^a_A is defined using E instead of E_a. Since Theorem 4.3's coefficient formula relies on this statement, the proof needs to be completed or the statement reorganized as a separate lemma with a full argument.
minor comments (5)
- [Section 3] The condition defining α-correspondence for states repeats the same expression on both sides: it reads |[n_a-1]-I(p_{S_a})| = |[n_a-1]-I(p_{S_a})|; the second term should be |[n_b-1]-I(p_{S_b})|.
- [Section 3] In the rules for unmarked placements, the text says 'in the state S′ formed by a legal placement on index k and marking the index' in both the marked and unmarked cases; the second occurrence should say 'unmarking the index'.
- [Section 3] The bullet condition 'If x_i^S = x_o^S and k = y_i^S and k = y_i^S' contains a duplicated clause; it should presumably be 'k = y_i^S' only.
- [Section 3] The displayed justifying pair set in the running example lists (2,5) twice; a set should be written without repetition.
- [Theorem 4.3] The index set in Theorem 4.3 is written as N_{λ_n,E_n}, which is independent of G, while the coefficient sum depends on G through E(G); the surrounding text works with N_{λ_n,E_n-E(G)}. Please clarify the intended index set. The same ambiguity affects Lemma 5.1, where N_{λ_n,E_n} is counted as if it were large, although the literal definition of N_{λ,E_n} with E=E_n gives only the singleton {λ_n+ω_n}.
Circularity Check
No circularity: Theorem 4.3 is assembled from the defining expansion (1), Lemma 2.1, and independently proven constructions for N and the justifying pair sets.
full rationale
The derivation chain is not circular. The paper starts from the definition of divided symmetrization and rewrites it as a sum over terms t with distinct coordinates, giving Eq. (1) with coefficients computed by Lemma 2.1 as sums over justifying pair sets. The 2-hook construction in Section 3 is an auxiliary combinatorial object; Proposition 3.1 and Theorem 3.2 give proofs that the construction enumerates exactly the set N_{lambda_n,E_n}, and they do not assume Theorem 4.3. Similarly, Theorem 4.2 is an independent structural claim that every justifying pair set for a fixed t is reachable from the placement solution by arc breaks over marked indices; the induction uses the definitions of alpha-correspondence and the placement rules rather than importing the coefficient formula. Theorem 4.3 then merely substitutes these two proven characterizations into Eq. (1). No fitted parameter is later renamed as a prediction, no self-citation carries a load-bearing premise, and no target result is used as an input. The unshown 'basic calculations' in the induction of Theorem 3.2 are a possible completeness gap, but a gap in proof is not circularity.
Assumptions & free parameters
assumptions (4)
- standard math Schur function expansion formula: the sum over permutations of sign(delta) x_delta^t divided by the Vandermonde product equals s_{l(t)} when t has distinct coordinates.
- standard math Expansion of the product over edges (x_i - x_j) as a signed sum over subsets E of x^{sum_{e in E} v(e)} with v(e) = -e_a + e_b.
- domain assumption Postnikov's Theorem 4.3 giving the path-graph evaluation for all partitions lambda.
- ad hoc to paper The four alpha-correspondences between states on n and states on n-1 listed in the proof of Theorem 3.2.
Cite this review
Pith. "Pith review of Constructive Method for Finding the Coefficients of a Divided Symmetrization." pith.science (2026). https://pith.science/paper/MFPYFGDQ
@misc{pith2026190808161,
author = {Pith},
title = {Pith review of: Constructive Method for Finding the Coefficients of a Divided Symmetrization},
year = {2026},
howpublished = {\url{https://pith.science/paper/MFPYFGDQ}},
note = {Machine review of arXiv:1908.08161}
}
abstract
We consider a type of divided symmetrization $\overrightarrow{D}_{\lambda,G}$ where $\lambda$ is a nonincreasing partition on $n$ and where $G$ is a graph. We discover that in the case where $\lambda$ is a hook shape partition with first part equal to 2, we may determine the expansion of $\overrightarrow{D}_{\lambda,G}$ over the basis of Schur functions. We show a combinatorial construction for finding the terms of the expansion and a second construction that allows computation of the coefficients.
Reference graph
Works this paper leans on
-
[1]
Permutohedra, associahedra, and beyond
Alexander Postnikov. Permutohedra, associahedra, and beyond. International Mathematics Re- search Notices (2009),
work page 2009
-
[2]
Combinatorial and Probabilistic Formula e for Divided Symmetrization
Fedor Petrov. Combinatorial and Probabilistic Formula e for Divided Symmetrization. Discrete Mathematics (2015)
work page 2015
-
[3]
Explicit Computations with the Di vided Symmetrization Operator (2014) 15
Tewodros Amdeberhan. Explicit Computations with the Di vided Symmetrization Operator (2014) 15
work page 2014
Reviewed August 14, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.