Minimal Null Designs and a Density Theorem of Posets

Classically,null designswere defined on the poset of subsets of a given finite set (boolean algebra). A null design is defined as a collection of weightedk-subsets such that the sum of the weights ofk-subsets containing at-subset is 0 for everyt-subset, where 0 ≤ t < k ≤ n. Null designs are useful to understand designs or to construct new designs from a known one. They also deserve research as pure combinatorial objects. In particular, people have been interested in the minimum number ofk-subsets of non-zero weight to make a non-zero null design, and the characterization of the null designs with the minimal number ofk-subsets of non-zero weight, which we callminimalnull designs. Minimal null designs were used to construct explicit bases of the space of null designs. finition of null designs can be extended to any poset which has graded structure (rankedposet) as the boolean algebra does. In this paper, we prove general theorems on the structure of the null designs of finite ranked posets, which also yield a density theorem of finite ranked posets. We apply the theorems to two special posets—the boolean algebra and the generalized (q-analogue of) boolean algebra—to characterize the minimal nullt-designs.