Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
Random permutations with cycle lengths in a given finite set
-
A. N. Timashov
Veröffentlicht/Copyright:
9. Mai 2008
Abstract
We consider the class of all permutations of degree n whose cycle lengths are elements of a fixed finite set A ⊂ N such that card A ≥ 2 and gcd
. Under the assumption that the permutation X is equiprobably chosen from this class, we obtain a multidimensional local normal theorem for the joint distribution of the numbers of cycles of given sizes in this permutation.
The obtained results are utilised and sharpened in the case where X is an equiprobably chosen solution of the equation Xr = e, where e is an identity permutation of degree n, r ≥ 2 is a fixed positive integer.
Received: 2005-09-12
Revised: 2007-02-14
Published Online: 2008-05-09
Published in Print: 2008-March
© de Gruyter 2008
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- Random polynomials over a finite field
- Random permutations with cycle lengths in a given finite set
- The Kloss convergence principle for products of random variables with values in a compact group and distributions determined by a Markov chain
- On enumeration of labelled connected graphs by the number of cutpoints
- Skew Laurent series rings and the maximum condition on right annihilators
- A block algorithm of Lanczos type for solving sparse systems of linear equations
- On complexity of the anti-unification problem
- Classification of indecomposable Abelian (v, 5)-groups
Artikel in diesem Heft
- Random polynomials over a finite field
- Random permutations with cycle lengths in a given finite set
- The Kloss convergence principle for products of random variables with values in a compact group and distributions determined by a Markov chain
- On enumeration of labelled connected graphs by the number of cutpoints
- Skew Laurent series rings and the maximum condition on right annihilators
- A block algorithm of Lanczos type for solving sparse systems of linear equations
- On complexity of the anti-unification problem
- Classification of indecomposable Abelian (v, 5)-groups
