Three problems in combinatorial asymptotics

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

zbMATH Keywords

asymptotic resultsnumber of different sizes of cycles of a permutationnumber of subspaces

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05) Vector spaces, linear dependence, rank, lineability (15A03)

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 partition ⋮ Counting corners in partitions ⋮ On a likely shape of the random Ferrers diagram ⋮ Limiting distributions for the number of distinct component sizes in relational structures ⋮ Measures of distinctness for random partitions and compositions of an integer ⋮ Proof of a conjecture of Erdős and Turán ⋮ On the largest degree of an irreducible factor of a polynomial in \(\mathbb{F}_q[X\)] ⋮ Supersaturation in posets and applications involving the container method ⋮ A central limit theorem for integer partitions into small powers ⋮ Covering \(\mathsf{Irrep}(S_n)\) with tensor products and powers ⋮ The Distribution of Ascents of Size d or More in Partitions of n ⋮ Optimal integer partitions ⋮ Generalized Lambert series and Euler's pentagonal number theorem ⋮ The game of plates and olives ⋮ Distinct \(r\)-tuples in integer partitions ⋮ Distinctness of compositions of an integer: A probabilistic analysis ⋮ Limit theorems for the number of summands in integer partitions ⋮ Character tables of \(p\)-groups with derived subgroup of prime order. III. ⋮ Successions in integer partitions ⋮ On the sum of parts with multiplicity at least 2 in all the partitions of n ⋮ A Random Graph With a Subcritical Number of Edges ⋮ On the degrees of irreducible factors of polynomials over a finite field ⋮ Springer correspondence for the split symmetric pair in type ⋮ On the number of distinct block sizes in partitions of a set ⋮ Sampling part sizes of random integer partitions

Cites Work

• Bijective methods in the theory of finite vector spaces
• On the number of distinct block sizes in partitions of a set

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