Related papers: Isomorphism problem for finitely generated fully r…
We construct a class of finitely presented groups where the isomorphism problem is solvable but the commensurability problem is unsolvable. Conversely, we construct a class of finitely presented groups within which the commensurability…
The first-order theory of the automorphism group of an infinite resplendent model in a finite language is undecidable.
We prove the following results: (1) Every group is a maximal subgroup of some free idempotent generated semigroup. (2) Every finitely presented group is a maximal subgroup of some free idempotent generated semigroup arising from a finite…
Given an inverse semigroup $G_0$ of bounded type, we show, along with some other assumptions, that if the set of incompressible elements of $G_0$ is finite, then any finitely generated subgroup $G$ of the topological full group…
In this article, we characterize the (covariant) isotropy groups of free, finitely generated racks and quandles. As a consequence, we show that the usual inner automorphisms of such racks and quandles are precisely those automorphisms that…
Our main result is to show that every infinite, countable, residually finite group $G$ admits a Hausdorff group topology which is neither discrete nor precompact.
Universality has been an important concept in computable structure theory. A class $\mathcal{C}$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $\mathcal{C}$ with the same…
Let G be a torsion--free abelian group of finite rank. The automorphism group Aut(G) acts on the set of maximal independent subsets of G. The orbits of this action are the isomorphism classes of indecomposable decompositions of G. G…
We introduce the notion of residual finiteness for categories. In analogy with the group-theoretic setting, we prove that free categories and finitely generated subcategories of finite-dimensional vector spaces are residually finite.…
We study the structure of discrete subgroups of the group $G[[r]]$ of complex formal power series under the operation of composition of series. In particular, we prove that every finitely generated fully residually free group is embeddable…
For a finite group G of Lie type and a prime p, we compare the automorphism groups of the fusion and linking systems of G at p with the automorphism group of G itself. When p is the defining characteristic of G, they are all isomorphic,…
A finitely generated subgroup H of a torsion-free hyperbolic group G is called immutable if there are only finitely many conjugacy classes of injections of H into G. We show that there is no uniform algorithm to recognize immutability,…
We combine classical methods of combinatorial group theory with the theory of small cancellations over relatively hyperbolic groups to construct finitely generated torsion-free groups that have only finitely many classes of conjugate…
We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and…
We show that finitely generated cohomology is invariant under separable equivalences for all algebras. As a result, we obtain a proof of the finite generation of cohomology for finite symmetric tensor categories in characteristic zero, as…
We prove that the word problem for the infinite cyclic group is not EDT0L, and obtain as a corollary that a finitely generated group with EDT0L word problem must be torsion. In addition, we show that the property of having an EDT0L word…
We show that any isometric action of a residually finite group admits approximate local finite models. As a consequence, if $G$ is residually finite, every isometric $G$-action embeds isometrically into a metric ultraproduct of finite…
Testing isomorphism of infinite groups is a classical topic, but from the complexity theory viewpoint, few results are known. S{\'e}nizergues and the fifth author (ICALP2018) proved that the isomorphism problem for virtually free groups is…
We present an algorithm for the following problem: given a context-free grammar for the word problem of a virtually free group $G$, compute a finite graph of groups $\mathcal{G}$ with finite vertex groups and fundamental group $G$. Our…
We obtain some general restrictions on the continuous endomorphisms of a profinite group G under the assumption that G has only finitely many open subgroups of each index (an assumption which automatically holds, for instance, if G is…