Academic Journal
RSK tableaux and the weak orderon fully commutative permutations
| Τίτλος: | RSK tableaux and the weak orderon fully commutative permutations |
|---|---|
| Συγγραφείς: | Gunawan, Emily, Pan, Jianping, Russell, Heather M., Tenner, Bridget Eileen |
| Πηγή: | Department of Math & Statistics Faculty Publications |
| Στοιχεία εκδότη: | UR Scholarship Repository |
| Έτος έκδοσης: | 2023 |
| Συλλογή: | University of Richmond: UR Scholarship Repository |
| Θεματικοί όροι: | boolean permutation, fully commutative permutation, permutation pat- tern, Robinson-Schensted-Knuth correspondence, reduced word, weak order Mathematics Subject Classifications: 05A05, 06A07, Mathematics |
| Περιγραφή: | For each fully commutative permutation, we construct a “boolean core,” which is the maximal boolean permutation in its principal order ideal under the right weak order. We partition the set of fully commutative permutations into the recently defined crowded and uncrowded elements, distinguished by whether or not their RSK insertion tableaux satisfy a sparsity condition. We show that a fully commutative element is uncrowded exactly when it shares the RSK insertion tableau with its boolean core. We present the dynamics of the right weak order on fully commutative permutations, with particular interest in when they change from uncrowded to crowded. In particular, we use consecutive permutation patterns and descents to characterize the minimal crowded elements under the right weak order. |
| Τύπος εγγράφου: | article in journal/newspaper |
| Γλώσσα: | unknown |
| Relation: | https://www.combinatorics.org/ojs/index.php/eljc/article/view/v30i4p33/pdf |
| Διαθεσιμότητα: | https://scholarship.richmond.edu/mathcs-faculty-publications/275 https://www.combinatorics.org/ojs/index.php/eljc/article/view/v30i4p33/pdf |
| Αριθμός Καταχώρησης: | edsbas.90C072B7 |
| Βάση Δεδομένων: | BASE |
| Η περιγραφή δεν είναι διαθέσιμη |