Related papers: Sparse solutions of linear Diophantine equations

Let E_n={x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}}. If Matiyasevich's conjecture on single-fold Diophantine representations is true, then for every computable function f:N->N there is a positive integer m(f) such that for…

Solving linear diophantine equations in two variables have applications in computer science and mathematics. In this paper, we revisit an algorithm for solving linear diophantine equations in two variables, which we refer as DEA-R…

In this paper we show that, for any fixed $1<c<967/805$, every sufficiently large positive number $N$ and a small constant $\varepsilon>0$, the diophantine inequality \begin{equation*} |p_1^c+p_2^c+p_3^c+p_4^c-N|<\varepsilon \end{equation*}…

In this second part, we study the Diophantine properties of values of arithmetic Gevrey series of non-zero order at algebraic points. We rely on the fact, proved in the first part, that the minimal differential operator (with polynomial…

To give a parametrization of the Diophantine equation $A^{3}+B^{3}=C^{3}+D^{3}$ in terms of integral binary quadratic forms in a constructive way.

Let $p$ be a prime integer, $\mathbb{Z}_p$ the finite field of order $p$ and $\mathbb{Z}^{*}_{p}$ is its multiplicative cyclic group. We consider the Diophantine equation $x^n + y^n = z^n$ with $1 \leq n \leq \frac{p - 1}{2}$. Our main aim…

This paper develops the theory of discrete Dirac reduction of discrete Lagrange-Dirac systems with an abelian symmetry group acting on the configuration space. We begin with the linear theory and, then, we extend it to the nonlinear setting…

We present in this article a general approach (in the form of recommendations and guidelines) for tackling Diophantine equation problems (whether single equations or systems of simultaneous equations). The article should be useful in…

We prove a generalization of W.M. Schmidt's theorem related to the Diophantine approximations for a linear form of the type $\alpha_1x_1+\alpha_2x_2 +y$ with {\it positive} integers $x_1,x_2$.

Finding sparse solutions of underdetermined systems of linear equations is a fundamental problem in signal processing and statistics which has become a subject of interest in recent years. In general, these systems have infinitely many…

We construct non-negative martingale solutions to the stochastic porous medium equation in one dimension with homogeneous Dirichlet boundary conditions which exhibit a type of sticky behavior at zero. The construction uses the stochastic…

Polyhedral Omega is a new algorithm for solving linear Diophantine systems (LDS), i.e., for computing a multivariate rational function representation of the set of all non-negative integer solutions to a system of linear equations and…

Let $a$ and $b$ be two distinct fixed positive integers such that $\min \{a,b\}>1.$ First, we correct an oversight from \cite{X-Z}. Then, we show that the equation in the title with $b \equiv 3 \pmod 8$, $b$ prime and $a$ even has no…

In this note we recall the definition of the digital root, and apply the notion of the digital root to searching solutions of Diophantine equations. A table of arithmetic operations with digital roots is given. This method is incapable of…

A power series being given as the solution of a linear differential equation with appropriate initial conditions, minimization consists in finding a non-trivial linear differential equation of minimal order having this power series as a…

This paper studies integer solutions to the Diophantine equation A+B=C in which none of A, B, C have a large prime factor. We set H(A, B,C) = max(|A|, |B|, |C|), and consider primitive solutions (gcd}(A, B, C)=1) having no prime factor p…

It is a survey on recent results in constructive sparse approximation. Three directions are discussed here: (1) Lebesgue-type inequalities for greedy algorithms with respect to a special class of dictionaries, (2) constructive sparse…

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…

In this work, we deal with rank-constrained integer least-squares optimization problems arising in low-rank matrix factorization related applications. We propose a solution for constrained integer least-squares problem subject to equality,…

We construct new Delone sets associated with badly approximable numbers which are expected to have rotationally invariant diffraction. We optimize the discrepancy of corresponding tile orientations by investigating the linear equation…