Related papers: On Diophantine equations over $\mathbb Z[i]$ with …

This paper settles the computational complexity of the problem of integrating a polynomial function f over a rational simplex. We prove that the problem is NP-hard for arbitrary polynomials via a generalization of a theorem of Motzkin and…

In this paper we prove that the PDE $p(D)f=q,$ where $p$ and $q$ are multivariate polynomials, has a solution in the space of polynomials of total degree not exceeding ${n+s},$ where $n$ is the degree of $q$ and $s$ is the zero order of…

Consider random polynomial $\sum_{i=0}^na_ix^i$ of independent mean-zero normal coefficients $a_i$, whose variance is a regularly varying function (in $i$) of order $\alpha$. We derive general criteria for continuity of persistence…

In this paper, we gave solutions of the Diophantine equations 16^{x}+p^{y}=z^{2}, 64^{x}+p^{y}=z^{2} where p is an odd prime, n is a positive integer and x,y,z are non-negative integers. Finally we gave a generalization of the Diophantine…

We prove the undecidability of determining whether a Turing machine yields an eventually periodic trajectory. From this, we deduce the undecidability of orbit finiteness in the polynomial dynamical system on infinite tuples of integers.

We say that two given polynomials $f, g \in R[X]$, over a ring $R$, are equivalent under shifts if there exists a vector $a \in R^n$ such that $f(X+a) = g(X)$. Grigoriev and Karpinski (FOCS 1990), Lakshman and Saunders (SICOMP, 1995), and…

Let $K$ be a number field and $\mathcal{O}_K$ be the ring of integers of $K$. In this article, we study the solutions of the generalized fruit Diophantine equation $ax^d-y^2-z^2 +xyz-c=0$ over $K$, where $d \geq 3$ is an integer and $a,c\in…

In this paper, we prove that the equation $x^2-(p^{2k+2}+1)y^2=-p^{2l+1}$, $l \in \{0,1,\dots,k\}, k \geq 0$, where $p$ is an odd prime number, is not solvable in positive integers $x$ and $y$. By combining that result with other known…

We consider random polynomials with independent identically distributed coefficients with a fixed law. Assuming the Riemann hypothesis for Dedekind zeta functions, we prove that such polynomials are irreducible and their Galois groups…

In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…

Schubert polynomials form a basis of all polynomials and appear in the study of cohomology rings of flag manifolds. The vanishing problem for Schubert polynomials asks if a coefficient of a Schubert polynomial is zero. We give a tableau…

We address the problem of the stability of the computations of resultants and subresultants of polynomials defined over complete discrete valuation rings (e.g. Zp or k[[t]] where k is a field). We prove that Euclide-like algorithms are…

Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…

Assuming Schanuel's conjecture, we prove that any polynomial exponential equation in one variable must have a solution that is transcendental over a given finitely generated field. With the help of some recent results in Diophantine…

We study solvability of the Diophantine equation \begin{equation*} \frac{n}{2^{n}}=\sum_{i=1}^{k}\frac{a_{i}}{2^{a_{i}}}, \end{equation*} in integers $n, k, a_{1},\ldots, a_{k}$ satisfying the conditions $k\geq 2$ and $a_{i}<a_{i+1}$ for…

This paper provides an estimate of the sum of a homogeneous polynomial $P$ of degree $\nu$ and mean zero over the lattice points inside a sphere of radius $R$. It is proved that $$ \sum_{\mathbf x \in \mathbb Z^3 \atop |\mathbf x| \le R}…

Let $X^N$ be a family of $N\times N$ independent GUE random matrices, $Z^N$ a family of deterministic matrices, $P$ a self-adjoint non-commutative polynomial, that is for any $N$, $P(X^N)$ is self-adjoint, $f$ a smooth function. We prove…

We show that there exists an algorithm to decide any single equation in the Heisenberg group in finite time. The method works for all two-step nilpotent groups with rank-one commutator, which includes the higher Heisenberg groups. We also…

This paper explores multiple closely related themes: bounding the complexity of Diophantine equations over the integers and developing mathematical proofs in parallel with formal theorem provers. Hilbert's Tenth Problem (H10) asks about the…

Let $G$ be a non-trivial torsion free group and $s(t)=g_{1}t^{\epsilon_{1}}g_{2}t^{\epsilon_{2}} \cdots g_{n}t^{\epsilon_{n}}=1 \; (g_{i} \in G,\ \epsilon_i=\pm 1)$ be an equation over $G$ containing no blocks of the form…