An Involution on Involutions and a Generalization of Layered Permutations
Miklos Bona, Rebecca Smith

TL;DR
This paper explores an involution on involutions derived from Young tableaux and generalizes layered permutations, providing new insights into combinatorial structures and their symmetries.
Contribution
It introduces a novel involution on involutions and offers a generalization of layered permutations, some of which can be defined independently of the Robinson-Schensted correspondence.
Findings
Defined an involution on involutions via Young tableaux transposes
Generalized layered permutations beyond existing frameworks
Provided alternative definitions avoiding Robinson-Schensted correspondence
Abstract
Taking transposes of Standard Young Tableaux defines a natural involution on the set of involutions of length 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · semigroups and automata theory · Advanced Mathematical Identities
