Algorithms for Solving Some Inverse Problems from Combinatorial Number Theory
Elias Abboud *
Faculty of Education, Beit Berl College, Doar Beit Berl 44905, Israel.
*Author to whom correspondence should be addressed.
Abstract
In this paper we use the characteristic property of sumsets which states that there exists a proper subset tiling the set by translates to solve by an algorithmic methods, for finite sets, some inverse problems in combinatorial number theory.
Keywords: Translation, sumset, decomposable set, tiling a set, maximal covering
How to Cite
Abboud, Elias. 2016. “Algorithms for Solving Some Inverse Problems from Combinatorial Number Theory”. Journal of Advances in Mathematics and Computer Science 20 (2):1-8. https://doi.org/10.9734/BJMCS/2017/30619.
Downloads
Download data is not yet available.