Reduced decompositions and permutation patterns

DOI10.1007/s10801-006-0015-6zbMath1101.05003arXivmath/0506242MaRDI QIDQ2509192

Bridget Eileen Tenner

Publication date: 18 October 2006

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Freely braided permutation; Vexillary permutation; Zonotopal tiling

Mathematics Subject Classification ID

05A05: Permutations, words, matrices

06A07: Combinatorics of partially ordered sets

Related Items

Permutation patterns, Stanley symmetric functions, and generalized Specht modules, Partial vexillarity and bigrassmannian permutations, Repetition in reduced decompositions, Fibonacci numbers, reduced decompositions, and 321/3412 pattern classes, The enumeration of maximally clustered permutations, On expected factors in reduced decompositions in type \(B\), Double Catalan monoids, Reduced decompositions with one repetition and permutation pattern avoidance, Reduced word manipulation: patterns and enumeration, Pattern avoidance and the Bruhat order., Kazhdan-Lusztig polynomials for maximally-clustered hexagon-avoiding permutations., Task swapping networks in distributed systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Note on the expected number of Yang-Baxter moves applicable to reduced decompositions.
• The enumeration of permutations whose posets have a maximum element
• On the number of reduced decompositions of elements of Coxeter groups
• Some combinatorial properties of Schubert polynomials
• Rhombic tilings of polygons and classes of reduced words in Coxeter groups
• Freely braided elements in Coxeter groups.
• Freely braided elements in Coxeter groups. II.
• Simple points in pseudoline arrangements
• Combinatorics of Coxeter Groups
• Restricted permutations