Article
Licensed
Unlicensed
Requires Authentication
The asymptotic normality of the number of congruent cycles in a random permutation
-
M. V. Soboleva
Published/Copyright:
April 24, 2012
Published Online: 2012-04-24
Published in Print: 2012-04
©2012 by Walter de Gruyter GmbH & Co.
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Masthead
- On additivity and affinity coefficients of discrete functions
- The automorphism groups of certain codes
- On the distribution of absolute values of the trigonometric sum
- On multiple trigonometric sums of mixed type
- Synthesis of easily testable circuits over the basis {&, ∨, ⁻} for systems of Boolean functions
- Estimation of the number of maximal extensions in a random graph
- The asymptotic normality of the number of congruent cycles in a random permutation
- An analogue of the generalised allocation scheme: limit theorems for the number of cells containing a given number of particles
Articles in the same Issue
- Masthead
- On additivity and affinity coefficients of discrete functions
- The automorphism groups of certain codes
- On the distribution of absolute values of the trigonometric sum
- On multiple trigonometric sums of mixed type
- Synthesis of easily testable circuits over the basis {&, ∨, ⁻} for systems of Boolean functions
- Estimation of the number of maximal extensions in a random graph
- The asymptotic normality of the number of congruent cycles in a random permutation
- An analogue of the generalised allocation scheme: limit theorems for the number of cells containing a given number of particles