Three problems in combinatorial asymptotics

DOI10.1016/0097-3165(83)90007-9MaRDI QIDQ1050342zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

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

Cited in

(27)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1050342)