相关论文: Succinct certificates for solutions to binary quad…

We consider Diophantine equations of the shape $ f(x) = g(y) $, where the polynomials $ f $ and $ g $ are elements of power sums. Using a finiteness criterion of Bilu and Tichy, we will prove that under suitable assumptions infinitely many…

Farkas' lemma is a fundamental result from linear programming providing linear certificates for infeasibility of systems of linear inequalities. In semidefinite programming, such linear certificates only exist for strongly infeasible linear…

Let $\lambda_i, \mu_j$ be non-zero real numbers not all of the same sign and let $a_i, b_k$ be non-zero integers not all of the same sign. We investigate a mixed Diophantine system of the shape \begin{equation*} \begin{cases} \left|…

In (Davis and Papp, 2022), the authors introduced the concept of dual certificates of (weighted) sum-of-squares polynomials, which are vectors from the dual cone of weighted sums of squares (WSOS) polynomials that can be interpreted as…

Certificates of non-negativity such as Putinar's Positivstellensatz have been used to obtain powerful numerical techniques to solve polynomial optimization (PO) problems. Putinar's certificate uses sum-of-squares (sos) polynomials to…

In this paper, first, we prove that the Diophantine system \[f(z)=f(x)+f(y)=f(u)-f(v)=f(p)f(q)\] has infinitely many integer solutions for $f(X)=X(X+a)$ with nonzero integers $a\equiv 0,1,4\pmod{5}$. Second, we show that the above…

Recently in joint work with E. Sert, we proved sharp boundedness results on discrete fractional integral operators along binary quadratic forms. Present work vastly enhances the scope of those results by extending boundedness to bivariate…

Integer solutions of the diophantine equation $A^4+hB^4=C^4+hD^4$ are known for all positive integer values of $h < 1000$. While a solution of the aforementioned diophantine equation for any arbitrary positive integer value of $h$ is not…

We prove that the Diophantine problem for orientable quadratic equations in free metabelian groups is decidable and furthermore, NP-complete. In the case when the number of variables in the equation is bounded, the problem is decidable in…

We study systems of polynomial equations in infinite finitely generated commutative associative rings with an identity element. For each such ring $R$ we obtain an interpretation by systems of equations of a ring of integers $O$ of a finite…

Recursive formulas are derived for the number of solutions of linear and quadratic Diophantine equations with positive coefficients. This result is further extended to general non-linear additive Diophantine equations. It is shown that all…

Systems of polynomial equations over the complex or real numbers can be used to model combinatorial problems. In this way, a combinatorial problem is feasible (e.g. a graph is 3-colorable, hamiltonian, etc.) if and only if a related system…

We give the general solution of three Diophantine equations in the ring of integer of the algebraic number field ${\bf Q}[{\sqr 5}]$. These equations are related to the problem of determination of the minimum distance in quasicrystals with…

First, we consider the equation $ax^2 - by^2 + c = 0$, with $a,b \in N*$ and $c \in Z*$, which is a generalization of Pell's equation. Here, we show that: if this equation has an integer solution and $ab$ is not a perfect square, then it…

B{\'e}zout 's theorem states that dense generic systems of n multivariate quadratic equations in n variables have 2 n solutions over algebraically closed fields. When only a small subset M of monomials appear in the equations (fewnomial…

This work determine the entire family of positive integer solutions of the diophantine equation. The solution is described in terms of $\frac{(m-1)(m+n-2)}{2} $ or $\frac{(m-1)(m+n-1)}{2}$ positive parameters depending on $n$ even or odd.…

It is established the existence and multiplicity of weak solutions for a class of nonlocal equations involving the fractional laplacian, nonlinearities with critical exponential growth and potentials this is which may change sign. The…

For each integer $n\geq 1$ we consider the unique polynomials $P, Q\in\mathbb{Q}[x]$ of smallest degree $n$ that are solutions of the equation $P(x)x^{n+1}+Q(x)(x+1)^{n+1}=1$. We derive numerous properties of these polynomials and their…

Many problems in interprocedural program analysis can be modeled as the context-free language (CFL) reachability problem on graphs and can be solved in cubic time. Despite years of efforts, there are no known truly sub-cubic algorithms for…

Suppose that $(U_{n})_{n \geq 0}$ is a binary recurrence sequence and has a dominant root $\alpha$ with $\alpha>1$ and the discriminant $D$ is square-free. In this paper, we study the Diophantine equation $U_n + U_m = x^q$ in integers $n…