RSK tableaux and the weak order on fully commutative permutations

DOI10.37236/11877arXiv2212.05002OpenAlexW4389208029MaRDI QIDQ6117252

Bridget Eileen Tenner, Heather M. Russell, Jian-Ping Pan, Emily Gunawan

Publication date: 16 February 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2212.05002

zbMATH Keywords

permutation patternweak orderreduced wordRobinson-Schensted-Knuth correspondenceBoolean permutationfully commutative permutation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of representation theory (05E10) Combinatorics of partially ordered sets (06A07) Reflection and Coxeter groups (group-theoretic aspects) (20F55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Repetition in reduced decompositions
• Some combinatorial properties of Schubert polynomials
• The enumeration of fully commutative elements of Coxeter groups
• On the fully commutative elements of Coxeter groups
• A crystal on decreasing factorizations in the 0-Hecke monoid
• Pattern avoidance and the Bruhat order.
• Permutations, matrices, and generalized Young tableaux
• Combinatorics of Coxeter Groups
• Longest Increasing and Decreasing Subsequences
• On the length of fully commutative elements
• Quelques remarques sur une Construction de Schensted.

This page was built for publication: RSK tableaux and the weak order on fully commutative permutations