Hypomorphic Sperner Systems and Non-Reconstructible Functions

Berge, C., Rado, R.: Note on isomorphic hypergraphs and some extensions of Whitney’s theorem to families of sets. J. Comb. Theory Ser. B 13, 226–241 (1972)

Couceiro, M., Lehtonen, E.: The arity gap of polynomial functions over bounded distributive lattices. In: 40th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2010), pp. 113–116. IEEE Computer Society, Los Alamitos (2010)

Couceiro, M., Lehtonen, E., Waldhauser, T.: The arity gap of order-preserving functions and extensions of pseudo-Boolean functions. Discrete Appl. Math. 160, 383–390 (2012)

Couceiro, M., Marichal, J.-L.: Polynomial functions over bounded distributive lattices. J. Mult.-Valued Logic Soft Comput. 18, 247–256 (2012)

Denecke, K., Wismath, S.L.: Universal Algebra and Applications in Theoretical Computer Science. Chapman & Hall/CRC, Boca Raton (2002)

Ellingham, M.N.: Recent progress in edge-reconstruction. Seventeenth Manitoba Conference on Numerical Mathematics and Computing. Congr. Numer. 62, 3–20 (1988)

Foldes, S., Pogosyan, G.R.: Post classes characterized by functional terms. Discrete Appl. Math. 142, 35–51 (2004)

Jablonski, S.W., Gawrilow, G.P., Kudrjawzew, W.B.: Boolesche Funktionen und Postsche Klassen. Vieweg, Braunschweig (1970)

Goodstein, R.L.: The solution of equations in a lattice. Proc. R. Soc. Edinb. Sect. A 67, 231–242 (1965/1967)

Harary, F.: On the reconstruction of a graph from a collection of subgraphs. In: Theory of Graphs and Its Applications (Proc. Sympos. Smolenice, 1963), pp. 47–52,. Publ. House Czechoslovak Acad. Sci., Prague (1964)

Kelly, P.J.: On Isometric Transformations. Ph.D. thesis, University of Wisconsin (1942)

Kocay, W.L.: A family of nonreconstructible hypergraphs. J. Combin. Theory Ser. B 42, 46–63 (1987)

Kocay, W.L., Lui, Z.M.: More non-reconstructible hypergraphs. Discrete Math. 72, 213–224 (1988)

Lehtonen, E.: Totally symmetric functions are reconstructible from identification minors. Electron. J. Combin. 21(2), P2.6 (2014)

Lehtonen, E.: Reconstructing multisets over commutative groupoids and affine functions over nonassociative semirings. Internat. J. Algebra Comput. 24, 11–31 (2014)

Post, E.L.: The Two-Valued Iterative Systems of Mathematical Logic. Annals of Mathematical Studies, vol. 5. Princeton University Press, Princeton (1941)

Stockmeyer, P.K.: A census of nonreconstructible digraphs. I. Six related families. J. Combin. Theory Ser. B 31, 232–239 (1981)

Ulam, S.M.: A Collection of Mathematical Problems. Interscience Publishers, New York (1960)

Willard, R.: Essential arities of term operations in finite algebras. Discrete Math. 149, 239–259 (1996)