Totally Symmetric Functions are Reconstructible from Identification Minors
Erkko Lehtonen · The Electronic Journal of Combinatorics · 2014
We formulate a reconstruction problem for functions of several arguments: Is a function of several arguments uniquely determined, up to equivalence, by its identification minors? We establish some positive and negative results on this reconstruction problem. In particular, we show that totally symmetric functions (of sufficiently large arity) are reconstructible.