Skip to content
Research Article Open access CC BY 4.0

Algorithms for Solving Some Inverse Problems from Combinatorial Number Theory

Elias Abboud

Journal of Advances in Mathematics and Computer Science · pp. 1–8 · Published 27 Dec 2016

10.9734/BJMCS/2017/30619

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.

Translation sumset decomposable set tiling a set maximal covering

Cited by 0

No indexed citations yet.

Article metrics

Real usage data collected on this platform.

0

Page views

0

PDF downloads

0

Outbound clicks

0

Citations

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

No views recorded yet.

Traffic sources

Referring site, by host.

No traffic recorded yet.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.