Reconstructing multisets over commutative groupoids and affine functions over nonassociative semirings

Abstract

A reconstruction problem is formulated for multisets over commutative groupoids. The cards of a multiset are obtained by replacing a pair of its elements by their sum. Necessary and sufficient conditions for the reconstructibility of multisets are determined. These results find an application in a different kind of reconstruction problem for functions of several arguments and identification minors: classes of linear or affine functions over nonassociative semirings are shown to be weakly reconstructible. Moreover, affine functions of sufficiently large arity over finite fields are reconstructible.

18 pages. Int. J. Algebra Comput. (2014)

References in corpus (2)

• Generalizations of Swierczkowski's lemma and the arity gap of finite functions
• On the reconstructibility of totally symmetric functions and of other functions with a unique identification minor

Cited by in corpus (3)

• Hypomorphic Sperner systems and nonreconstructible functions
• Set-reconstructibility of Post classes
• Content and singletons bring unique identification minors