Set-reconstructibility of Post classes
From MaRDI portal
Publication:2348047
DOI10.1016/j.dam.2015.02.013zbMath1315.05092arXiv1310.7797OpenAlexW1988557549MaRDI QIDQ2348047
Karsten Schölzel, Miguel Couceiro, Erkko Lehtonen
Publication date: 10 June 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.7797
Boolean functions (06E30) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (2)
Reconstructing permutations from identification minors ⋮ CONTENT AND SINGLETONS BRING UNIQUE IDENTIFICATION MINORS
Cites Work
- Unnamed Item
- Unnamed Item
- Totally symmetric functions are reconstructible from identification minors
- The solution to the partition reconstruction problem
- Generalizations of Świerczkowski's lemma and the arity gap of finite functions
- A family of non-reconstructible hypergraphs
- A census of non-reconstructable digraphs. I: Six related families
- What is reconstruction for ordered sets?
- Essential arities of term operations in finite algebras
- More non-reconstructible hypergraphs
- Hypomorphic Sperner systems and non-reconstructible functions
- Almost every graph has reconstruction number three
- On Reconstruction of Matrices
- 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: Set-reconstructibility of Post classes