Totally symmetric functions are reconstructible from identification minors

DOI10.1007/s11083-015-9352-1zbMath1297.08002arXiv1412.8595OpenAlexW3104294797MaRDI QIDQ405190

Erkko Lehtonen

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics, Order (Search for Journal in Brave)

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

zbMATH Keywords

reconstruction problem2-set-transitivityfunction of several argumentsidentification minororder of first occurrencetotally symmetric function

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05) Boolean functions (06E30) Operations and polynomials in algebraic structures, primal algebras (08A40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Reconstructing permutations from identification minors ⋮ Totally symmetric functions are reconstructible from identification minors ⋮ The minor order of homomorphisms via natural dualities ⋮ CONTENT AND SINGLETONS BRING UNIQUE IDENTIFICATION MINORS ⋮ Set-reconstructibility of Post classes ⋮ Hypomorphic Sperner systems and non-reconstructible functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symmetry groups of Boolean functions.
• Totally symmetric functions are reconstructible from identification minors
• Join-irreducible Boolean functions
• A congruence theorem for trees
• Descending chains and antichains of the unary, linear, and monotone subfunction relations
• The solution to the partition reconstruction problem
• Equivalence of operations with respect to discriminator clones
• 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
• On the nonreconstructibility of combinatorial geometries
• Symmetry groups of Boolean functions and constructions of permutation groups
• Galois theory for minors of finite functions
• What is reconstruction for ordered sets?
• Essential arities of term operations in finite algebras
• Equational characterizations of Boolean function classes
• Invariance groups of finite functions and orbit equivalence of permutation groups.
• Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes
• On closed sets of relational constraints and classes of functions closed under variable substitutions
• On Reconstruction of Matrices
• Graph reconstruction—a survey
• On the Number of Operations in a Clone
• Associative string functions
• Function Algebras on Finite Sets

This page was built for publication: Totally symmetric functions are reconstructible from identification minors