Algorithms for Solving Some Inverse Problems from Combinatorial Number Theory
Journal Title: Journal of Advances in Mathematics and Computer Science - Year 2017, Vol 20, Issue 2
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 nite sets, some inverse problems in combinatorial number theory.
Authors and Affiliations
Elias Abboud
Keywords
Related Articles
- EP ID EP322034
- DOI 10.9734/BJMCS/2017/30619
- Views 80
- Downloads 0
Cyclic-union Operation to Obtain Latin Squares
With the power that has taken the information technologies, one has developed the study and research about cryptography, and cryptanalysis, in which Latin squares are ideal candidates for being used in cryptographic syst...
Some Fixed Point Theorems for Berinde-Type Contraction Mappings on Gp-Metric Spaces
In this paper, we de ne the concepts of (δ, 1 − δ)-weak contraction, (φ, 1 − δ)-weak contraction and Ciric-type almost contraction in the sense of Berinde in Gp-complete Gp-metric space. Furthermore, we prove the exist...
Hypertension Prediction System Using Naive Bayes Classifier
Hypertension is an illness that often leads to severe and life-threatening diseases such as heart failure, coronary artery disease, heart attack and other severe conditions if not promptly diagnosed and treated. Data Min...
Existence and Uniqueness of Positive Periodic Solution of an Extended Rosenzweig-MacArthur Model via Brouwer's Topological Degree
The necessary conditions for existence of periodic solutions of an Extended Rosenzweig- MacArthur model are obtained using Brouwer’s degree. The forward invariant set is formulated to ensure the boundedness of the soluti...
The Domination Number of Pm X Pn
A mixed graph GM(V, E, A) is a graph containing unoriented edges (set E) as well as oriented edges (set A), referred to as arcs. In this paper we calculate the domination number of the Cartesian product of a path Pm with...