Pages that link to "Item:Q2368923"
From MaRDI portal
The following pages link to Generating indecomposable permutations (Q2368923):
Displaying 10 items.
- On the number of indecomposable permutations with a given number of cycles (Q426818) (← links)
- Enumeration by kernel positions for strongly Bernoulli type truncation games on words (Q1957964) (← links)
- Regenerative random permutations of integers (Q2421818) (← links)
- Cardinality of Rauzy classes (Q2445509) (← links)
- Toppling on permutations with an extra chip (Q2665957) (← links)
- On full differential uniformity of permutations on the ring of integers modulo \(n\) (Q2689920) (← links)
- Integrated strategy for generating permutation (Q2908914) (← links)
- Generating Countable Sets of Permutations (Q4842039) (← links)
- On pattern avoiding indecomposable permutations (Q5384205) (← links)
- Discretization of prime counting functions, convexity and the Riemann hypothesis (Q5878416) (← links)