Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T17:34:21.990Z Has data issue: false hasContentIssue false

Unique decipherability in the additive monoid of sets of numbers

Published online by Cambridge University Press:  13 May 2011

Aleksi Saarela*
Affiliation:
Department of Mathematics and Turku Centre for Computer Science TUCS, University of Turku, 20014 Turku, Finland; amsaar@utu.fi

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Sets of integers form a monoid, where the product of two sets Aand B is defined as the set containing a+b for all $a\in A$ and$b\in B$. We give a characterization of when a family of finitesets is a code in this monoid, that is when the sets do not satisfyany nontrivial relation. We also extend this result for someinfinite sets, including all infinite rational sets.

Information

Type
Research Article
Copyright
© EDP Sciences, 2011