Search arXivSearch

arXiv · 2603.29836

Two Littlewood identities for fully inhomogeneous spin Hall-Littlewood symmetric rational functions

Abstract

Fully inhomogeneous spin Hall-Littlewood symmetric rational functions $F_λ$ arise as partition functions of certain path configurations in the $\mathfrak{sl}_2$ higher spin six vertex models. They are multiparameter generalizations of the classical Hall-Littlewood symmetric polynomials. We establish two new generalizations of the classical Littlewood identity, where we express a weighted sum of $F_λ$'s over all partitions $λ$ as a product of the Littlewood kernel and another simple product in one case, and a product of the Littlewood kernel and a Pfaffian in the other case. As a corollary we obtain a novel Littlewood identity for Hall-Littlewood symmetric polynomials. We also elaborate on the newly established connection between the fully inhomogeneous spin Hall-Littlewood symmetric rational functions $F_λ$ and the modified Robbins polynomials, the latter being multivariate generating functions for alternating sign matrices. This connection allowed us to discover the two generalizations of the Littlewood identity and we provide a bijection between the underlying combinatorial models in the case where $λ$ is strictly decreasing.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ilse Fischer, Moritz Gangl. 2026-03-31. Two Littlewood identities for fully inhomogeneous spin Hall-Littlewood symmetric rational functions. https://arxiv.org/abs/2603.29836

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO