Minimal factorizations of permutations into star transpositions
From MaRDI portal
The authors show that the number of decompositions of a permutation \(\pi\in\mathfrak{S}_n\) into a minimal number of transpositions \((1,i)\) with \(i\in\{2,\ldots,n\}\) is equal to \[ \frac{(n+m-2)!}{n!}\,\ell_1\cdots\ell_m \] where \(\ell_1,\ldots,\ell_m\) denote the cycle lengths of \(\pi\).
Recommendations
- Minimal factorizations of permutations into star transpositions
- A combinatorial proof of symmetry among minimal star factorizations
- Short factorizations of permutations into transpositions
- Inequivalent transitive factorizations into transpositions
- Minimal transitive factorizations of a permutation of type (p,q)
Cites work
- A problem of arrangements
- Enumeration of planar constellations
- scientific article; zbMATH DE number 3149991 (Why is no real title available?)
- Minimal Transitive Factorizations of Permutations into Cycles
- On the number of reduced decompositions of elements of Coxeter groups
- Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and k-ary trees
- Transitive factorisations into transpositions and holomorphic mappings on the sphere
- Transitive powers of Young-Jucys-Murphy elements are central.
Cited in
(34)- Transitive powers of Young-Jucys-Murphy elements are central.
- Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and k-ary trees
- Minimal transitive products of transpositions---the reconstruction of a proof of A. Hurwitz
- Angle measures, general rotations, and roulettes in normed planes
- Star factorizations and noncrossing partitions
- A central limit theorem for star-generators of \({S}_{\infty }\), which relates to the law of a GUE matrix
- Combinatorial and algebraic enumeration: a survey of the work of Ian P. Goulden and David M. Jackson
- Bi-pruned Hurwitz numbers
- The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees
- On the problem of determining which \((n, k)\)-star graphs are Cayley graphs
- Sorting on graphs by adjacent swaps using permutation groups
- Annular noncrossing permutations and minimal transitive factorizations
- Inequivalent transitive factorizations into transpositions
- Task swapping networks in distributed systems
- The number of shortest paths in the (n, k)-star graph
- The number of prefixes of minimal factorisations of a cycle
- Notes on Whitney numbers of the second kind for the star poset
- Mind switches in Futurama and Stargate
- Random induced subgraphs of Cayley graphs induced by transpositions
- Stellar permutations of the two-element subsets of a finite set
- A combinatorial proof of symmetry among minimal star factorizations
- Character-theoretic techniques for near-central enumerative problems
- Minimal factorizations of permutations into star transpositions
- Cycle decompositions and train tracks
- scientific article; zbMATH DE number 798638 (Why is no real title available?)
- The number of shortest paths in the arrangement graph
- Minimal transitive factorizations of a permutation of type (p,q)
- A note on fully commutative elements in complex reflection groups
- Partial Jucys-Murphy elements and star factorizations
- Centrality of star and monotone factorisations
- Random monotone factorisations of the cycle and their lamination process
- Combinatorics of pruned Hurwitz numbers
- Factorizations in Hecke algebras. I: Long-cycle factorizations and Jucys-Murphy elements
- Short factorizations of permutations into transpositions
This page was built for publication: Minimal factorizations of permutations into star transpositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024452)
