Reduced word manipulation: patterns and enumeration
From MaRDI portal
Publication:2014259
DOI10.1007/S10801-017-0752-8zbMATH Open1368.05006arXiv1503.05205OpenAlexW2963986783MaRDI QIDQ2014259FDOQ2014259
Publication date: 10 August 2017
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1503.05205
Recommendations
Catalan numberpermutationpartitionenumerationCoxeter grouppermutation patternreduced worddominant permutationcommutation class
Cites Work
- Title not available (Why is that?)
- Combinatorics of Coxeter Groups
- Title not available (Why is that?)
- Restricted permutations
- Permutations which are the union of an increasing and a decreasing subsequence
- Title not available (Why is that?)
- Symmetric functions, Schubert polynomials and degeneracy loci. Transl. from the French by John R. Swallow
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some combinatorial properties of Schubert polynomials
- Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
- Patterns in permutations and words.
- On the number of reduced decompositions of elements of Coxeter groups
- Title not available (Why is that?)
- Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns
- Catalan Numbers
- Pattern avoidance and the Bruhat order.
- Coincidental pattern avoidance
- Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
- Some open problems on permutation patterns
- Reduced decompositions and permutation patterns
- Permutation patterns, Stanley symmetric functions, and generalized Specht modules
- Rhombic tilings of polygons and classes of reduced words in Coxeter groups
- Classification of forbidden subsequences of length 4
- Pattern avoidance and Boolean elements in the Bruhat order on involutions
- Bruhat intervals of length 4 in Weyl groups.
- Homotopy type of the Boolean complex of a Coxeter system.
- Regular closed sets of permutations.
Cited In (12)
- Enumerating in Coxeter Groups (Survey)
- Prism permutations in the Bruhat order
- Properties of the Edelman-Greene bijection
- Rhombic tilings and Bott–Samelson varieties
- Boolean intersection ideals of permutations in the Bruhat order
- Reduced decompositions and permutation patterns
- Reductions on Double Occurrence Words
- The range of repetition in reduced decompositions
- Intersecting principal Bruhat ideals and grades of simple modules
- Forced perimeter in Elnitksy polygons
- Tiling-based models of perimeter and area
- A characterization of one-element commutation classes
Uses Software
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)
