The range of repetition in reduced decompositions

DOI10.1016/j.aam.2020.102107zbMath1476.05009arXiv2002.10503OpenAlexW3086792721MaRDI QIDQ2221777

Bridget Eileen Tenner

Publication date: 2 February 2021

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Macdonald formularange of repetition

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Combinatorial aspects of groups and algebras (05E16)

Related Items

Spherical Schubert varieties and pattern avoidance ⋮ Diameter of the commutation classes graph of a permutation ⋮ Boolean intersection ideals of permutations in the Bruhat order ⋮ Pattern-functions, statistics, and shallow permutations

Cites Work

• Unnamed Item
• Unnamed Item
• Repetition in reduced decompositions
• Patterns in permutations and words.
• Homology of the Boolean complex
• Pattern avoidance and Boolean elements in the Bruhat order on involutions
• Homotopy type of the Boolean complex of a Coxeter system.
• On a duality in Coxeter groups.
• Some combinatorial properties of Schubert polynomials
• A bijective proof of Macdonald's reduced word formula
• Reduced decompositions with one repetition and permutation pattern avoidance
• Reduced word manipulation: patterns and enumeration
• The depth of a permutation.
• Pattern avoidance and the Bruhat order.
• Reduced decompositions and permutation patterns
• Boolean complexes for Ferrers graphs
• Combinatorics of Coxeter Groups

This page was built for publication: The range of repetition in reduced decompositions