Indecomposable permutations with a given number of cycles
From MaRDI portal
Recommendations
- On the number of indecomposable permutations with a given number of cycles
- The number of decomposition of random permutation into the product of two involutions with given cycle in one of multipliers
- Generating indecomposable permutations
- On pattern avoiding indecomposable permutations
- Indecomposable permutations, hypermaps and labeled Dyck paths
Cited in
(6)- Indecomposable permutations, hypermaps and labeled Dyck paths
- Generating indecomposable permutations
- The number of decomposition of random permutation into the product of two involutions with given cycle in one of multipliers
- On the connected components of a random permutation graph with a given number of edges
- On the number of indecomposable permutations with a given number of cycles
- On pattern avoiding indecomposable permutations
This page was built for publication: Indecomposable permutations with a given number of cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3176576)