Note on the expected number of Yang-Baxter moves applicable to reduced decompositions.

DOI10.1016/J.EJC.2004.06.010zbMATH Open1071.20003OpenAlexW1990237809MaRDI QIDQ557612FDOQ557612

Authors: Victor Reiner 

Publication date: 30 June 2005

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

Full work available at URL: https://doi.org/10.1016/j.ejc.2004.06.010

Recommendations

• On expected factors in reduced decompositions in type \(B\)
• Braid moves in commutation classes of the symmetric group
• On the expected number of commutations in reduced words
• On the number of reduced decompositions of elements of Coxeter groups
• Expected length of a product of random reflections.

zbMATH Keywords

Poisson distributionsymmetric groupsCoxeter groupssymmetric functionsreduced wordsstandard Young tableauxelements of maximal lengthnumbers of reduced decompositions

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Symmetric groups (20B30) Probabilistic methods in group theory (20P05)

Cites Work

• Title not available (Why is that?)
• Some Characters of the Symmetric Group
• On the number of reduced decompositions of elements of Coxeter groups
• Title not available (Why is that?)

Cited In (15)

• On expected factors in reduced decompositions in type \(B\)
• Circular support in random sorting networks
• Diameter of graphs of reduced words and galleries.
• On the expected number of commutations in reduced words
• A combinatorial version of Sylvester's four-point problem
• Random sorting networks
• Reduced decompositions and permutation patterns
• On random shifted standard Young tableaux and 132-avoiding sorting networks
• Enumerations relating braid and commutation classes
• Diameters of graphs of reduced words and rank-two root subsystems
• On random shifted standard Young tableaux and 132-avoiding sorting networks
• Tiling-based models of perimeter and area
• On graphs of sets of reduced words
• Braid moves in commutation classes of the symmetric group
• The Archimedean limit of random sorting networks

This page was built for publication: Note on the expected number of Yang-Baxter moves applicable to reduced decompositions.

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