On the expected number of commutations in reduced words
From MaRDI portal
Publication:2947389
zbMath1321.05007arXiv1407.5636MaRDI QIDQ2947389
Publication date: 23 September 2015
Full work available at URL: https://arxiv.org/abs/1407.5636
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Combinatorics on words (68R15) Permutations, words, matrices (05A05) Symmetric groups (20B30)
Related Items (6)
The commutation graph for the longest signed permutation ⋮ Tiling-based models of perimeter and area ⋮ The Archimedean limit of random sorting networks ⋮ On random shifted standard Young tableaux and 132-avoiding sorting networks ⋮ On random shifted standard Young tableaux and 132-avoiding sorting networks ⋮ Circular support in random sorting networks
This page was built for publication: On the expected number of commutations in reduced words