Related papers: Succinct certificates for solutions to binary quad…
This article discusses the question - how to estimate the number of solutions of algebraic Diophantine equations with natural coefficients using Circular method developed by Hardy and Littlewood. This paper considers the estimate of the…
A barrier certificate often serves as an inductive invariant that isolates an unsafe region from the reachable set of states, and hence is widely used in proving safety of hybrid systems possibly over an infinite time horizon. We present a…
We study the problem of deciding whether some PSPACE-complete problems have models of bounded size. Contrary to problems in NP, models of PSPACE-complete problems may be exponentially large. However, such models may take polynomial space in…
Let $c$ be a square-free positive integer and $p$ a prime satisfying $p\nmid c$. Let $h(-c)$ denote the class number of the imaginary quadratic field $\mathbb{Q}(\sqrt{-c})$. In this paper, we consider the Diophantine equation…
After a brief introduction to the classical theory of binary quadratic forms we use these results for proving (most of) the claims made by P\'epin in a series of articles on unsolvable quartic diophantine equations, and for constructing…
In this paper we consider the Diophantine equation $ V_n - b^m = c $ for given integers $ b,c $ with $ b \geq 2 $, whereas $ V_n $ varies among Lucas-Lehmer sequences of the second kind. We prove under some technical conditions that if the…
For typical first-order logical theories, satisfying assignments have a straightforward finite representation that can directly serve as a certificate that a given assignment satisfies the given formula. For non-linear real arithmetic…
In this paper, we discuss the existence of solution (as Cauchy transform of a signed measure) of a particular algebraic quadratic equation of the form $\mathcal{C}^{2}\left( z\right) +r\left( z\right) \mathcal{C}\left( z\right) +s\left(…
Let f in Z[X,Y,Z] be a non-constant, absolutely irreducible, homogeneous polynomial with integer coefficients, such that the projective curve given by f=0 has a function field isomorphic to the rational function field Q(t). We show that all…
The study of Diophantine triples taking values in linear recurrence sequences is a variant of a problem going back to Diophantus of Alexandria which has been studied quite a lot in the past. The main questions are, as usual, about existence…
It has recently been shown (Burer, Math. Program Ser. A 120:479-495, 2009) that a large class of NP-hard nonconvex quadratic programming problems can be modeled as so called completely positive programming problems, which are convex but…
In this short note we present a method of solving this Diophantine equation, method which is different from Ljunggren's, Mordell's, and R.K.Guy's.
We prove existence of positive solutions to a boundary value problem depending on discrete fractional operators. Then, corresponding discrete fractional Lyapunov-type inequalities are obtained.
In 2016 Izadi and Nabardi (b) showed (4-2-4) has infinitely many integer solutions. They used a specific congruent number elliptic curve.In 2019 Janfada and Nabardi,item C, showed that a necessary condition for n to have an integral…
Let $H$ be a $k$-graph on $n$ vertices, with minimum codegree at least $n/k + cn$ for some fixed $c > 0$. In this paper we construct a polynomial-time algorithm which finds either a perfect matching in $H$ or a certificate that none exists.…
A linear Diophantine equation $ax + by = n$ is solvable if and only if gcd$(a; b)$ divides $n$. A graph $G$ of order $n$ is called Diophantine if there exists a labeling function $f$ of vertices such that gcd$(f(u); f(v))$ divides $n$ for…
We study connections between linear equations over various semigroups and recursively enumerable sets of positive integers. We give variants of the universal Diophantine representation of recursively enumerable sets of positive integers…
New results on computing certificates of strictly positive polynomials in Archimedean quadratic modules are presented. The results build upon (i) Averkov's method for generating a strictly positive polynomial for which a membership…
Our main result concerns a perturbation of a classic theorem of Khintchine in Diophantine approximation. We give sufficient conditions on a sequence of positive real numbers $(\psi_n)_{n \in \mathbb{N}}$ and differentiable functions…
Solving two-variable linear Diophantine equations has applications in many cryptographic protocols such as RSA and Elliptic curve cryptography. The Extended Euclid's algorithm is a well known algorithm to solve these equations. We revisit…