RECONSTRUCTING MULTISETS OVER COMMUTATIVE GROUPOIDS AND AFFINE FUNCTIONS OVER NONASSOCIATIVE SEMIRINGS

DOI10.1142/S0218196714500027zbMath1286.05185arXiv1302.7109OpenAlexW2163511203MaRDI QIDQ5410737

Erkko Lehtonen

Publication date: 17 April 2014

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

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

zbMATH Keywords

reconstruction problemmultisetsemiringfunction of several argumentscommutative groupoid

Mathematics Subject Classification ID

Algebraic combinatorics (05E99) Operations and polynomials in algebraic structures, primal algebras (08A40) Sets with a single binary operation (groupoids) (20N02)

Related Items (4)

Reconstructing permutations from identification minors ⋮ CONTENT AND SINGLETONS BRING UNIQUE IDENTIFICATION MINORS ⋮ Set-reconstructibility of Post classes ⋮ Hypomorphic Sperner systems and non-reconstructible functions

Cites Work

• Join-irreducible Boolean functions
• Generalizations of Świerczkowski's lemma and the arity gap of finite functions
• Galois theory for minors of finite functions
• Boolean minors
• Essential arities of term operations in finite algebras
• Equational characterizations of Boolean function classes
• 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

This page was built for publication: RECONSTRUCTING MULTISETS OVER COMMUTATIVE GROUPOIDS AND AFFINE FUNCTIONS OVER NONASSOCIATIVE SEMIRINGS