Repeatable patterns and the maximum multiplicity of a generator in a reduced word

DOI10.5070/C64264252zbMATH Open1547.05008MaRDI QIDQ6615533

Christian Gaetz, Alexander Postnikov, Yi-Bo Gao, Pakawut Jiradilok, Gleb V. Nenashev

Publication date: 8 October 2024

Published in: Combinatorial Theory (Search for Journal in Brave)

zbMATH Keywords

permutationsreduced words\(k\)-setswiring diagramweakly separated

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Asymptotic enumeration (05A16)

Cites Work

• Title not available (Why is that?)
• An upper bound on the number of planar \(K\)-sets
• On the average number of \(k\)-sets
• Balanced tableaux
• The range of repetition in reduced decompositions
• Random sorting networks
• The maximum multiplicity of a generator in a reduced word
• Combinatorics of Coxeter Groups
• The maximum number of halving lines and the rectilinear crossing number of for
• POSITIVE GRASSMANNIAN AND POLYHEDRAL SUBDIVISIONS
• Weak separation and plabic graphs

This page was built for publication: Repeatable patterns and the maximum multiplicity of a generator in a reduced word

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