Related papers: Group equations with abelian predicates

We study the algebraic rank of various classes of $\mathrm{CAT}(0)$ groups. They include right-angled Coxeter groups, right-angled Artin groups, relatively hyperbolic groups and groups acting geometrically on $\mathrm{CAT}(0)$ spaces with…

We study groups having the property that every non-abelian subgroup is equal to its normalizer. This class of groups is closely related to an open problem posed by Berkovich. We give a full classification of finite groups having the above…

The survey provides an overview of the work done in the last 10 years to characterise solutions to equations in groups in terms of formal languages. We begin with the work of Ciobanu, Diekert and Elder, who showed that solutions to systems…

We show, using acylindrical hyperbolicity, that a finitely generated group splitting over $\Z$ cannot be simple. We also obtain SQ-universality in most cases, for instance a balanced group (one where if two powers of an infinite order…

Ordering theorems, characterizing when partial orders of a group extend to total orders, are used to generate hypersequent calculi for varieties of lattice-ordered groups (l-groups). These calculi are then used to provide new proofs of…

It is a known fact that any unimodular equation over an abelian group has a solution in that group itself. It is also known that for metabelian groups this does not hold; moreover, there is a unimodular equation over some metabelian group…

Let $G$ be a finite group, and assume that $G$ has an automorphism of order at least $\rho|G|$, with $\rho\in\left(0,1\right)$. Generalizing recent analogous results of the author on finite groups with a large automorphism cycle length, we…

We prove that affine Coxeter groups, even hyperbolic Coxeter groups and one-ended hyperbolic Coxeter groups are homogeneous in the sense of model theory. More generally, we prove that many (Gromov) hyperbolic groups generated by torsion…

The main goal of this paper is to apply the arithmetic method developed in our previous paper \cite{13} to determine the number of some types of subgroups of finite abelian groups.

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…

We prove that there is no algorithm that can determine whether or not a finitely presented group has a non-trivial finite quotient; indeed, this remains undecidable among the fundamental groups of compact, non-positively curved square…

In this paper, we study algorithmic problems for automaton semigroups and automaton groups related to freeness and finiteness. In the course of this study, we also exhibit some connections between the algebraic structure of automaton…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…

In this paper we exhibit the notion of (uniformly) good sections of arithmetic fundamental groups. We introduce and investigate the problem of cuspidalisation of sections of arithmetic fundamental groups, its ultimate aim is to reduce the…

We describe the two-generated limits of abelian-by-(infinite cyclic) groups in the space of marked groups using number theoretic methods. We also discuss universal equivalence of these limits.

We study limit models in the class of abelian groups with the subgroup relation and in the class of torsion-free abelian groups with the pure subgroup relation. We show: $\textbf{Theorem}$ (1) If $G$ is a limit model of cardinality…

We study notions such as finite presentability and coherence, for partially ordered abelian groups and vector spaces. Typical results are the following: (i) A partially ordered abelian group G is finitely presented if and only…

We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on ``generic-case complexity'' we show that if a finitely generated…

Finitely generated (non-abelian) free metabelian pro-p groups, and wreath products of f.g. free abelian pro-p groups, are all finitely axiomatizable in the class of all profinite groups.