An Involution on Involutions and a Generalization of Layered Permutations

Abstract

Taking transposes of Standard Young Tableaux defines a natural involution on the set I(n) of involutions of length n via the the Robinson-Schensted correspondence. In some cases, this involution can be defined without resorting to the Robinson-Schensted correspondence. As a byproduct, we get an interesting generalization of layered permutations.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…