Hypomorphic Sperner systems and non-reconstructible functions

DOI10.1007/s11083-014-9330-zzbMath1372.06002arXiv1306.5578OpenAlexW2001302292MaRDI QIDQ2351723

Erkko Lehtonen, Miguel Couceiro, Karsten Schölzel

Publication date: 26 June 2015

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.5578

zbMATH Keywords

cloneBoolean functionreconstruction problemSperner systemlattice term function

Mathematics Subject Classification ID

Boolean functions (06E30) Operations and polynomials in algebraic structures, primal algebras (08A40) Algebraic aspects of posets (06A11)

Related Items

Reconstructing permutations from identification minors ⋮ CONTENT AND SINGLETONS BRING UNIQUE IDENTIFICATION MINORS ⋮ Set-reconstructibility of Post classes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Totally symmetric functions are reconstructible from identification minors
• The arity gap of order-preserving functions and extensions of pseudo-Boolean functions
• A family of non-reconstructible hypergraphs
• A census of non-reconstructable digraphs. I: Six related families
• Post classes characterized by functional terms
• Essential arities of term operations in finite algebras
• Note on isomorphic hypergraphs and some extensions of Whitney's theorem to families of sets
• More non-reconstructible hypergraphs
• Polynomial functions over bounded distributive lattices
• RECONSTRUCTING MULTISETS OVER COMMUTATIVE GROUPOIDS AND AFFINE FUNCTIONS OVER NONASSOCIATIVE SEMIRINGS
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)

This page was built for publication: Hypomorphic Sperner systems and non-reconstructible functions