TY - GEN A1 - Linusson, Svante T1 - Partitions with Restricted Block Sizes, Möbius Functions and the k-of-each Problem. N2 - {\newcommand{\R} {{\rm {\mbox{\protect\makebox[.15em][l]{I}R}}}} Given a list of $n$ numbers in $\R $, one wants to decide wether every number in the list occurs at least $k$ times. I will show that $(1-\epsilon)n\log_3(n/k)$ is a lower bound for the depth of a linear decision tree determining this problem. This is done by using the Björner-Lov\'asz method, which turns the problem into one of estimating the Möbius function for a certain partition lattice. I will also calculate the exponential generating function for the Möbius function of a partition poset with restricted block sizes in general.} T3 - ZIB-Report - SC-94-06 Y1 - 1994 UR - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/136 UR - https://nbn-resolving.org/urn:nbn:de:0297-zib-1363 ER -