On random permutations without cycles of some lengths (Q5948332): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1015288321931 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1688580905 / rank | |||
Normal rank | |||
Latest revision as of 09:51, 30 July 2024
scientific article; zbMATH DE number 1668855
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
