On expected factors in reduced decompositions in type B
From MaRDI portal
Abstract: The expected number of Yang-Baxter moves appearing in a reduced decomposition of the longest element of the Coxeter group of type B_n is computed to be 2-4/n. For the same element, the expected number of 0101 or 1010 factors appearing in a reduced decomposition is 2/(n^2-2).
Recommendations
- Note on the expected number of Yang-Baxter moves applicable to reduced decompositions.
- On the number of reduced decompositions of elements of Coxeter groups
- On the expected number of commutations in reduced words
- Braid moves in commutation classes of the symmetric group
- Expected length of a product of random reflections.
Cites work
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 3219699 (Why is no real title available?)
- Binomial Identities and Hypergeometric Series
- Combinatorics of Coxeter Groups
- Note on the expected number of Yang-Baxter moves applicable to reduced decompositions.
- On the number of reduced decompositions of elements of Coxeter groups
- Reduced decompositions and permutation patterns
- Vexillary elements in the hyperoctahedral group
Cited in
(5)- On the expected number of commutations in reduced words
- A combinatorial version of Sylvester's four-point problem
- On the number of reduced decompositions of elements of Coxeter groups
- Braid moves in commutation classes of the symmetric group
- Note on the expected number of Yang-Baxter moves applicable to reduced decompositions.
This page was built for publication: On expected factors in reduced decompositions in type \(B\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875050)