3 research outputs found
Sperner partition systems
A \textsl{Sperner -partition system} on a set is a set of partitions
of into classes such that the classes of the partitions form a Sperner
set system (so no class from a partition is a subset of a class from another
partition). These systems were defined by Meagher, Moura and Stevens in
\cite{MMS} who showed that if , then the largest Sperner
-partition system has size . In this paper we
find bounds on the size of the largest Sperner -partition system where
does not divide the size of , specifically, we give an exact bound when
and upper and lower bounds when , and .Comment: 15 page
New bounds on the maximum size of Sperner partition systems
An -Sperner partition system is a collection of partitions of some
-set, each into nonempty classes, such that no class of any partition is
a subset of a class of any other. The maximum number of partitions in an
-Sperner partition system is denoted . In this paper
we introduce a new construction for Sperner partition systems and use it to
asymptotically determine in many cases as
becomes large. We also give a slightly improved upper bound for
and exhibit an infinite family of parameter sets for
which this bound is tight.Comment: 20 pages, 2 figure
Disjoint spread systems and fault location
When factors each taking one of levels may affect the correctness or
performance of a complex system, a test is selected by setting each factor to
one of its levels and determining whether the system functions as expected
(passes the test) or not (fails). In our setting, each test failure can be
attributed to at least one faulty (factor, level) pair. A nonadaptive test
suite is a selection of such tests to be executed in parallel. One goal is to
minimize the number of tests in a test suite from which we can determine which
(factor, level) pairs are faulty, if any. In this paper, we determine the
number of tests needed to locate faults when exactly one (or at most one) pair
is faulty. To do this, we address an equivalent problem, to determine how many
set partitions of a set of size exist in which each partition contains
classes and no two classes in the partitions are equal.Comment: 16 pages, 0 figure