Search arXivSearch

arXiv · 2608.18302

Schur polynomials twisted by roots of unity and reciprocal pairs: torsion filters, fusion quotients, and total unimodularity at odd order

Abstract

Write $μ_t$ for the $t$-th roots of unity and $z^{\pm1}$ for $r$ free reciprocal pairs. We study $Φ_{t,r}(β)=s_λ(μ_t,z^{\pm1})$, $β=λ+δ$, and the question the companion paper left open after $r=1$: when does it vanish? We factor the evaluation into classical branching followed by a torsion filter, and the shape depends on the parity of $t$: the point lies in the orthogonal group with determinant $(-1)^{t+1}$. For odd $t$ it sits in the identity component: an ordinary restriction $SO_{2R'+1}\downarrow SO_{2m'+1}\times SO_{2r}$, the filter an odd orthogonal character at a principal element of order $h+1$. For even $t$ in the other: a twining, a virtual expansion, and a torsion element regular but not principal; there we prove the filter, with its sign. One description covers both: the filter is nonzero exactly when the shifted point is regular semisimple. Both are minimal-level fusion projections: the even of type $C$, the odd's tensor sector of type $B$. Affine folding accounts for $0,\pm1$; what it does not survives as conjectures. The highest surviving weight is the dominant vertex of the numerator's Newton polytope minus the denominator's --- the latter proved, the former conditional on a single-orbit property --- and the class there is conjecturally primitive, $\pm$ the generator of the rank-one quotient. For odd $t$ and one $Λ$ that numerator is a signed transversal count in $\{0,\pm1\}$ by the equal-rank character formula, leaving one division. We invert it in closed form, along an arithmetic progression; the quotient is $\pmε_t\det M$ for an explicit $0/{\pm}1$ matrix --- an interval matrix up to signs, hence totally unimodular, which settles (L1). The fibre count is a permanent, odd only when $1$, so at a dominant index a multi-hit fibre sums to zero. Two extremal statements remain. What is unproved is measured, in both parities.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Carles Marín. 2026-08-20. Schur polynomials twisted by roots of unity and reciprocal pairs: torsion filters, fusion quotients, and total unimodularity at odd order. https://arxiv.org/abs/2608.18302

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Matching Complexes of Outerplanar Graphs

An outerplanar graph is a planar graph that has a planar drawing with all vertices on the unbounded face. The matching complex of a graph is the simplicial complex whose faces are subsets of disjoint edges of the graph. In this paper we prove that the matching complexes of outerplanar graphs are contractible or homotopy equivalent to a wedge of spheres. This extends known results about trees and polygonal line tilings.

math.CO

Awesome graph parameters

For a graph $G$, we denote by $α(G)$ the size of a maximum independent set and by $ω(G)$ the size of a maximum clique in $G$. Our paper lies on the edge of two lines of research, related to $α$ and $ω$, respectively. One of them studies $α$-variants of graph parameters, such as $α$-treewidth or $α$-degeneracy. The second line deals with graph classes where some parameters are bounded by a function of $ω(G)$. A famous example of this type is the family of $χ$-bounded classes, where the chromatic number $χ(G)$ is bounded by a function of $ω(G)$. A Ramsey-type argument implies that if the $α$-variant of a graph parameter $ρ$ is bounded by a constant in a hereditary class $\mathcal{G}$, then $ρ$ is bounded by a function of $ω$ in $\mathcal{G}$. If the reverse implication also holds, we say that $ρ$ is awesome. Otherwise, we say that $ρ$ is awful. In the present paper, we identify a number of awesome and awful graph parameters, derive some algorithmic applications of awesomeness, and propose a number of open problems related to these notions.

math.CO

Perfect matchings and $A_α$-spectral radius in 1-binding graphs

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$. For $α\in[0,1)$, we use $A_α(G)$ and $ρ_α(G)$ to denote the $A_α$-matrix and the $A_α$-spectral radius of $G$, respectively. The binding number $\mbox{bind}(G)$ of $G$ is defined by $\mbox{bind}(G)=\min\left\{\frac{|N_G(X)|}{|X|}:\emptyset\neq X\subseteq V(G),N_G(X)\neq V(G)\right\}$. If $\mbox{bind}(G)\geq1$, then $G$ is called 1-binding. A perfect matching in $G$ is a set of nonadjacent edges covering every vertex of $G$. Tutte proved that a graph $G$ of even order has a perfect matching if and only if $o(G-S)\leq|S|$ holds for every $S\subseteq V(G)$ [W. Tutte, The factorization of linear graphs, J. Lond. Math. Soc. 22 (1947) 107--111]. In this paper, we use Tutte's result to prove that a connected 1-binding graph $G$ of even order $n$ with $n\geq n(α)$ has a perfect matching unless $G=K_1\vee(K_{n-5}\cup K_3\cup K_1)$ if $ρ_α(G)\geqρ_α(K_1\vee(K_{n-5}\cup K_3\cup K_1))$, where $n(α)$ is defined as follows: $n(α)=\max\{18,\frac{2+8α}{1-2α}\}$ if $α\in[0,\frac{1}{2})$, and $n(α)=18$ if $α=\frac{1}{2}$.

math.CO