For every partition with at most four rows, the Schur function sλ(1,−1,t,t⁻¹) is either zero or ± a product of exactly three SU(2) characters read off the 2-quotient of λ — with no hypothesis on the shape of λ.
Part III (concept DOI 10.5281/zenodo.21438226) classified which SU(4) representations have identically-vanishing character on the non-identity component of O(4), and exported the underlying question about symmetric functions. This Part IV answers it with a closed form, of which that vanishing classification is exactly the zero locus. The alphabet {1,−1,t,t⁻¹} is the generic semisimple element of the determinant-−1 component of O(4); it sits between the reciprocal-pair factorisation programme of Ciucu–Krattenthaler and Ayyer–Behrend and the root-of-unity line of Littlewood, Prasad, Ayyer–Kumari and Karmakar, and belongs to neither. The obstruction that kept it untreated is one unstated hypothesis: the block argument needs every inversion-fixed point of the alphabet to contribute a constant row of the bialternant, which +1 does and −1 does not. Replacing the two fixed-point rows by even/odd column indicators repairs the argument at rank one, and not at rank two, which is where we stop and say so.
The actual result is a reduction, not the identity. Conditionally on the closed form, every quantity that survives Part III's leading cancellation — the whole tower of even moments of the twist-imbalance distribution δ(m) — factors through three integers read off the 2-quotient: Φ = F ∘ Q. An arbitrarily large four-row partition is compressed to (p,q,r) with no loss of anything the physics can see, and weight enumeration is replaced by explicit polynomial formulae. The normalised moment tower lives in the invariant ring ℚ[Cₚ,Cₔ,C]^{S₃} of the three SU(2) Casimirs; in particular the variance is one third of the sum of the three Casimirs.
Status, stated exactly. The closed form is an Observation: verified exhaustively by two independent implementations on all 3060 partitions with four parts ≤14 and all 4845 with parts ≤16, with no mismatch, against the bialternant in exact integer arithmetic — and not proved. The zero-locus statement is a Proposition, proved independently in Part III. Everything else is graded in the paper as Proposition, Observation, Inherited, or Open, and the grades are not blurred.
Honesty ledger. Several ingredients are classical and we claim none of them: that log-concavity is preserved under convolution (Hoggar 1974) and gives a unimodal spectrum (Stanley 1989); that the coefficient sequence is a threefold discrete-uniform convolution whose moments are polynomial, because cumulants of a discrete uniform are polynomial in its width and add (Neuschel; Bradley–Gupta); and that the distribution has a piecewise-polynomial closed form by inclusion–exclusion (De Moivre; André 1876; Comtet; the object is a discrete box spline, Dahmen–Micchelli 1988). The involution character value reproduced along the way is Karmakar (arXiv:2412.17324); read in full for version 3, his Thm. 1A is the first branch of the zero locus and his Thm. 1B is the 2-quotient factorisation at t = 1, so only free t is ours there. The mechanism — characters of a disconnected group on a non-identity component, that is, twining characters — is Jantzen (1977) and Kumar–Lusztig–Prasad (2009), cited from version 3 onward; the surrounding programme is Nadimpalli–Pattanayak–Prasad (arXiv:2504.14684). Ours are: the closed form itself at free t, the fixed-point-pair repair, the second branch of the zero locus, the reduction Φ = F ∘ Q, and the Casimir reading of the moments. Rank two is open, and the shape of what is missing there is stated precisely enough to be attacked.
Version 4 (30 July 2026). One claim is withdrawn, one is proved, and one is new. Withdrawn: versions 1–3 offered the rank-two partition (3,2,2,1,1,0) as a third cause of vanishing, and it is not one — written with the six parts rank two requires it is self-complementary of odd width, which is the second cause exactly; and that cause is not confined to rank one, since the folklore argument uses only that the alphabet is inversion-stable with determinant −1. The dichotomy is therefore forced rather than provisional, and the reason is two lines that were available all along: two of the three factors can never vanish, so the size-three profile never does. New: the reduction Φ = F ∘ Q is invertible in closed form — three moments return the three integers, because M₀² = ∏(Cₖ+1) means M₀ is not a normalisation but carries the third symmetric function — and the sign ζ, which versions 1–3 could not interpret, is the sign of the parity index n₊ − n₋ of the orbifold involution on Vλ, whose magnitude is the volume of the box: (p+1)(q+1)(r+1) = |n₊ − n₋|. The vanishing criterion is thus the statement that the orbifold projection is exactly balanced. Corrections: the symbol ζ carried two meanings between sections 3 and 5, which differ on 700 of 3060 partitions; the counts 560 = 420 + 140 are by mechanism, while the two λ-shorthands split the same 560 as 420 and 240 with 100 in both; the zero-locus plate is redrawn over the range the text quotes; and one count printed since version 1 (“0 of 105 cases”) proved unreproducible and is restated with its range as 0 of 109.
Included: the paper in English and Spanish, each with its own four plates; the figure generators; and seven verification runs with their archived output, so that every number printed in the paper can be located in a saved run rather than taken on trust. The scripts check the closed form, the sign, the index identity, the inversion, and the four counts that had no archived run before this version, each against the bialternant in exact rational arithmetic and each with a control built to fail.
2026-08-11extensionaffects the record: no
The compression to three integers holds at every root of unity, and there it is proved
- what
The alphabet of this paper, (1,−1,t,t⁻¹), is the second member of a family: the full set
of t-th roots of unity together with one free reciprocal pair. arXiv:2608.09619
evaluates s_λ(μ_t, z, z⁻¹) for every t ≥ 2 and every λ, with no hypothesis on the
shape: the value is a signed product of exactly three factors over a fixed denominator, or zero, and
the three arguments are read off the t-quotient of λ. At t = 2 the alphabet is
(1,−1,z,z⁻¹), which is this one. (The letter t changes job between the two papers:
here it is the free variable, there the order of the root of unity.)
- why
This paper grades its closed form an Observation: checked against the bialternant in exact
arithmetic on all 3060 partitions with four parts ≤ 14 and all 4845 with parts ≤ 16, with no
mismatch, and not proved. The general statement carries a proof — a Laplace expansion along
the t frozen rows of the bialternant with one cancellation lemma in the symmetric group, which
also delivers the sign, the one already in Littlewood's evaluation at the roots of unity.
- so
No number here moves and the record does not need a new version. What moves is a status word: at
t = 2 the closed form stops being an Observation.
The rank-two case this paper stopped at, and said so, is now conjectured to be unrepairable rather
than merely unrepaired: Conjecture 10.4 there says the value is a product of characters for every λ
if and only if the free part is a single reciprocal pair. Four deformations of the alphabet
are measured against it and each destroys the product. That is evidence, not a proof, and it is
labelled a conjecture.
- check
- the paper, and the scripts with their archived output at schur-orbit-and-reciprocal-pair —
theorem_full.py: 959 exact values, 476 zeros, 0 sign failures, 0 magnitude failures