Reconstructing multisets over commutative groupoids and affine functions over nonassociative semirings

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

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.

Original languageBritish English
Pages (from-to)11-31
Number of pages21
JournalInternational Journal of Algebra and Computation
Volume24
Issue number1
DOIs
StatePublished - Feb 2014

Keywords

  • commutative groupoid
  • function of several arguments
  • multiset
  • Reconstruction problem
  • semiring

Fingerprint

Dive into the research topics of 'Reconstructing multisets over commutative groupoids and affine functions over nonassociative semirings'. Together they form a unique fingerprint.

Cite this