SearcharxivSearch

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 $\mu_t$ for the $t$-th roots of unity and $z^{\pm1}$ for $r$ free reciprocal pairs. We study $\Phi_{t,r}(\beta)=s_{\lambda}(\mu_t,z^{\pm1})$, $\beta=\lambda+\delta$, 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 $\Lambda$ 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\epsilon_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-18. 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

Balanced even cycles in signed graphs:Tur\'an bounds, double covers, and parity obstructions

We study Tur\'an problems for balanced even cycles in simple signed graphs, where signed subgraphs are considered up to switching. For every balanced bipartite signed graph, the signed and ordinary Tur\'an numbers differ by at most a factor of two. Our main structural results concern the underlying graphs that admit a signing in which every $2k$-cycle is unbalanced. We characterize these graphs by the absence of an odd dependence among their $2k$-cycle incidence vectors, give a cohomological formulation, and construct subgraph-minimal obstructions of arbitrarily large order. In particular, there is no finite forbidden-subgraph characterization. We also give an exact closed-walk criterion for cycles in double covers and derive a direct signed breadth-first-search upper bound. As applications, we prove \[ \hex(n,C_{+4})=\left(\frac{\sqrt2}{2}+o(1)\right)n^{3/2} \] and study the signed hexagon number $R_6(n)=\hex(n,\{C_{-3},C_{+6}\})$. We characterize the underlying graphs counted by $R_6$ and express it as an extremal problem for ordinary $C_6$-free graphs with a prescribed involution. For every sufficiently large $n$, we construct examples with $\Omega(n^{4/3})$ edges, and we give an equivariant construction attaining the coefficient obtained from the F\"uredi--Naor--Verstra\"ete lower bound by double-cover transfer. Finally, we give $n$-vertex $C_{+10}$-free signed graphs with $\Omega(n^{6/5})$ edges and use octagon examples to illustrate the limitations of theta-freeness as a signing criterion.

math.CO

Fractional DP-colorings of $d$-degenerate locally sparse graphs

Bernshteyn, Kostochka, and Zhu (2020) introduced the notion of fractional DP-coloring, which generalizes both fractional coloring and fractional list coloring. Among several foundational results, they proved that every $d$-degenerate bipartite graph $G$ satisfies $\chi_f^{\mathrm{DP}} \le (1 + o(1))\frac{d}{\log d}$, and that this bound is optimal---a stark contrast to ordinary fractional coloring. In this paper, we extend this upper bound to all $d$-degenerate triangle-free graphs, proving that $\chi_f^{\mathrm{DP}} \le (4 + o(1))\frac{d}{\log d}$. This generalizes a recent result of Martinsson and Steiner (2025) for ordinary fractional coloring. We derive this result as a corollary of a more general upper bound concerning locally sparse graph orderings. Specifically, a $d$-degenerate graph $G$ is left $k$-locally-sparse if it admits a degeneracy ordering in which, for every vertex $v$, the subgraph induced by its back-neighbors contains at most $k$ edges. We show that if a $d$-degenerate graph $G$ is left $\frac{d^2}{f}$-locally-sparse, then \[ \chi_f^{\mathrm{DP}}(G) \le (8 + o(1))\frac{d}{\log f}. \] This immediately yields an identical upper bound on the ordinary fractional chromatic number $\chi_f(G)$, improving upon the leading constants of previously known bounds. Additionally, we establish the asymptotic sharpness of this result up to the leading constant. For any $1 \ll f \le d^2$, we construct $d$-degenerate graphs that are left $\frac{d^2}{f}$-locally-sparse and satisfy $\chi_f(G) \ge (1 - o(1))\frac{d}{\log f}$. Finally, as applications of our main theorem, we obtain improved upper bounds on the fractional DP-chromatic number of $d$-degenerate $K_{1,t,t}$-free graphs, as well as $K_{t,t,t}$-free graphs with maximum degree $\Delta$. Notably, these bounds improve upon existing results even in the setting of ordinary fractional coloring.

math.CO

Erd\H{o}s-S\'{o}s for digraphs

It is shown that every Eulerian digraph on $n$ vertices with more than $(t-1)n$ arcs contains every oriented tree with $t$ edges. The digraphs have no loops or repeated arcs, but opposite arcs are permitted. The bound is sharp for each fixed oriented tree, as witnessed by disjoint unions of complete bidirected graphs. Previously, such tight bounds were not known, even just for directed paths. This can be considered as a directed analog of the recently proved Erd\H{o}s-S\'os conjecture. The result was proved by GPT-6 Astra.

math.CO