Related papers: On profinite groups admitting a word with only few…

We give new and improved results on the freeness of subgroups of free profinite groups: A subgroup containing the normal closure of a finite word in the elements of a basis is free; Every infinite index subgroup of a finitely generated…

Let $G$ be a group. Write $G^{*}=G\setminus \{1\}$. An element $x$ of $G^{*}$ will be called deficient if $ \langle x\rangle < C_G(x)$ and it will be called non-deficient if $\langle x\rangle = C_G(x).$ If $x\in G$ is deficient…

In response to questions by Kassabov, Nikolov and Shalev, we show that a given subset $A$ of a finite simple group $G$ is the image of some word map $w : G\times G\to G $ if and only if (i) $A$ contains the identity and (ii) $A$ is…

Let $G$ be 2-generated group. The generating graph $\Gamma(G)$ of $G$ is the graph whose vertices are the elements of $G$ and where two vertices $g$ and $h$ are adjacent if $G = \langle g, h \rangle.$ This definition can be extended to a…

If a finite group G has a presentation with d generators and r relations, it is well-known that r - d is at least the rank of the Schur multiplier of G; a presentation is called efficient if equality holds. There is an analogous definition…

We consider the class of groups whose word problem is poly-context-free; that is, an intersection of finitely many context-free languages. We show that any group which is virtually a finitely generated subgroup of a direct product of free…

Let A be an alphabet and W be a set of words in the free monoid A*. Let S(W) denote the Rees quotient over the ideal of A* consisting of all words that are not subwords of words in W. We call a set of words W finitely based if the monoid…

We discuss whether finiteness properties of a profinite group $G$ can be deduced from the coefficients of the probabilistic zeta function $P_G(s)$. In particular we prove that if $P_G(s)$ is rational and all but finitely many non abelian…

A group is said to have the Magnus Property (MP) if whenever two elements have the same normal closure then they are conjugate or inverse-conjugate. We show that a profinite MP group $G$ is prosolvable and any quotient of it is again MP. As…

We construct the first example of a finitely-presented, residually-finite group that contains an infinite sequence of non-isomorphic finitely-presented subgroups such that each of the inclusion maps induces an isomorphism of profinite…

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…

Can one detect free products of groups via their profinite completions? We answer positively among virtually free groups. More precisely, we prove that a subgroup of a finitely generated virtually free group $G$ is a free factor if and only…

We find surface subgroups in certain one-relator groups with torsion and use this to deduce a profinite criterion for a word in the free group to be primitive.

For a group G and a positive integer n write B_n(G) = {x \in G : |x^G | \le n}. If s is a positive integer and w is a group word, say that G satisfies the (n,s)-covering condition with respect to the word w if there exists a subset S of G…

Suppose $C(G)$ denotes the set of all cyclic subgroups of a finite group $G$, and $\mathcal{O}_{2}(G)$ denotes the number of elements of order $2$ in $G$. In [Marius T., Finite groups with a certain number of cyclic subgroups. The American…

Let $\mathfrak A$ be an alphabet and $W$ be a set of words in the free monoid ${\mathfrak A}^*$. Let $S(W)$ denote the Rees quotient over the ideal of ${\mathfrak A}^*$ consisting of all words that are not subwords of words in $W$. A set of…

A residually finite (profinite) group $G$ is just infinite if every non-trivial (closed) normal subgroup of $G$ is of finite index. This paper considers the problem of determining whether a (closed) subgroup $H$ of a just infinite group is…

Let $G$ be a finite group. A proper subgroup $H$ of $G$ is said to be large if the order of $H$ satisfies the bound $|H|^3 \ge |G|$. In this note we determine all the large maximal subgroups of finite simple groups, and we establish an…

Let m, n be positive integers, v a multilinear commutator word and w = v^m. We prove that if G is a residually finite group in which all w-values are n-Engel, then the verbal subgroup w(G) is locally nilpotent. We also examine the question…

In this work we introduce a new succinct variant of the word problem in a finitely generated group $G$, which we call the power word problem: the input word may contain powers $p^x$, where $p$ is a finite word over generators of $G$ and $x$…