Search arXivSearch

arXiv · 2606.15138

A skew Murnaghan--Nakayama rule for Hopf dual pairs

Abstract

We develop a uniform skew Murnaghan--Nakayama theory for graded Hopf dual pairs equipped with a nondegenerate Hopf pairing. Using the completed Cauchy element, its grouplike factorization, and the resulting partial contraction operators, we establish a general skew Cauchy identity together with an abstract skew Murnaghan--Nakayama rule. Specializing this framework recovers and extends the classical skew Murnaghan--Nakayama rule for symmetric functions, and yields new skew Murnaghan--Nakayama formulas in several settings, including the dual pairs $(\mathrm{NSym}, \mathrm{QSym}) $ and $(Λ^{(k)}, Λ_{(k)}) $ arising in $k$-Schur theory, as well as the type $C$ affine Grassmannian context. As applications, we obtain generating functions for irreducible characters of Ariki--Koike algebras, including their type $A$ and type $B$ specializations, as well as Hecke--Clifford algebras and $\mathfrak q$-rook monoid algebras. We also give ribbon-tableau expansions for skew $(q,t)$-Kostka polynomials and for the entries of the inverse transition matrix, thereby answering a question of Carbonara (1998). Finally, by specializing the auxiliary alphabet $Y$ to sums of powers of primitive roots of unity, we derive a skew plethystic Murnaghan--Nakayama formula together with a Schur expansion for skew modular Schur functions; as a further consequence, we confirm Walker's conjecture (1994) by showing that if the transition from the modular Schur functions to the Schur basis is trivial in the row indexed by $λ$, then $λ$ must be a $k$-core.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Naihuan Jing, Ning Liu. 2026-07-22. A skew Murnaghan--Nakayama rule for Hopf dual pairs. https://arxiv.org/abs/2606.15138

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

KEEP EXPLORING

Related papers

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

A graph $G$ is {\em perfectly divisible} if, for every induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. Chudnovsky and Sivaraman [J. Graph Theory \textbf{90} (2019) 54-60] proved that every ($P_5$, bull)-free graph is perfectly divisible, while Chen and Xu [Discrete Appl. Math. \textbf{372} (2025) 298-307] proved the same for ($P_7,C_5$, bull)-free graphs. We extend these results by proving that every ($P_8,C_5$, bull)-free graph is perfectly divisible and that, letting $F$ denote the Grötzsch graph, a ($P_6$, bull)-free graph is perfectly divisible if and only if it is $F$-free.

math.CO

Covering graphs by isometric trees

A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied. In this paper, we consider the analogous problem for isometric trees, focusing on the treewidth of graphs admitting a vertex or edge covering by a small number of such trees. Baste, De Meyer, Giocanti, Objois, and Picavet showed that for coverings by two isometric trees, the treewidth is bounded. We show that already for three isometric trees, the treewidth can be linear in the number of vertices. On the positive side, we show that for graphs of bounded degree coverable by a small number of isometric trees, the treewidth is sublinear in the number of vertices.

math.CO

Tree-independence number of $P_5$-free graphs with no large bicliques

The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties; however, the parameter can be unbounded even in quite restricted classes. In particular, the presence of an induced biclique $K_{\ell,\ell}$ forces tree-independence number at least $\ell$. This leads to the question whether large induced bicliques are the only obstruction to bounded tree-independence number in natural hereditary classes. A conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht states that for all positive integers $t$ and $\ell$, ${\{P_t,K_{\ell,\ell}\}}$-free graphs have bounded tree-independence number. We prove this conjecture for ${t=5}$ by showing that every ${\{P_5,K_{\ell,\ell}\}}$-free graph has tree-independence number at most ${4\ell-4}$. We also obtain related bounds for the weaker parameter of $α$-degeneracy and answer a question of Hilaire, Milanič, and Vasić whether tree-independence number of ${\{P_5,K_{\ell,\ell}\}}$-free graphs exceeds $\ell$ by at most an additive constant.

math.CO