Related papers: On words that are concise in residually finite gro…

A group $G$ is said to be a $C$-group if every subgroup $H$ has a permutable complement, i.e. if there exists a subgroup $K$ of $G$ such that $G=HK$ and $H \cap K=1$. In this paper, we study the profinite counterpart of this concept. We say…

The residual closure of a subgroup $H$ of a group $G$ is the intersection of all virtually normal subgroups of $G$ containing $H$. We show that if $G$ is generated by finitely many cosets of $H$ and if $H$ is commensurated, then the…

We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has a decomposition that is invariant under automorphisms of G,…

We show that an element w of a free group F on n generators defines a surjective word map of PSL(2,C)^n onto PSL(2,C) unless w belongs to the second derived subgroup of F. We also describe certain words maps that are surjective on SL(2,C) x…

Let $f_W(n)$ be the number of different factors of length $n$ appearing in $W$. A classical result of Morse and Hedlund, stated in 1938, asserts that an infinite word $W$ is ultimately periodic if and only if $f_W(n)\leq n$ for some $n\in…

Surface groups are determined among limit groups by their profinite completions. As a corollary, the set of surface words in a free group is closed in the profinite topology.

A group is called capable if it is a central factor group. We consider the capability of finite groups of class two and exponent $p$, $p$ an odd prime. We restate the problem of capability as a problem about linear transformations, which…

A conjecture of Rosenberger says that a group of the form $\langle x,y|x^p=y^q=W(x,y)^r=1\rangle$ (with $r>1$) is either virtually solvable or contains a non-abelian free subgroup. This note is an account of an attack on the conjecture in…

We prove that certain Fuchsian triangle groups are profinitely rigid in the absolute sense, i.e. each is distinguished from all other finitely generated, residually finite groups by its set of finite quotients. We also develop a method…

Right feeble groups are defined as groupoids $(X,*)$ such that (i) $x, y\in X$ implies the existence of $a, b \in X$ such that $a*x = y$ and $b*y = x$. Furthermore, (ii) if $x, y, z \in X$ then there is an element $w\in X$ such that…

A finitely generated group $G$ is said to be condensed if its isomorphism class in the space of finitely generated marked groups has no isolated points. We prove that every product variety $\mathcal{UV}$, where $\mathcal{U}$ (respectively,…

Rational word languages can be defined by several equivalent means: finite state automata, rational expressions, finite congruences, or monadic second-order (MSO) logic. The robust subclass of aperiodic languages is defined by: counter-free…

The factor complexity function $C_w(n)$ of a finite or infinite word $w$ counts the number of distinct factors of $w$ of length $n$ for each $n \ge 0$. A finite word $w$ of length $|w|$ is said to be trapezoidal if the graph of its factor…

A group $G$ is said to have restricted centralizers if for every $x\in G$ the centralizer $C_G(x)$ either is finite or has finite index in $G$. Shalev showed that a profinite group with restricted centralizers is virtually abelian. Here we…

We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite…

A finite group $G$ is called an F-group if for every $x, y \in G \setminus Z(G)$, $C(x) \leq C(y)$ implies that $C(x) = C(y)$. On the otherhand, two elements of a group are said to be $z$-equivalent or in the same $z$-class if their…

We give lower bounds on the complexity of the word problem of certain non-solvable groups: for a large class of non-solvable infinite groups, including in particular free groups, Grigorchuk's group and Thompson's groups, we prove that their…

It is well known that if $G$ is a group and $H$ is a normal subgroup of $G$ of finite index $k$, then $x^k \in H$ for every $x \in G$. We examine finite groups $G$ with the property that $x^k \in H$ for every subgroup $H$ of $G$, where $k$…

Let $G$ be a finite group and $\psi(G) = \sum_{g \in G} o(g)$, where $o(g)$ denotes the order of $g \in G$. In [M. Herzog, et. al., Two new criteria for solvability of finite groups, J. Algebra, 2018], the authors put forward the following…

We study a class of inverse monoids of the form M = Inv< X | w=1 >, where the single relator w has a combinatorial property that we call sparse. For a sparse word w, we prove that the word problem for M is decidable. We also show that the…