Sperner Partition Systems

@article{Li2012SpernerPS,
  title={Sperner Partition Systems},
  author={P. C. Li and Karen Meagher},
  journal={Journal of Combinatorial Designs},
  year={2012},
  volume={21}
}
  • P. C. Li, Karen Meagher
  • Published 20 January 2012
  • Mathematics, Computer Science
  • Journal of Combinatorial Designs
A Spernerk‐partition system on a set X is a set of partitions of X into k 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 [6] who showed that if |X|=kℓ , then the largest Sperner k‐partition system has size 1k|X|ℓ . In this paper, we find bounds on the size of the largest Sperner k‐partition system where k does not divide the size… 
More constructions for Sperner partition systems
An ( n , k ) ‐Sperner partition system is a set of partitions of some n ‐set such that each partition has k nonempty parts and no part in any partition is a subset of a part in a different partition.
New bounds on the maximum size of Sperner partition systems
Disjoint Spread Systems and Fault Location
TLDR
The number of tests needed to locate faults when exactly one pair is faulty is determined, to determine how many set partitions of a set of size £N exist in which each partition contains $v$ classes and no two classes in the partitions are equal.
On a Combinatorial Framework for Fault Characterization
TLDR
Test suites known as locating and detecting arrays to locate faults both in principle and in practice generalize covering arrays, thereby addressing combinatorial fault characterization.
Separating Interaction Effects Using Locating and Detecting Arrays
TLDR
Two randomized methods for the construction of locating and detecting arrays based on the Stein-Lovasz-Johnson paradigm and the Lovasz Local Lemma are examined, each of which can be derandomized to yield efficient algorithms for construction.
Coverage, Location, Detection, and Measurement
  • C. Colbourn, V. Syrotiuk
  • Computer Science
    2016 IEEE Ninth International Conference on Software Testing, Verification and Validation Workshops (ICSTW)
  • 2016
TLDR
Combinatorial arrays, locating and detecting arrays, are introduced to address location and detection in the context of combinatorial testing to address the behaviour of complex engineered systems.
Detecting Arrays for Main Effects
TLDR
Detecting arrays for main effects are test suites that ensure that the impact of each main effect is witnessed even in the presence of d or fewer other significant main effects.

References

SHOWING 1-10 OF 12 REFERENCES
A Sperner-Type Theorem for Set-Partition Systems
TLDR
This paper proves a higher order generalization of Sperner's Theorem and gives a bound on the cardinality of a Sperners-partition system of an $n$-set for any $k$ and $n$.
Erdos-Ko-Rado theorems for uniform set-partition systems
TLDR
A higher order generalization of the Erdős-Ko-Rado theorem is proved for systems of pairwise $t-intersecting uniform $k$-partitions of an $n$-set and it is proved that for large enough, any such system contains at most 1-over-k partitions.
INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
2. Notation The letters a, b, c, d, x, y, z denote finite sets of non-negative integers, all other lower-case letters denote non-negative integers. If fc I, then [k, I) denotes the set
Generating Function for K-Restricted Jagged Partitions
TLDR
The multiple sum that is constructed is the generating function for the so-called $K$-restricted jagged partitions and the corresponding generalization of the Rogers-Ramunjan identities is displayed, together with a novel combinatorial interpretation.
Extending Arcs: An Elementary Proof
TLDR
This paper considers two configuration conditions involving arcs in $\pi and shows via combinatorial means that they are equivalent and is able to obtain embeddability results for arcs, all proofs being elementary.
Erdös-Ko-Rado Theorems of Higher Order
We survey conjectured and proven Ahlswede-type higher-order generalizations of the Erdos-Ko-Rado theorem.
Ein Satz über Untermengen einer endlichen Menge
Combinatorial problems and exercises (2. ed.)
Intersection theorems fo r ystems of finite sets
  • Quart. J. Math. Oxford Ser. (2),
  • 1961
Handbook of Combinatorial Designs, Discrete Mathematics and its Applications, 2nd ed
  • 2007
...
...