On the field of combinatory analysis
From MaRDI portal
Cited in
(42)- Asymptotic value distribution of additive functions defined on the symmetric group
- An asymptotic formula for the exponential polynomials and a central limit theorem for their coefficients
- Longest runs in a sequence of \(m\)-dependent random variables
- Random sets which invariably generate the symmetric group
- The two-parameter Poisson-Dirichlet distribution derived from a stable subordinator
- On the length of the longest run in a multi-state Markov chain.
- Local limit theorems for one class of distributions in probabilistic combinatorics
- Riffle shuffles, cycles, and descents
- Asymptotics with remainder term for moments of the total cycle number of random \(A\)-permutation
- Size distribution of the largest component of a random \(a\)-mapping
- Variance of the number of cycles of random \(A\)-permutation
- The Feller coupling for random derangements
- On the central limit theorem for the two-sided descent statistics in Coxeter groups
- Limit Poisson law for the distribution of the number of components in generalized allocation scheme
- Large deviation behavior for the longest head run in an IID Bernoulli sequence
- On the length of the longest head run
- Local probabilities for random permutations without long cycles
- Permutations without long or short cycles
- Random cyclations
- Factorization of the tenth Fermat number
- Order statistics for decomposable combinatorial structures
- On exact and large deviation approximation for the distribution of the longest run in a sequence of two-state Markov dependent trials
- Most permutations power to a cycle of small prime length
- COMPOUND POISSON APPROXIMATION OF THE NUMBER DISTRIBUTION FOR MONOTONE STRINGS OF FIXED LENGTH IN A RANDOM SEQUENCE
- On a number of components in a random A-mapping
- The number of cycles in random permutations without long cycles is asymptotically Gaussian
- On Asymptotics of Exchangeable Coalescents with Multiple Collisions
- The Dickman–Goncharov distribution
- Variations of central limit theorems and Stirling numbers of the first kind
- On the asymptotics of the number of binary words with a given length of a maximal series
- Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels
- scientific article; zbMATH DE number 7731179 (Why is no real title available?)
- Random mappings with constraints on the cycle lengths
- On some aspects of evolution of generalized allocation schemes
- The magical Ewens sampling formula
- Limit behavior of order statistics on cycle lengths of random A-permutations
- Enumeration of decomposable combinatorial structures with restricted patterns
- A central limit theorem for a generalization of the Ewens measure to random tuples of commuting permutations
- On random mappings with restrictions on sizes of components
- Dickman approximation of weighted sums of independent random variables in the Kolmogorov distance
- Nicolaas Govert de Bruijn, the enchanter of friable integers
- Recursive methods for some problems in coding and random permutations
This page was built for publication: On the field of combinatory analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5338499)