Related papers: Sparse solutions of linear Diophantine equations
In this paper we present a new method of solving certain quartic and higher degree homogeneous polynomial diophantine equations in four variables. The method can also be extended to solve simultaneous homogeneous polynomial diophantine…
We consider scalar semilinear elliptic PDEs, where the nonlinearity is strongly monotone, but only locally Lipschitz continuous. To linearize the arising discrete nonlinear problem, we employ a damped Zarantonello iteration, which leads to…
The paper deals with the problem of finding sparse solutions to systems of polynomial equations possibly perturbed by noise. In particular, we show how these solutions can be recovered from group-sparse solutions of a derived system of…
By the theory of elliptic curves, we study the nontrivial rational parametric solutions and rational solutions of the Diophantine equations $z^2=f(x)^2 \pm g(y)^2$ for some simple Laurent polynomials $f$ and $g$.
The solution to systems of moment differential equations of the form $z\partial_my=(zA+B)y$ are provided, for a matrix $B$ with general good spectrum. Existence and convergence of Floquet-type solutions is studied. A generalized definition…
A recursive algorithm is constructed which finds all solutions to a class of Diophantine equations connected to the problem of determining ordered n-tuples of positive integers satisfying the property that their sum is equal to their…
It has by now become a standard approach to use the theory of sparse (or toric) elimination, based on the Newton polytope of a polynomial, in order to reveal and exploit the structure of algebraic systems. This talk surveys compact…
A system of linear differential equations with oscillatory decreasing coefficients is considered. The coefficients has the form $t^{-\alpha}a(t)$,~$\alpha>0$, where $a(t)$ is trigonometric polynomial with an arbitrary set of frequencies.…
We discuss different cases of dissipative Hamiltonian differential-algebraic equations and the linear algebraic systems that arise in their linearization or discretization. For each case we give examples from practical applications. An…
In this work, we prove the following result(Theorem 1): Suppose that n is a positive integer, p an odd prime, and such that either n is congruent to 0 modulo4 and p congruent to 3 modulo8; or alternatively, n is congruent to 2 modulo4 and p…
This work proposes a research problem of finding sparse solution of undetermined Linear system with some applications. Two approaches how to solve the compressive sensing problem: using l_1 approach , the l_q approach with 0 < q < 1.…
We show how to adapt the Hardy--Littlewood circle method to count monochromatic solutions to diagonal Diophantine equations. This delivers a lower bound which is optimal up to absolute constants. The method is illustrated on equations…
In this paper, we state with a variational method a general theorem providing the existence of a weak solution $u$ for fractional Euler-Lagrange equations of the type: $$ \dfrac{\partial L}{\partial x} (u,D^\alpha_- u,t) + D^\alpha_+…
By the theory of elliptic curves, we study the nontrivial rational parametric solutions and rational solutions of the Diophantine equations $z^2=f(x)^2 \pm f(y)^2$ for some simple Laurent polynomials $f$.
If $k$ is a sufficiently large positive integer, we show that the Diophantine equation $$n (n+d) \cdots (n+ (k-1)d) = y^{\ell}$$ has at most finitely many solutions in positive integers $n, d, y$ and $\ell$, with $\operatorname{gcd}(n,d)=1$…
This paper is a summary of the theory of discrete embeddings introduced in [5]. A discrete embedding is an algebraic procedure associating a numerical scheme to a given ordinary differential equation. Lagrangian systems possess a…
A method is presented that reduces the number of terms of systems of linear equations (algebraic, ordinary and partial differential equations). As a byproduct these systems have a tendency to become partially decoupled and are more likely…
We prove the existence of a weak solution to a backward stochastic differential equation (BSDE) $$ Y_t=\xi+\int_t^T f(s,X_s,Y_s,Z_s)\,ds-\int_t^T Z_s\,d\wien_s$$ in a finite-dimensional space, where $f(t,x,y,z)$ is affine with respect to…
In this paper, we present efficient algorithms for solving the Diophantine equation $f(x, y) = m$ for an arbitrary definite binary quadratic form $f$, given the factorization of $m$. While Cornacchia's algorithm to solve $x^2 + dy^2 = m$ is…
Diophantine equations are multivariate equations, usually polynomial, in which only integer solutions are admitted. A brute force method for finding solutions would be to systematically substitute possible integer solutions and check for…