Search arXivSearch

arXiv · 2511.18156

A new proof of an Eğecioğlu--Remmel inverse Kostka matrix problem via a Garsia--Milne involution involving Sym and NSym

Abstract

Eğecioğlu and Remmel provide a combinatorial proof (using special rim hook tableaux) that the product of the Kostka matrix $K$ and its inverse $K^{-1}$ equals the identity matrix $I$. They then pose the problem of proving the reverse identity $K^{-1}K =I$ combinatorially. Sagan and Lee prove a special case of this identity using overlapping special rim hook tableaux. Loehr and Mendes provide a full proof using bijective matrix algebra that relies on the Eğecioğlu--Remmel map. In this article, we solve the problem in full generality independent of the Eğecioğlu--Remmel bijection. To do this, we start by proving NSym versions of both Kostka matrix identities using sign-reversing involutions involving the tunnel hook coverings recently introduced by the first and third authors. Then we modify our sign-reversing involutions to reduce to Sym. Finally, we show that our bijection is different than the Loehr and Mendes result by constructing an injective map between special rim tableaux and the symmetric group $S_n.$

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Edward E. Allen, Kyle Celano, Sarah K. Mason. 2025-11-22. A new proof of an Eğecioğlu--Remmel inverse Kostka matrix problem via a Garsia--Milne involution involving Sym and NSym. https://arxiv.org/abs/2511.18156

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

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO