Szego Seminar: "The Minimum Sizes of Separating and Splitting Families"

Abstract: The theme of this talk is centered around two types of collections of subsets of a finite set-- separating families and splitting families. Such families realize applications in combinatorial search, coding theory, and cryptology. Since families of a small size are best suited for such applications, much of the theory revolves around investigating the minimum sizes of separating families and splitting families. In this talk, we introduce two generalizations, n-separating families and n-splitting families, and work to give bounds on their minimum sizes.

Organizer: Meredith Sargent