Search arXivSearch

arXiv · 2404.18215

An extended generalization of RSK via the combinatorics of type $A$ quiver representations

Abstract

The classical Robinson--Schensted--Knuth correspondence is a bijection from nonnegative integer matrices to pairs of semi-standard Young tableaux. Based on the work of, among others, Burge, Hillman, Grassl, Knuth and Gansner, it is known that a version of this correspondence gives, for any nonzero integer partition $λ$, a bijection from arbitrary fillings of $λ$ to reverse plane partitions of shape $λ$, via Greene--Kleitman invariants. By bringing out the combinatorial aspects of our recent results on quiver representations, we construct a family of bijections from fillings of $λ$ to reverse plane partitions of shape $λ$ parametrized by a choice of Coxeter element in a suitable symmetric group. We recover the above version of the Robinson--Schensted--Knuth correspondence for a particular choice of Coxeter element depending on $λ$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Benjamin Dequêne. 2024-04-28. An extended generalization of RSK via the combinatorics of type $A$ quiver representations. https://arxiv.org/abs/2404.18215

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