Related papers: Groups with context-free Diophantine problem

In this paper we prove that the Diophantine problem in iterated restricted wreath products $G$ of arbitrary non-trivial free abelian groups $A_1,\ldots, A_k$, $k>1$ of finite ranks is undecidable, i.e., there is no algorithm that given a…

Let $G$ be a finitely generated group, $A$ a finite set of generators and $K$ a subgroup of $G$. We call the pair $(G,K)$ context-free if the set of all words over $A$ that reduce in $G$ to an element of $K$ is a context-free language. When…

The co-word problem of a group G generated by a set X is defined as the set of words in X which do not represent 1 in G. We introduce a new method to decide if a permutation group has context-free co-word problem. We use this method to…

We prove that the Diophantine problem for orientable quadratic equations in free metabelian groups is decidable and furthermore, NP-complete. In the case when the number of variables in the equation is bounded, the problem is decidable in…

The Diophantine problem for a monoid $M$ is the decision problem to decide whether any given system of equations has a solution in $M$. In this note, we give a simple example of a context-free, word-hyperbolic, finitely presented, special…

It is proven that if a finitely presented group is one ended it has asymptotic dimension bigger than one. It follows that finitely presented groups with asdim 1 are virtually free. A counterexample is given for the finitely generated case.

We prove that every {finitely generated residually finite}-by-sofic group satisfies Kaplansky's direct and stable finiteness conjectures with respect to all noetherian rings. We use this result to provide countably many new examples of…

We study systems of polynomial equations in infinite finitely generated commutative associative rings with an identity element. For each such ring $R$ we obtain an interpretation by systems of equations of a ring of integers $O$ of a finite…

Let $d \geq 2$ be an integer. We conjecture that there is a finitely generated perfect group whose homomorphic images include all finite $d$-generated perfect groups. We prove a special case of this conjecture for the finite perfect groups…

We show that there is a class of finite groups, the so-called perfect groups, which cannot exhibit anomalies. This implies that all non-Abelian finite simple groups are anomaly-free. On the other hand, non-perfect groups generically suffer…

In this paper we give a complete algebraic description of groups elementarily equivalent to a given free nilpotent group of finite rank.

We prove that the Diophantine problem for spherical quadratic equations in free metabelian groups is solvable and, moreover, NP-complete

A group is Artinian if there is no infinite strictly descending chain of subgroups. Ol'shanskii has asked whether there are Artinian groups of arbitrarily large cardinality. We show that this problem is essentially the same as an analogous…

This paper is the 10th in a sequence on the structure of sets of solutions to systems of equations over groups, projections of such sets (Diophantine sets), and the structure of definable sets over few classes of groups. In the 10th paper…

We prove that the generalised word problem of a finitely generated subgroup of a finitely generated virtually free group is context-free, that a hyperbolic group must be virtually free if it has a torsion-free quasiconvex subgroup of…

This paper studies the classes of semigoups and monoids with context-free and deterministic context-free word problem. First, some examples are exhibited to clarify the relationship between these classes and their connection with the…

We extend the characterization of context-free groups of Muller and Schupp in two ways. We first show that for a quasi-transitive inverse graph $\Gamma$, being quasi-isometric to a tree, or context-free (finitely many end-cones types), or…

In 1985, Dunwoody showed that finitely presentable groups are accessible. Dunwoody's result was used to show that context-free groups, groups quasi-isometric to trees or finitely presentable groups of asymptotic dimension 1 are virtually…

The \emph{word problem} of a group $G = \langle \Sigma \rangle$ can be defined as the set of formal words in $\Sigma^*$ that represent the identity in $G$. When viewed as formal languages, this gives a strong connection between classes of…

A finitely generated group admits a decomposition, called its Grushko decomposition, into a free product of freely indecomposable groups. There is an algorithm to construct the Grushko decomposition of a finite graph of finite rank free…