Three problems in combinatorial asymptotics

From MaRDI portal
Publication:1050342

DOI10.1016/0097-3165(83)90007-9zbMath0513.05008OpenAlexW2058488357MaRDI QIDQ1050342

Herbert S. Wilf

Publication date: 1983

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(83)90007-9




Related Items (26)

The automorphism group of a finite \(p\)-group is almost always a \(p\)-group.The number of distinct part sizes in a random integer partitionCounting corners in partitionsOn a likely shape of the random Ferrers diagramLimiting distributions for the number of distinct component sizes in relational structuresMeasures of distinctness for random partitions and compositions of an integerProof of a conjecture of Erdős and TuránOn the largest degree of an irreducible factor of a polynomial in \(\mathbb{F}_q[X\)] ⋮ Supersaturation in posets and applications involving the container methodA central limit theorem for integer partitions into small powersCovering \(\mathsf{Irrep}(S_n)\) with tensor products and powersThe Distribution of Ascents of Size d or More in Partitions of nOptimal integer partitionsGeneralized Lambert series and Euler's pentagonal number theoremThe game of plates and olivesDistinct \(r\)-tuples in integer partitionsDistinctness of compositions of an integer: A probabilistic analysisLimit theorems for the number of summands in integer partitionsCharacter tables of \(p\)-groups with derived subgroup of prime order. III.Successions in integer partitionsOn the sum of parts with multiplicity at least 2 in all the partitions of nA Random Graph With a Subcritical Number of EdgesOn the degrees of irreducible factors of polynomials over a finite fieldSpringer correspondence for the split symmetric pair in typeOn the number of distinct block sizes in partitions of a setSampling part sizes of random integer partitions



Cites Work


This page was built for publication: Three problems in combinatorial asymptotics