35 citations · 138 across the 26 of their papers we have counts for
4 papers · 1 filter
Tukey morphisms between finite relations
Rhett Barton, Samuel Coskey, Paul Ellis
We investigate Tukey morphisms between binary relations, establishing several fundamental lemmas. We then specialize to finite binary relations, using computational methods to clas…
On splitting and splittable families
Samuel Coskey, Bryce Frederickson, Samuel Mathers +1
A set is said to split a finite set if exactly half the elements of (up to rounding) are contained in . We study the dual notions: (1) splitting family, which is a c…
The set splittability problem
Peter Bernstein, Cashous Bortner, Samuel Coskey +2
The set splittability problem is the following: given a finite collection of finite sets, does there exits a single set that contains exactly half the elements from each set in the…
On generalizations of separating and splitting families
Daniel Condon, Samuel Coskey, Luke Serafin +1
The work in this article is concerned with two different types of families of finite sets: separating families and splitting families (they are also called "systems"). These famili…