Generalized Witness Sets

Abstract

Given a set C of q-ary n-tuples and c 2 C, how many symbols of c suffice to distinguish it from the other elements in C ? This is a generalization of an old combinatorial problem, on which we present (asymptotically tight) bounds and variations.