Related papers: The word and conjugacy problems in lacunary hyperb…

We prove that the word problem is undecidable in functionally recursive groups, and that the order problem is undecidable in automata groups, even under the assumption that they are contracting.

For an infinite group $G$, the poset $\mathcal{L}_G$ of group topologies constitutes a complete lattice. Although $\mathcal{L}_G$ is modular when $G$ is abelian, this property fails to persist for nilpotent groups. Extending Arnautov's 2010…

The probabilistic Waring problem for finite simple groups asks whether every word of the form $w_1w_2$, where $w_1$ and $w_2$ are non-trivial words in disjoint sets of variables, induces almost uniform distribution on finite simple groups…

Let $G$ be a simple algebraic group over an algebraically closed field and let $X$ be an irreducible subvariety of $G^r$ with $r \geqslant 2$. In this paper, we consider the general problem of determining if there exists a tuple $(x_1,…

In this paper, we prove a series of results on group embeddings in groups with a small number of generators. We show that each finitely generated group $G$ lying in a variety ${\mathcal M}$ can be embedded in a $4$-generated group $H \in…

Given a group $G$ with bounded torsion that acts properly on a systolic complex, we show that every solvable subgroup of $G$ is finitely generated and virtually abelian of rank at most $2$. In particular this gives a new proof of the above…

Let $G$ be a linear algebraic group over an algebraically closed field of characteristic $p\geq 0$. We show that if $H_1$ and $H_2$ are connected subgroups of $G$ such that $H_1$ and $H_2$ have a common maximal unipotent subgroup and…

We show that the Word Problem in finitely generated subgroups of $\textsf{GL}_d(\mathbb{Z})$ can be solved in linear average-case complexity. This is done under the bit-complexity model, which accounts for the fact that large integers are…

In this paper we prove several results regarding decidability of the membership problem for certain submonoids in amalgamated free products and HNN extensions of groups. These general results are then applied to solve the prefix membership…

We present a new algorithm deciding if the intersection of a quasiconvex subgroup of a negatively curved group with a conjugate is finite. We also give a short proof of decidability of the membership problem for quasiconvex subgroups of…

When $G$ is solvable group, we prove that the number of conjugacy classes of elements of prime power order is less than or equal to the number of irreducible characters with values in fields where $\mathbb {Q}$ is extended by prime power…

We consider the Membership and the Half-Space Reachability problems for matrices in dimensions two and three. Our first main result is that the Membership Problem is decidable for finitely generated sub-semigroups of the Heisenberg group…

The submonoid membership problem for a finitely generated group $G$ is the decision problem, where for a given finitely generated submonoid $M$ of $G$ and a group element $g$ it is asked whether $g \in M$. In this paper, we prove that for a…

We establish new results on the weak containment of quasi-regular and Koopman representations of a second countable locally compact group $G$ associated with non-singular $G$-spaces. We deduce that any two boundary representations of a…

Tkachenko and Yaschenko [34] characterized the abelian groups G such that all proper unconditionally closed subsets of G are finite, these are precisely the abelian groups G having cofinite Zariski topology (they proved that such a G is…

By algorithmic metatheorems for a model checking problem P over infinite-state systems we mean generic results that can be used to infer decidability (possibly complexity) of P not only over a specific class of infinite systems, but over a…

It is proved that an endomorphism $\varphi$ of a hyperbolic group $G$ satisfies a H\"older condition with respect to a visual metric if and only if $\varphi$ is virtually injective and $G\varphi$ is a quasiconvex subgroup of $G$. If $G$ is…

We show that any finite monoid or semigroup presentation satisfying the small overlap condition C(4) has word problem which is a deterministic rational relation. It follows that the set of lexicographically minimal words forms a regular…

For a fixed word hyperbolic group we compare different residual properties related to quasiconvex subgroups.

We give a solution to Dehn's isomorphism problem for the class of all hyperbolic groups, possibly with torsion. We also prove a relative version for groups with peripheral structures. As a corollary, we give a uniform solution to…