Related papers: The Diophantine problem in finitely generated comm…

We show that the decidability of an amplification of Hilbert's Tenth Problem in three variables implies the existence of uncomputably large integral points on certain algebraic curves. We obtain this as a corollary of a new positive…

We investigate a family of Diophantine polynomial equations which involve continuant functions. In particular, given a polynomial $P(x)\in \mathbb{Z}[x]$ and $n\in \mathbb{N}$, we consider the equation $P(K_n(x_1,\ldots, x_n)) =…

We know that for a finite field $F$, every function on $F$ can be given by a polynomial with coefficients in $F$. What about the converse? i.e. if $R$ is a ring (not necessarily commutative or with unity) such that every function on $R$ can…

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.

The problem of linking the structure of a finite linear dynamical system with its dynamics is well understood when the phase space is a vector space over a finite field. The cycle structure of such a system can be described by the…

For a commutative finite $\mathbb{Z}$-algebra, i.e., for a commutative ring $R$ whose additive group is finitely generated, it is known that the group of units of $R$ is finitely generated, as well. Our main results are algorithms to…

We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…

We consider Hilbert's tenth problem for two families of noncommutative rings. Let $K$ be a field of characteristic $p$. We start by showing that Hilbert's tenth problem has a negative answer over the twisted polynomial ring $K\{\tau\}$ and…

We consider the MIN-r-LIN(R) problem: given a system S of length-r linear equations over a ring R, find a subset of equations Z of minimum cardinality such that S-Z is satisfiable. The problem is NP-hard and UGC-hard to approximate within…

We begin to study model-theoretic properties of non-split isotropic reductive group schemes. In this paper we show that the base ring $K$ is e-interpretable in the point group $G(K)$ of every sufficiently isotropic reductive group scheme…

Let $K$ be a number field, let $L$ be an algebraic (possibly infinite degree) extension of $K$, and let $O_K$ $\subset$ $O_L$ be their rings of integers. Suppose $A$ is an abelian variety defined over $K$ such that $A(K)$ is infinite and…

We prove, assuming resolution of singularities in positive characteristic, an analogue of Siegel's theorem on sum of squares in positive characteristic. The method of proof combines techniques from central simple algebras with model theory…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely many elements. We study a generalisation of linear programming where constraints are expressed by an orbit-finite system of…

This paper introduces and studies a new class of rings called {\it $U\sqrt{\Delta}$-rings}. A ring $R$ is $U\sqrt{\Delta}$ if every non-unit element can be written as the product of a unit and an element from $\sqrt{\Delta(R)}$, where…

We study the Diophantine equations obtained by equating a polynomial and the factorial function, and prove the finiteness of integer solutions under certain conditions. For example, we show that there exists only finitely many $l$ such that…

Altenbernd, Thomas and W\"ohrle have considered in [ATW02] acceptance of languages of infinite two-dimensional words (infinite pictures) by finite tiling systems, with the usual acceptance conditions, such as the B\"uchi and Muller ones,…

For von Neumann *-regular rings R of endomorphisms (the involution given by taking adjoints) of inner product spaces we provide a condition on r in R (in terms of action of r on finite dimensional subspaces) for r being a unit. It remains…

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…

Recently it was shown that it is undecidable whether a term rewrite system can be proved terminating by a polynomial interpretation in the natural numbers. In this paper we show that this is also the case when restricting the…