Partitions with Restricted Block Sizes, Möbius Functions, and the k-of-Each Problem
DOI10.1137/S089548019426855XzbMATH Open0866.68050OpenAlexW2062196018MaRDI QIDQ3128201FDOQ3128201
Authors: Svante Linusson
Publication date: 6 July 1997
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s089548019426855x
Recommendations
- The Möbius function of partitions with restricted block sizes
- On the number of distinct block sizes in partitions of a set
- Congruences on the number of restricted \(m\)-ary partitions
- Erdős-Ko-Rado theorems for set partitions with certain block size
- Congruences for a restricted \(m\)-ary partition function
- On the \(m\)-ary partition numbers
- On the parity of the number of multiplicative partitions and related problems
- On \(m\)-ary partition function congruences: A fresh look at a past problem
- The asymptotic number of set partitions with unequal block sizes
- scientific article; zbMATH DE number 38164
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Combinatorics of partially ordered sets (06A07)
Cited In (12)
- Modified Stirling numbers and \(p\)-divisibility in the universal typical \(p^k\)-series
- Partitionable sets and cyclic BSECs with block size four
- Two Remarks on Partitions of ω with Finite Blocks
- Characteristic and Ehrhart polynomials
- Whitney homology of semipure shellable posets
- Subspace arrangements of type \(B_ n\) and \(D_ n\)
- Why the characteristic polynomial factors
- Exponential Dowling structures
- Exact bounds of the Möbius inverse of monotone set functions
- Partition lattice with limited block sizes
- Partitions of \(n\) that avoid partitions of \(f\), and an application to the tiny-pan coin weighing problem
- Shellable nonpure complexes and posets. II
This page was built for publication: Partitions with Restricted Block Sizes, Möbius Functions, and the k-of-Each Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3128201)