Constructive covers of a finite set

MaRDI QIDQ6344277zbMATH OpenFDO

Authors Çağın Ararat, Ülkü Gürler, M. Emrullah Ildız

Publication date 2 July 2020

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Combinatorial identities, bijective combinatorics (05A19) Other designs, configurations (05B30) Boolean programming (90C09)

Abstract: Given positive integers $n,k$ with $kleqn$, we consider the number of ways of choosing $k$ subsets of $1,ldots,n$ in such a way that the union of these subsets gives $1,ldots,n$ and they are not subsets of each other. We refer to such choices of sets as constructive $k$-covers and provide a semi-analytic summation formula to calculate the exact number of constructive $k$-covers of $1,ldots,n$. Each term in the summation is the product of a new variant of Stirling numbers of the second kind, referred to as integrated Stirling numbers, and the cardinality of a certain set which we calculate by an optimization-based procedure with no-good cuts for binary variables.

This page was built for publication: Constructive covers of a finite set

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