Abstract: Given a permutation w, we show that the number of repeated letters in a reduced decomposition of w is always less than or equal to the number of 321- and 3412-patterns appearing in w. Moreover, we prove bijectively that the two quantities are equal if and only if w avoids the ten patterns 4321, 34512, 45123, 35412, 43512, 45132, 45213, 53412, 45312, and 45231.
Recommendations
- The range of repetition in reduced decompositions
- Reduced decompositions with one repetition and permutation pattern avoidance
- Reduced decompositions and permutation patterns
- Reducibility of standard representations
- Reducibility of standard representations
- Reducibility in finite posets
- Recursive lattice reduction
- Rudimentary reductions revisited
- Decomposition of reduction
- Repetitive equivalences and tilting theory
Cites work
- Classification of bijections between 321- and 132-avoiding permutations
- Combinatorics of Coxeter Groups
- Excluded permutation matrices and the Stanley-Wilf conjecture
- scientific article; zbMATH DE number 17784 (Why is no real title available?)
- scientific article; zbMATH DE number 3209202 (Why is no real title available?)
- scientific article; zbMATH DE number 3327350 (Why is no real title available?)
- On the number of reduced decompositions of elements of Coxeter groups
- Pattern avoidance and the Bruhat order.
- Reduced decompositions and permutation patterns
- Reduced decompositions with one repetition and permutation pattern avoidance
- Restricted permutations
- The insertion encoding of permutations
- The On-Line Encyclopedia of Integer Sequences
Cited in
(14)- Reduced decompositions with one repetition and permutation pattern avoidance
- On alternating anagrams
- Reduced word manipulation: patterns and enumeration
- On Schubert varieties of complexity one
- Pattern-functions, statistics, and shallow permutations
- Diameter of the commutation classes graph of a permutation
- The range of repetition in reduced decompositions
- Reduced decompositions and permutation patterns
- Intersecting principal Bruhat ideals and grades of simple modules
- Forced perimeter in Elnitksy polygons
- Boolean intersection ideals of permutations in the Bruhat order
- RSK tableaux and the weak order on fully commutative permutations
- Prism permutations in the Bruhat order
- Repeatable patterns and the maximum multiplicity of a generator in a reduced word
This page was built for publication: Repetition in reduced decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q432487)
