Search arXiv⌕ Search

arXiv · 2610.25036

Schur-Positve Symmetric Functions from Products: Log-Majorization, Total-Positivity, and PSD Matrices

Abstract

For a polynomial $F(t) = 1 + a_1 t + a_2 t^2 +\dots + a_d t^d$ with coefficients in a $\mathbb{Q}$-algebra $\mathcal{R}$, we consider Schur-positivity of the symmetric function $Ω_F(\mathbf{x}) = \prod_{i \geq 1} F(x_i)$. Using work of Lindström and Gessel--Viennot, we give sufficient conditions for Schur-positivity in terms of directed networks. In the case when $F(t)$ is the multivariate independence polynomial of the incomparability graph $inc(P)$ of a natural unit interval order, we apply these ideas to give a new proof of Schur-positivity of the chromatic symmetric function $X_{inc(P)}(\mathbf{x})$. Additionally, we prove Schur-positivity of certain sums of chromatic symmetric functions, refining recent work of Amdeberhan--Shareshian--Stanley. In the case when $\mathcal{R} = \mathbb{Q}[z_1,z_2,\dots,z_n]$, we prove necessary and sufficient conditions for Schur-positivity in terms of symmetric function evaluations. In particular, we show for $\mathbf{u}, \mathbf{v} \in \mathbb{R}_{\geq 0}^n$, $s_λ(\mathbf{u}) \geq s_λ(\mathbf{v})$ for all partitions $λ$ if and only if $m_λ(\mathbf{u}) \geq m_λ(\mathbf{v})$ for all partitions $λ$, and these inequalities are equivalent to $\mathbf{u}$ log-majorizing $\mathbf{v}$. Using representation theory of $GL(\mathbb{C}^n)$, we prove Schur-positivity of $Ω_F(\mathbf{x})$ when $F(t) = \det(I + t\sum_{i = 1}^m z_i \mathbf{v}_i \mathbf{v}_i^*)$ for a collection of vectors $\mathbf{v}_1,\mathbf{v}_2,\dots, \mathbf{v}_m \in \mathbb{C}^n$. As an application for this result, we introduce the Kirchhoff symmetric function $K_G(\mathbf{x})$ of a loopless graph $G$ and show that it it always Schur-positive.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Isaiah Siegl. 2026-10-18. Schur-Positve Symmetric Functions from Products: Log-Majorization, Total-Positivity, and PSD Matrices. https://arxiv.org/abs/2610.25036

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

KEEP EXPLORING

Related papers

Integral quasi-strongly regular Cayley graphs

Quasi-strongly regular graphs form a significant generalization of strongly regular graphs. We study the eigenvalues of a family of such graphs, $Γ_H(G)$, constructed from a finite group $G$ and a subgroup $H$. Our main results include a sufficient condition for $Γ_H(G)$ to be integral and an explicit computation of its entire spectrum when $H$ is normal, revealing that the spectrum in this case depends only on $|G|$ and the index $[G:H]$.

math.CO↗

The exact Erdős-Ko-Rado Theorem for 3-wise $t$-intersecting uniform families

One of the central problems in extremal set theory is the determination of the maximum size of an $r$-wise $t$-intersecting $k$-graph on $n$ vertices. For $r=2$ after decades of effort, a complete solution was given by the Complete Intersection Theorem (\cite{AK0}). However the case $r\geq 3$ remains wide open. The $t$-star consisting of all $k$-sets containing a fixed $t$-set provides a lower bound. For $r=3$ and $k\geq t+2\geq44$, we determine the exact threshold for which it is optimal for $n>k$. The condition is essentially $n\geq \sqrt{t}k$. For $k\geq t+2\geq47$ and $n\geq\frac{\sqrt{4t+9}-1}{2}k$, we also establish the corresponding Hilton-Milner-type stability result.

math.CO↗

A Littlewood-Richardson Rule for Forest Polynomials

The forest polynomials $\mathfrak{P}_a$ of Nadeau-Tewari form a $\mathbb{Z}$-basis of $\mathbb{Z}[x_1,x_2,\ldots]$ whose role for the cohomology of the quasisymmetric flag variety parallels that of Schubert polynomials for the classical flag variety. Nonnegativity of the structure constants $β_{a,b}^c$ in $\mathfrak{P}_a \mathfrak{P}_b = \sum_c β_{a,b}^c \mathfrak{P}_c$ is known, but no Littlewood-Richardson-style enumerative rule has been available. We give such a rule: $β_{a,b}^c$ counts pairs of forest RC graphs of forest-codes $a$ and $b$ whose lift product lands on a forest RC graph of forest-code and weight both equal to $c$. The same rule descends to the cup product on $H^\bullet(\mathrm{QFl}_n)$. The proof introduces a squash product $\boxtimes$ on RC graphs, which on full Grassmannian RC graphs of a fixed height recovers the plactic monoid, a multiplactic algebra $\mathcal{M}_n$ that models Schubert polynomial multiplication, and a lift product $*$ on RC graphs whose quasi-crystal structure, in the framework of Cain-Guilherme-Malheiro, transports the Nadeau-Tewari forest equivalence through the computation. The row-decomposition machinery on RC graphs that underlies these constructions is developed in a companion paper.

math.CO↗