scientific article; zbMATH DE number 1173126
Let \(\Lambda\) be a set of natural numbers, \(S_n (\Lambda)\) the set of all permutations of degree \(n\) having only cycles with lengths from the set \(\Lambda\), and \(| S_n (\Lambda)|\) the number of elements of the finite set \(S_n (\Lambda)\). We study the asymptotic behavior of \(| S_n (\Lambda)|\) as \(n\to\infty\), depending on the structure of a fixed set \(\Lambda\). The corresponding problem was first posed in [\textit{E. A. Bender}, SIAM Rev. 16, 485-515 (1974; Zbl 0294.05002)]. The case \(|\Lambda |= \infty\) has been investigated in a number of papers by the author. In the present paper we investigate the case \(|\Lambda |<\infty\). For the entire collection see [Zbl 0833.00028].
- On two classes of permutations with number-theoretic conditions on the lengths of the cycles
- Two enumerative results on cycles of permutations
- Random permutations with cycle lengths in a given finite set
- On the number of permutations with lengths of the cycles from a given set
- ON SOME CLASSES OF PERMUTATIONS WITH NUMBER-THEORETIC RESTRICTIONS ON THE LENGTHS OF CYCLES
- On the number of substitutions with cycle lengths from a given set
- Examples of non-shy sets
- scientific article; zbMATH DE number 747038 (Why is no real title available?)
- On permutations with cycle lengths in a random set
- scientific article; zbMATH DE number 804071 (Why is no real title available?)
- scientific article; zbMATH DE number 3891605 (Why is no real title available?)
- Permutations with prescribed cycle lengths.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4397630)
