REVIEW 3 major objections 4 minor 5 references
Gamma-positivity for octopuses: a bijective proof
T0 review · 3 major / 4 minor · reviewed 2026-08-14 · deepseek-v4-flash
Pith's one-line read For the lopsided-octopus family, the lattice-point polynomial has a gamma-positive expansion with explicit nonnegative coefficients, and the proof is bijective.
desk verdict A useful, largely correct bijective treatment of gamma-positivity for octopus arbor polytopes, but Section 3 leaves the key box bijection unproved and needs a formal inverse before acceptance. 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 central object is a weight-preserving bijection from lattice points of the polytope to pictures consisting of $n$ dots labeled $1,\dots,n$, with each dot circled black or red or left alone, and with an optional box enclosing the two dots of each doubleton leaf. A circled dot records a nonzero coordinate, and a black circle inside a box records the special case where a doubleton-leaf coordinate equals $2$. Reducing a picture by deleting black circles that are not in boxes and deleting red circles whose labels are also circled red yields a primitive picture; the number of primitive pictures with $j$ circled dots is exactly $\gamma_j(\tau)$. The machinery converts the polynomial identity into a two-step count of primitive objects: choose which labels are circled red and which dots are circled red, avoiding the forbidden coincidences, and then incorporate the $2^i\binom{k_2}{i}$ choices for the boxes.
What would settle it
Enumerate the lattice points of the smallest lopsided octopus, $\tau_{4,0,1}$, given by $x_1+x_2\le 2$, $x_i\ge 0$, and $x_1+x_2+x_3+x_4\le 4$. If the paper's formula is correct, the generating function by number of positive coordinates is $1+12t+31t^2+12t^3+t^4$; in particular there must be exactly 31 lattice points with two positive coordinates. A direct count of the six possible support sets (for example, $\{1,2\}$ contributes one point, each other pair contributes six) settles whether the predicted coefficient is right.
Extended reading notes
Core claim
For a lopsided octopus $\tau=\tau_{n,k_1,k_2}$ with $k=k_1+2k_2\le n$, the paper claims that $$h(\tau,t)=\sum_{j=0}^{\lfloor n/2\rfloor}\gamma_j(\tau)t^j(1+t)^{n-2j}$$ with $$\gamma_j(\tau)=\sum_{i=0}^{k_2}2^i\binom{k_2}{i}\binom{n-k}{j-i}\binom{n-j-i}{j-i}.$$ This is proved by a bijection between the lattice points of the polytope and combinatorial objects made of labeled dots, red and black circles, and boxes around the two dots in each doubleton leaf. The number of nonzero coordinates of a lattice point equals the number of circled dots in the corresponding object, and deleting all black circles outside boxes together with all red circles whose labels are also circled red sends any object to a primitive object. The primitive objects with exactly $j$ circled dots are then counted by $\gamma_j(\tau)$, and the factor $(1+t)^{n-2j}$ comes from the $n-2j$ independent choices that add one circled dot to a primitive object. Taking $k_2=0$ recovers the known octopus formula $\binom{n-k}{j}\binom{n-j}{j}$.
Load-bearing premise
The proof rests on the claim that the map from lattice points of the polytope to pictures of dots, circles, and boxes is one-to-one, including the new case in Section 3 where a coordinate inside a doubleton leaf equals $2$; this is introduced by an example and the phrase 'Examining this bijection...' rather than by an explicit inverse, so a gap in that correspondence would invalidate the primitive-object counts and the gamma formula.
Editorial extensions
If this is right
- Every lopsided octopus polynomial $h(\tau_{n,k_1,k_2})$ is palindromic and unimodal, since gamma-positivity implies both properties; this confirms the palindromicity and unimodality conjecture for this family.
- When $k_2=0$, the gamma-coefficient formula reduces to $\binom{n-k}{j}\binom{n-j}{j}$, so the earlier computational octopus result is recovered and reproved bijectively.
- Each coefficient $\gamma_j(\tau)$ counts the primitive circled-dot objects with $j$ circled dots, giving a concrete combinatorial interpretation of the gamma-expansion.
- Every object with $j$ circled dots is obtained from a primitive object by independently choosing among $n-2j$ allowed labels to add one black circle or one paired red circle, which is exactly the source of the factor $(1+t)^{n-2j}$.
Reading between the lines
- Beyond the paper, the same encoding is likely to produce a bijective proof for the generalized polytopes $Q_{n,d,k}$ mentioned in Remark 2.6, by keeping $n+d$ dots with only the first $n$ labeled; the paper notes the idea but leaves the details unwritten.
- Beyond the paper, the primitive-object reduction resembles a sign-reversing involution, so it is reasonable to test whether the same dot-box deletion proves gamma-nonnegativity for broader arbor classes whose leaves admit a similar pairing structure.
- Beyond the paper, the bijection suggests refined statistics: the positions of circled dots or the sizes of coordinates can be read off from the pictures, allowing $q$-analogues of $h(\tau)$ whose coefficients may track the total sum of coordinates rather than only the support size.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies arbor polytopes Q_tau and the lattice-point enumerator h(tau) introduced by Chapoton. For the class of octopus arbors tau_{n,k}, for which Athanasiadis, Xiao, and Yan proved gamma-positivity by computational methods, the paper proposes a bijective encoding of the lattice points by objects consisting of dots, labels, and red/black circles. It then extends the same encoding to a larger class of lopsided octopuses tau_{n,k1,k2}, where some leaves are doubletons, and derives an explicit gamma-coefficient formula gamma_j(tau)=sum_{i=0}^{k2} 2^i binom(k2,i) binom(n-k,j-i) binom(n-j-i,j-i), with k=k1+2k2. The formula reduces to the known octopus case when k2=0, and the small cases checked by this referee are consistent with direct enumeration.
Significance. If the bijections are made fully rigorous, the paper delivers the bijective proof requested by Athanasiadis, Xiao, and Yan and extends gamma-positivity to a larger family with an explicit, parameter-free coefficient formula. The combinatorial primitive-object strategy is natural, and the resulting coefficients are manifestly nonnegative, which would imply palindromicity and unimodality for this family. The main unresolved point is not the formula itself but the missing formal proof of bijectivity of the encodings, especially the new box rule in Section 3.
major comments (3)
- [§2, construction of O_{n,k}] The purported bijection between T_{n,k} and O_{n,k} is not actually proved. After describing the forward construction, the manuscript states 'It can be verified that this is a bijection' and gives an example, but no inverse map, no injectivity proof, and no surjectivity proof are supplied. Because this bijection is the advertised bijective proof of Proposition 1.1, this gap is load-bearing; a reader cannot verify that every object in O_{n,k} arises from exactly one tuple, particularly when black circles are present and affect the red-dot placement rule. Please give an explicit inverse and a proof.
- [§3, Definition 3.3 and Example 3.2] The new box encoding for the x_i=2 case is introduced by 'Examining this bijection gives the following definition' rather than by a formal extension of the bijection. The sentence that 'the uncircled dot inside the box is ignored when we start placing red circles around dots' changes the red-dot placement rule, but the paper never defines the resulting correspondence with enough precision to prove it is bijective. Without injectivity and surjectivity of this extended encoding, the count of primitive objects in Proposition 3.4, and therefore the gamma formula, remains conditional on an unverified correspondence.
- [§3, paragraph beginning 'To any object...'] The uniqueness of the primitive/nonprimitive decomposition is asserted but not proved. The manuscript says 'we can reverse these operations to construct all objects that are associated to a given primitive object,' but the reverse operations are not specified in the presence of boxes, and no argument is given that each object has exactly one primitive part with n-2j free positions. This uniqueness underlies the factor (1+t)^{n-2j} in the gamma expansion and must be proved for Proposition 3.4 to be established.
minor comments (4)
- [§2, first paragraph of the bijection] The notation k_1 in 'if i_1 is the smallest such index and x_{i_1}=k_1' appears to denote the numerical value of the coordinate rather than the parameter k_1 used in Section 3; this is confusing and should be replaced by an auxiliary variable such as m.
- [Examples 2.2, 2.3, and 3.2] The typeset dot-and-label diagrams are difficult to align, especially in the compressed arXiv rendering; the authors should ensure that each label appears clearly beneath its corresponding dot.
- [Remark 2.6] The remark about generalized polytopes Q_{n,d,k} is too terse to be verified; either give the analogous object definition and bijection, or note that this is only a sketch.
- [§3, footnote] The footnote 'One can imagine an octopus that skips k1 legs during leg day' is out of register for a formal journal article and should be removed.
Circularity Check
No significant circularity: the gamma formula in Proposition 3.4 is a parameter-free count of combinatorially defined primitive objects, not an input or a fitted quantity.
full rationale
The paper's central new result, Proposition 3.4, is derived by translating lattice points of lopsided octopus polytopes into decorated dot objects and then counting primitive objects in the gamma-basis. No parameter is fitted to the target polynomial, and no external result is invoked to force the formula. The count of primitive objects is explicit: choose i boxed pairs (2^i * C(k2,i) ways), then choose j-i red labels from [k+1,n] and j-i red dots outside boxes, yielding the stated sum. This is a genuine enumeration rather than a restatement of the desired gamma coefficients. The assertions that the map T_{n,k1,k2} -> O_{n,k1,k2} is a bijection and that every object decomposes uniquely into a primitive part plus free modifications are not fully proved in the text (Section 3: 'Examining this bijection gives the following definition'), but that is a proof gap, not circularity: the missing verification is an independent combinatorial fact that would justify the same conclusion. The paper also self-containedly reproves the known octopus result (Proposition 1.1) with an explicit object bijection and does not rely on self-citations for its load-bearing steps; the cited prior work [4,5] supplies the conjecture and an earlier computational proof, not the new derivation. Hence no step reduces by construction to its own inputs.
Assumptions & free parameters
assumptions (3)
- domain assumption Arbor polytope Q_tau and lattice-point polynomial h(tau) are defined as in Chapoton [5], including the constraint that each vertex v contributes the inequality sum_{i in D(v)} x_i <= |D(v)|.
- standard math A weight-preserving bijection between T_{n,k1,k2} and O_{n,k1,k2}, with number of circled dots equal to the number of nonzero entries, implies equality of the corresponding generating functions.
- ad hoc to paper Every lattice point with a coordinate equal to 2 inside a doubleton leaf is encoded uniquely by a box containing one black circle, and this encoding is compatible with the primitive-object count.
Cite this review
Pith. "Pith review of Gamma-positivity for octopuses: a bijective proof." pith.science (2026). https://pith.science/paper/SN2WGGLC
@misc{pith2026260813247,
author = {Pith},
title = {Pith review of: Gamma-positivity for octopuses: a bijective proof},
year = {2026},
howpublished = {\url{https://pith.science/paper/SN2WGGLC}},
note = {Machine review of arXiv:2608.13247}
}
abstract
Chapoton introduced an interesting family of polytopes called arbor polytopes, where a polytope $\mathcal{Q}_\tau$ is associated to any arbor $\tau$. Chapoton conjectured that the polynomial $h(\tau)$ which counts lattice points in $\mathcal{Q}_\tau$ by number of nonzero entries is palindromic and unimodal. Athanasiadis, Xiao, and Yan recently proved that $h(\tau)$ is gamma-positive for a certain class of arbors they call octopuses. Since their proof was computational, they asked for one that is bijective. We present such a proof. We also extend their results by showing that $h(\tau)$ is gamma-positive for a larger class of arbors we call lopsided octopuses.
Figures
Reference graph
Works this paper leans on
-
[1]
C. A. Athanasiadis. Gamma-positivity in combinatorics and geometry.S´ em. Lothar. Combin., 77:Art. B77i, 64, 2018
work page 2018
-
[2]
C. A. Athanasiadis. Lattice point enumeration of polytopes associated to integer compositions. Annals of Combinatorics, pages 1–14, 2026
work page 2026
-
[3]
C. A. Athanasiadis and F. Chapoton. Polytopes and posets associated to preorders.arXiv preprint arXiv:2605.26916, 2026
work page Pith review arXiv 2026
-
[4]
C. A. Athanasiadis, Q. Xiao, and X. Yan. Lattice point enumeration of some arbor polytopes. arXiv preprint arXiv:2603.11654, 2026
arXiv 2026
- [5]
Reviewed August 14, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.