Enumerations relating braid and commutation classes

DOI10.1016/J.EJC.2018.07.002MaRDI QIDQ1671744zbMATH OpenOpenAlexWikidataFDO

Authors Susanna Fishel, Elizabeth Milićević, Rebecca Patrias, Bridget Eileen Tenner

Publication date 7 September 2018

Published in European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

commutation classesbraid classes

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Abstract: We obtain an upper and lower bound for the number of reduced words for a permutation in terms of the number of braid classes and the number of commutation classes of the permutation. We classify the permutations that achieve each of these bounds, and enumerate both cases.

Recommendations

• Reduced word manipulation: patterns and enumeration
• On the expected number of commutations in reduced words
• On commutation classes of reduced words in Weyl groups
• Reduced word enumeration, complexity, and randomization
• The range of repetition in reduced decompositions

Cites work

• scientific article; zbMATH DE number 16339 (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?)
• Braid moves in commutation classes of the symmetric group
• Combinatorics of Coxeter Groups
• Complexes of injective words and their commutation classes
• Diameter of graphs of reduced words and galleries.
• Double deficiencies of Dyck paths via the Billey-Jockusch-Stanley bijection
• Fan realizations of type \(A\) subword complexes and multi-associahedra of rank 3
• Freely braided elements in Coxeter groups.
• Higher Bruhat orders and cyclic hyperplane arrangements
• Note on the expected number of Yang-Baxter moves applicable to reduced decompositions.
• On commutation classes of reduced words in Weyl groups
• On the fully commutative elements of Coxeter groups
• On the number of reduced decompositions of elements of Coxeter groups
• Reduced decompositions and permutation patterns
• Rhombic tilings of polygons and classes of reduced words in Coxeter groups
• Some combinatorial aspects of reduced words in finite Coxeter groups
• Some combinatorial properties of Schubert polynomials
• The enumeration of fully commutative affine permutations
• The enumeration of fully commutative elements of Coxeter groups

Cited in

(15)

• A characterization of one-element commutation classes
• Braid graphs in simply-laced triangle-free Coxeter systems are partial cubes
• scientific article; zbMATH DE number 2159652 (Why is no real title available?)
• Diameter of the commutation classes graph of a permutation
• On the expected number of commutations in reduced words
• Enumeration of Gelfand-Cetlin type reduced words
• Enumerating in Coxeter groups (survey)
• One-element commutation classes
• The range of repetition in reduced decompositions
• Forced perimeter in Elnitksy polygons
• Braid moves in commutation classes of the symmetric group
• Reduced word manipulation: patterns and enumeration
• Diameter of a commutation class on reduced words
• On graphs of sets of reduced words
• Tiling-based models of perimeter and area

Describes a project that uses

Uses Software

• OEIS
• FindStat

This page was built for publication: Enumerations relating braid and commutation classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1671744)