On random permutations without cycles of some lengths (Q5948332)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1668855
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On random permutations without cycles of some lengths |
scientific article; zbMATH DE number 1668855 |
Statements
On random permutations without cycles of some lengths (English)
0 references
5 November 2001
0 references
Consider a random permutation of \(1,2,\dots,N\) (each permutation with probability \(1/N!\)) and its cycles. The probability that there are no cycles with length in a given set \(J\) is studied. By bounding the sum of the reciprocals of the numbers in \(J\), lower estimates of the probability above are obtained.
0 references
sieve method
0 references
0.94950765
0 references
0.9292776
0 references
0.92528254
0 references
0.9243643
0 references
0.92409253
0 references
0.91497517
0 references
0.91447866
0 references
