Smallest components in decomposable structures: Exp-log class
From MaRDI portal
Publication:1840512
zbMath0968.05006MaRDI QIDQ1840512
Daniel Panario, Bruce Richmond
Publication date: 18 September 2001
Published in: Algorithmica (Search for Journal in Brave)
permutationspolynomialsvariancecomponentslimit distributionhigher momentsexp-log classBuchstab functionrandom decomposable combinatorial structures
Exact enumeration problems, generating functions (05A15) Probability distributions: general theory (60E05) Permutations, words, matrices (05A05) Combinatorial probability (60C05) Distribution of integers with specified multiplicative constraints (11N25)
Related Items (7)
Extreme sizes in Gibbs-type exchangeable random partitions ⋮ Asymptotics of combinatorial structures with large smallest component ⋮ Local probabilities and total variation distance for random permutations ⋮ Enumeration of decomposable combinatorial structures with restricted patterns ⋮ The standard factorization of Lyndon words: an average point of view ⋮ Euler’s constant: Euler’s work and modern developments ⋮ Asymptotics of subtracted singularities for generating functions with small singularities
This page was built for publication: Smallest components in decomposable structures: Exp-log class
