Related papers: The Diophantine problem in finitely generated comm…

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…

Let $\Gamma$ be a centerless irreducible higher rank arithmetic lattice in characteristic zero. We prove that if $\Gamma$ is either non-uniform or is uniform of orthogonal type and dimension at least 9, then $\Gamma$ is bi-interpretable…

Starting from Ritt's classical theorems, we give a survey of results in functional decomposition of polynomials and of applications in Diophantine equations. This includes sufficient conditions for the indecomposability of polynomials, the…

Let $A\subset \N_{+}$ and by $P_{A}(n)$ denotes the number of partitions of an integer $n$ into parts from the set $A$. The aim of this paper is to prove several result concerning the existence of integer solutions of Diophantine equations…

We show that Hilbert's Tenth Problem is undecidable for complementary subrings of number fields and that the p-adic and archimedean ring versions of Mazur's conjectures do not hold in these rings. More specifically, given a number field K,…

We prove Dirichlet's theorem for polynomial rings: Let F be a pseudo algebraically closed field. Then for all relatively prime polynomials a(X), b(X)\in F[X] and for every sufficiently large positive integer n there exist infinitely many…

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…

Computation of polynomial relative invariants is a classical tool in algebra. Relative differential invariants are central for the equivalence problem of geometric structures. We address the fundamental problem of finite generation of their…

We construct a finitely presented group with undecidable word problem and with Dehn function bounded by a quadratic function on an infinite set of positive integers.

Let f(t,X) be an irreducible polynomial over the field of rational functions k(t), where k is a number field. Let O be the ring of integers of k. Hilbert's irreducibility theorem gives infinitely many integral specializations of t to values…

We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…

In this paper we deal with a non-linear Diophantine equation which arises from the determinant computation of an integer matrix. We show how to find a solution, when it exists. We define an equivalence relation and show how the set of all…

We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has a decomposition that is invariant under automorphisms of G,…

Based on the MRDP theorem concerning the Hilbert tenth problem, there is a corresponding Diophantine equation called proof equation for every formula of the First-order Peano Arithmetic (PA). A formula is provable in PA, if and only if the…

We give solutions of a Diophantine equation containing factorials, which can be written as a cubic form, or as a sum of binomial coefficients. We also give some solutions to higher degree forms and relate some solutions to an unsolvable…

We show that the ring of integers of $\mathbb{Q}^{\text{tr}}$ is existentially definable in the ring of integers of $\mathbb{Q}^{\text{tr}}(i)$, where $\mathbb{Q}^{\text{tr}}$ denotes the field of all totally real numbers. This implies that…

We study the Constraint Satisfaction Problem CSP(A), where A is first-order definable in (Z;+,1) and contains +. We prove such problems are either in P or NP-complete.

We construct and study finitely presented groups with quadratic Dehn function (QD-groups) and present the following applications of the method developed in our recent papers. (1) The isomorphism problem is undecidable in the class of…

This paper initiates a novel research direction in the theory of Diophantine equations: define an appropriate version of the equation's size, order all polynomial Diophantine equations starting from the smallest ones, and then solve the…

We study orbit-finite systems of linear equations, in the setting of sets with atoms. Our principal contribution is a decision procedure for solvability of such systems. The procedure works for every field (and even commutative ring) under…