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
Effects of Radiation and Chemical Reaction on MHD Unsteady Heat and Mass Transfer of Casson Fluid Flow Past a Vertical Plate
Effects of radiation and chemical reaction on MHD unsteady heat and mass transfer of Casson fluid flow past a vertical plate has been studied in this paper. The model equations are transformed into non-dimensional form b...
Text Summarization versus CHI for Feature Selection
Text Classification is an important technique for handling the huge and increasing amount of text documents on the web. An important problem of text classification is features selection. Many feature selection techniques...
Support Theorem for Random Evolution Equations in Hlderian Norm
In this paper, we purpose to prove the support theorem of the random evolution equation dX(t) = σ(X(t),Z(t))dWt + b(X(t), Y (t))dt (E) where X = {X(t), t ∈ [0; 1]} is the solution of (E) considered as which a random-vari...
Computational Model of Prime Numbers by the Modified Chi-square Function
An innovative approach that treats prime numbers as raw experimental data and as elements of larger and larger finite sequences {Pm}≡{P(mp)} is shown in the present report. The modified chi-square function Xk2(A,mp/xo) w...
Simulation of Minimum Path Estimation in Software Defined Networking Using Mininet Emulator
Software-Defined Networking (SDN) has become a significant topic of discussion among the network service providers, operators, and equipment vendors where control planes are separated from the data plane in networking de...