Corpus ID: 119173693

# On splitting and splittable families

@article{Coskey2018OnSA,
title={On splitting and splittable families},
author={Samuel Coskey and Bryce Frederickson and Samuel Mathers and Hao-Tong Yan},
journal={arXiv: Combinatorics},
year={2018}
}
• Samuel Coskey, +1 author Hao-Tong Yan
• Published 2018
• Mathematics
• arXiv: Combinatorics
• A set $A$ is said to \emph{split} a finite set $B$ if exactly half the elements of $B$ (up to rounding) are contained in $A$. We study the dual notions: (1) a \emph{splitting family}, a collection of sets such that any subset of $\{1,\ldots,k\}$ is split by a set in the family, and (2) a \emph{splittable family}, a collection of sets such that there is a single set $A$ that splits each set in the family. We study the minimum size of a splitting family on $\{1,\ldots,k\}$, as well as the… CONTINUE READING

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 16 REFERENCES

## On Generalizations of Separating and Splitting Families

• Computer Science, Mathematics
• Electron. J. Comb.
• 2016

## Constructions and bounds for (m, t)-splitting systems

• Computer Science, Mathematics
• Discret. Math.
• 2007

## Splitting systems and separating systems

• Mathematics, Computer Science
• Discret. Math.
• 2004

## Tight hardness results for minimizing discrepancy

• Computer Science, Mathematics
• SODA '11
• 2011

## Introduction to the theory of error-correcting codes

• I.F. Blake
• Computer Science
• Proceedings of the IEEE
• 1984

## Codes with given distances

• Mathematics, Computer Science
• Graphs Comb.
• 1987

## Balancing sets of vectors

• Mathematics, Computer Science
• IEEE Trans. Inf. Theory
• 1988

## An asymptotic formula for powers of binomial coefficients

• Mathematics
• 2004