Set partitions without blocks of certain sizes

DOI10.1016/J.EJC.2019.103041MaRDI QIDQ2011155zbMATH OpenOpenAlexFDO

Authors Joshua Culver, Andreas Weingartner

Publication date 28 November 2019

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1806.02316

zbMATH Keywords

Bell numberLambert-W function

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of block designs (05B05) Partitions of sets (05A18) Bell and Stirling numbers (11B73)

Abstract: We give an asymptotic estimate for the number of partitions of a set of $n$ elements, whose block sizes avoid a given set $mathcalS$ of natural numbers. As an application, we derive an estimate for the number of partitions of a set with $n$ elements, which have the property that its blocks can be combined to form subsets of any size between $1$ and $n$.

Recommendations

• Set partitions with restrictions
• scientific article; zbMATH DE number 4160880
• Partitions without small parts
• Set partitions and partitions without singleton blocks of type \(B\)
• Partitions with fixed number of sizes
• Partitions
• Restricted partitions
• Partitions into a small number of part sizes

Cites work

• scientific article; zbMATH DE number 3112944 (Why is no real title available?)
• scientific article; zbMATH DE number 4160880 (Why is no real title available?)
• scientific article; zbMATH DE number 3827993 (Why is no real title available?)
• scientific article; zbMATH DE number 859030 (Why is no real title available?)
• Analytic combinatorics
• On the Lambert \(w\) function
• On the degrees of polynomial divisors over finite fields
• Practical numbers and the distribution of divisors
• Some limit theorems with respect to constrained permutations and partitions
• Sums of Distinct Divisors
• Sur une propriété des nombres naturels

Cited in

(7)

• scientific article; zbMATH DE number 1995883 (Why is no real title available?)
• The asymptotic number of irreducible partitions
• On the number of distinct block sizes in partitions of a set
• Asymptotic results on Klazar set partition avoidance
• Convolution estimates and number of disjoint partitions
• Set partitions with isolated singletons
• Block partitions of sequences

This page was built for publication: Set partitions without blocks of certain sizes

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