Reduced word manipulation: patterns and enumeration
From MaRDI portal
Publication:2014259
Abstract: We develop the technique of reduced word manipulation to give a range of results concerning reduced words and permutations more generally. We prove a broad connection between pattern containment and reduced words, which specializes to our previous work for vexillary permutations. We also analyze general tilings of Elnitsky's polygon, and demonstrate that these are closely related to the patterns in a permutation. Building on previous work for commutation classes, we show that reduced word enumeration is monotonically increasing with respect to pattern containment. Finally, we give several applications of this work. We show that a permutation and a pattern have equally many reduced words if and only if they have the same length (equivalently, the same number of 21-patterns), and that they have equally many commutation classes if and only if they have the same number of 321-patterns. We also apply our techniques to enumeration problems of pattern avoidance, and give a bijection between 132-avoiding permutations of a given length and partitions of that same size, as well as refinements of this data and a connection to the Catalan numbers.
Recommendations
Cites work
- scientific article; zbMATH DE number 2126631 (Why is no real title available?)
- scientific article; zbMATH DE number 3779503 (Why is no real title available?)
- scientific article; zbMATH DE number 13050 (Why is no real title available?)
- scientific article; zbMATH DE number 1222942 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- Bruhat intervals of length 4 in Weyl groups.
- Catalan Numbers
- Classification of forbidden subsequences of length 4
- Coincidental pattern avoidance
- Combinatorics of Coxeter Groups
- Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
- Homotopy type of the Boolean complex of a Coxeter system.
- Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
- On the number of reduced decompositions of elements of Coxeter groups
- Pattern avoidance and Boolean elements in the Bruhat order on involutions
- Pattern avoidance and the Bruhat order.
- Patterns in permutations and words.
- Permutation patterns, Stanley symmetric functions, and generalized Specht modules
- Permutations which are the union of an increasing and a decreasing subsequence
- Reduced decompositions and permutation patterns
- Regular closed sets of permutations.
- Restricted permutations
- Rhombic tilings of polygons and classes of reduced words in Coxeter groups
- Some combinatorial properties of Schubert polynomials
- Some open problems on permutation patterns
- Symmetric functions, Schubert polynomials and degeneracy loci. Transl. from the French by John R. Swallow
- Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns
Cited in
(13)- A characterization of one-element commutation classes
- Properties of the Edelman-Greene bijection
- Rhombic tilings and Bott-Samelson varieties
- Intersecting principal Bruhat ideals and grades of simple modules
- Boolean intersection ideals of permutations in the Bruhat order
- Reduced decompositions and permutation patterns
- Reductions on Double Occurrence Words
- Enumerating in Coxeter groups (survey)
- The range of repetition in reduced decompositions
- Forced perimeter in Elnitksy polygons
- Enumerations relating braid and commutation classes
- Prism permutations in the Bruhat order
- Tiling-based models of perimeter and area
This page was built for publication: Reduced word manipulation: patterns and enumeration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014259)
