Related papers: Enhanced Algorithms for the Representation of inte…

The article presents a computationally effective algorithm for calculating the multiresolution discrete Fourier transform (MrDFT). The algorithm is based on the idea of reducing the computational complexity which was introduced by Wen and…

Let $f$ be a homogeneous polynomial with rational coefficients in $d$ variables. We prove several results concerning uniform simultaneous approximation to points on the graph of $f$, as well as on the hypersurface $\{f(x_1,\dots,x_d) =…

We consider fractional partial differential equations posed on the full space $\R^d$. Using the well-known Caffarelli-Silvestre extension to $\R^d \times \R^+$ as equivalent definition, we derive existence and uniqueness of weak solutions.…

For K \subseteq C, let B_n(K)={(x_1,...,x_n) \in K^n: for each y_1,...,y_n \in K the conjunction (\forall i \in {1,...,n} (x_i=1 => y_i=1)) AND (\forall i,j,k \in {1,...,n} (x_i+x_j=x_k => y_i+y_j=y_k)) AND (\forall i,j,k \in {1,...,n}…

A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not…

We implement four algorithms for solving linear Diophantine equations in the naturals: a lexicographic enumeration algorithm, a completion procedure, a graph-based algorithm, and the Slopes algorithm. As already known, the lexicographic…

We introduce the problem of finding a satisfying assignment to a CNF formula that must further belong to a prescribed input subspace. Equivalent formulations of the problem include finding a point outside a union of subspaces (the…

In this paper, we examine the Diophantine problem given by the equation $F_n = F_l^k (F_l^m - 1)$, where $n, l, m \geq 1$ and $k \geq 3$. Here, $\{ F_t \}_{t=0}^{\infty} $ denotes the Fibonacci numbers, defined by the recurrence relation…

Fractional differential equations are powerful mathematical descriptors for intricate physical phenomena in a compact form. However, compared to integer ordinary or partial differential equations, solving fractional differential equations…

The $m$-point nonlocal problem for the first order differential equation with an operator coefficient in a Banach space $X$ is considered. An exponentially convergent algorithm is proposed and justified provided that the operator…

In this paper we give a new and simple algorithm to put any multivariate polynomial into a normal determinant form in which each entry has the form , and in each column the same variable appears. We also apply the algorithm to obtain a…

The paper introduces particle swarm optimization as a viable strategy to find numerical solution of Diophantine equation, for which there exists no general method of finding solutions. The proposed methodology uses a population of integer…

We study a broad class of algorithmic problems with an "additive flavor" such as computing sumsets, 3SUM, Subset Sum and geometric pattern matching. Our starting point is that these problems can often be solved efficiently for integers,…

In this paper, we study inhomogeneous Diophantine approximation with rational numbers of reduced form. The central object to study is the set $W(f,\theta)$ as follows, \begin{eqnarray*} \left\{x\in [0,1]:\left…

We reduce the principal problem of Additive Number Theory of whether an infinite sequence of integers constitutes a finite basis for the integers to a Diophantine problem involving the difference set of the sequence, by proving a formula…

Let k => 1, m => 1 be small fixed integers, gcd(k, m) = 1. This note develops some techniques for proving the existence of infinitely many primes solutions x = p, and y = q of the linear Diophantine equation y = mx + k.

We present a simple trick that allows to consider the sum of all connected Feynman diagrams at fixed position of interaction vertices for general fermionic models. With our approach one achieves superior performance compared to Diagrammatic…

In this paper, the authors propose the utilization of Fibonacci Neural Networks (FNN) for solving arbitrary order differential equations. The FNN architecture comprises input, middle, and output layers, with various degrees of Fibonacci…

We prove that for given integers b and c, the diophantine equation x^2+bx+c=y^2, has finitely many integer solutions(i.e. pairs in ZxZ),in fact an even number of such solutions(including the zero or no solutions case).We also offer an…

We observe that the computation $5^2 = 25$ has the digital property of the result being equal to the exponent concatenated directly to the left of the base. The generalization to a Diophantine equation and inequality in number bases has…