Hypomorphic Sperner systems and nonreconstructible functions
arXiv:1306.5578 · doi:10.1007/s11083-014-9330-z
Abstract
A reconstruction problem is formulated for Sperner systems, and infinite families of nonreconstructible Sperner systems are presented. This has an application to a reconstruction problem for functions of several arguments and identification minors. Sperner systems being representations of certain monotone functions, infinite families of nonreconstructible functions are thus obtained. The clones of Boolean functions are completely classified in regard to reconstructibility.
38 pages
References in corpus (5)
- Polynomial functions over bounded distributive lattices
- The arity gap of order-preserving functions and extensions of pseudo-Boolean functions
- Reconstructing multisets over commutative groupoids and affine functions over nonassociative semirings
- On the reconstructibility of totally symmetric functions and of other functions with a unique identification minor
- The arity gap of polynomial functions over bounded distributive lattices