Skip to content

Schur polynomials twisted by roots of unity and reciprocal pairs: exactly three factors, and where they vanish

Carles Marín

math.COarXiv:2608.09619

Abstract

Let μt be the full set of t-th roots of unity. Adjoining r free reciprocal pairs gives a two-parameter family of alphabets; we settle three parts of it. At r=1, for every t2 and every λ with at most t+2 parts, sλ(μt,z,z-1) is a signed product of exactly three factors over a fixed denominator, or zero, the arguments read off core and quotient. What it sees of λ is a multiset of three integers and a sign, and exactly that: two partitions of any sizes share a nonzero value if and only if they agree on that datum. The proof is a Laplace expansion along the t frozen rows with one cancellation lemma, and delivers the sign, of which Littlewood's is one factor. At t=2 and every r, sλ(1,-1,z11,…,zr1) vanishes exactly when the beta set has constant parity or λ is self-complementary of odd width; that direction is a corollary of complementation over an index family of Ayyer and Behrend, the converse an extremal argument in the degree filtration, modulo one rigidity theorem for Schur products. Equivalently: exactly those Vλ restrict to O(N,C) -stably. At odd t and every r it vanishes exactly when a residue class is absent, at no external cost. And for every t and r, a reflection of the beta set's excess part with one increment hitting its centre forces vanishing. Three consequences of the first. A vanishing criterion: an empty residue class, or two distinguished classes concentric as intervals, the second only for even t. An extension of Ayyer-Kumari's independence criterion: on the reciprocal locus it acquires one further family, classified by core and quotient. And at t=2 a (-1)-enumeration of plane partitions in a box refined by a parameter that stays free. The factorization is isolated: it fails under each of four deformations of the alphabet, for one reason.

Create a lesson