Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and \(k\)-ary trees

DOI10.1016/S0012-365X(98)00377-XzbMath0931.05003OpenAlexW2103894616MaRDI QIDQ1300984

Igor Pak

Publication date: 21 November 1999

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00377-x

zbMATH Keywords

permutationssymmetric groupbinary treesCatalan numbersplane treesreduced decompositions

Mathematics Subject Classification ID

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

Related Items

Swapping Colored Tokens on Graphs ⋮ Sorting on graphs by adjacent swaps using permutation groups ⋮ The number of shortest paths in the (n, k)-star graph ⋮ Token Swapping on Trees ⋮ Coxeter factorizations with generalized Jucys–Murphy weights and Matrix‐Tree theorems for reflection groups ⋮ A note on fully commutative elements in complex reflection groups ⋮ Random induced subgraphs of Cayley graphs induced by transpositions ⋮ A combinatorial proof of symmetry among minimal star factorizations ⋮ Character-theoretic techniques for near-central enumerative problems ⋮ The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant ⋮ Partial Jucys-Murphy elements and star factorizations ⋮ The number of shortest paths in the arrangement graph ⋮ Swapping colored tokens on graphs ⋮ Unnamed Item ⋮ Complexity of token swapping and its variants ⋮ Star factorizations and noncrossing partitions ⋮ Staircase tilings and \(k\)-Catalan structures ⋮ A central limit theorem for star-generators of \({S}_{\infty }\), which relates to the law of a GUE matrix ⋮ Transitive powers of Young-Jucys-Murphy elements are central. ⋮ Minimal factorizations of permutations into star transpositions ⋮ The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees ⋮ Introduction to reconfiguration ⋮ Combinatorial and algebraic enumeration: a survey of the work of Ian P. Goulden and David M. Jackson ⋮ Task swapping networks in distributed systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of reduced decompositions of elements of Coxeter groups
• Factorization of permutations into n-cycles
• Symmetric functions and Macdonald's result for top connexion coefficients in the symmetric group
• Trees associated with the Motzkin numbers
• A note on plane trees
• Correspondences between plane trees and binary sequences