相关论文: Succinct certificates for solutions to binary quad…
In this paper we discourse basises of representable algebras. This question lead to arithmetic problems. We prove algorithmical solvability of exponential-Diophantine equations in rings represented by matrices over fields of positive…
In this article the Diophantine equations of the form $x^{2}-8C_{n}xy+ 16y^{2}=\pm2^{r}$, $x^{4}-8C_{n}x^{2}y+ 16y^{2}=\pm2^{r}$ and $x^{2}-8C_{n}xy^{2}+ 16y^{4}=\pm2^{r}$ are taken into consideration for the investigations of existence of…
We prove a classical theorem due to Legendre, about the existence of non trivial solutions of quadratic diophantine equations of the form $ax^2+by^2+cz^2=0$, in the weak fragment of Peano Arithmetic $I\Delta_0+\Omega_1$.
Diophantine approximation is the problem of approximating a real number by rational numbers. We propose a version of this in which the numerators are approximately related to the denominators by a Laurent polynomial. Our definition is…
It is an open question whether the fractional parts of nonlinear polynomials at integers have the same fine-scale statistics as a Poisson point process. Most results towards an affirmative answer have so far been restricted to almost sure…
A rational number is dyadic if it has a finite binary representation $p/2^k$, where $p$ is an integer and $k$ is a nonnegative integer. Dyadic rationals are important for numerical computations because they have an exact representation in…
\noindent In this article, we determine all the integers $c$ having at least two representations as difference between two linear recurrent sequences. This is a variant of the Pillai's equation. This equation is an exponential Diophantine…
For a finitely generated group $G$, the \emph{Diophantine problem} over $G$ is the algorithmic problem of deciding whether a given equation $W(z_1,z_2,\ldots,z_k) = 1$ (perhaps restricted to a fixed subclass of equations) has a solution in…
We study the Diophantine problem (decidability of finite systems of equations) in different classes of finitely generated solvable groups (nilpotent, polycyclic, metabelian, free solvable, etc), which satisfy some natural…
In this paper we obtain the Lebesgue and Hausdorff measure results for the set of vectors satisfying infinitely many fully non-linear Diophantine inequalities. The set is associated with a class of linear inhomogeneous partial differential…
Motivated by Lazer-Leach type results, we study the existence of periodic solutions for systems of functional-differential equations at resonance with an arbitrary even-dimensional kernel and linear deviating terms involving a general delay…
In this paper we consider Diophantine equations of the form $f(x)=g(y)$ where $f$ has simple rational roots and $g$ has rational coefficients. We give strict conditions for the cases where the equation has infinitely many solutions in…
We establish upper bounds on the lengths of minimal conjugators in 2-step nilpotent groups. These bounds exploit the existence of small integral solutions to systems of linear Diophantine equations. We prove that in some cases these bounds…
In this paper we give a new aggregation framework for linear Diophantine equations. In particular, we prove that an aggregated system of minimum size can be built in polynomial time. We also derive an analytic formula that gives the number…
In this paper we present a simple technique to derive certificates of non-realizability for an abstract polytopal sphere. Our approach uses a variant of the classical algebraic certificates introduced by Bokowski and Sturmfels in…
This paper proposes two approaches for inferencing binary codes in two-step (supervised, unsupervised) hashing. We first introduce an unified formulation for both supervised and unsupervised hashing. Then, we cast the learning of one bit as…
The objective of this manuscript is to enquire for the solvability of a specific type of non-linear quadratic integral equations via the interesting notion of measure of non-compactness. Firstly, we inquire into couple of exciting fixed…
Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…
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$.
In this paper, we prove a theorem about the integer solutions to the Diophantine equation $x^{4}-q^{4}=py^{r}$, extending previous work of K.Gy\H ory, and F.Luca and A.Togbe, and of the author.