Related papers: Strong conciseness of Engel words in profinite gro…
We establish new characterizations of primitive elements and free factors in free groups, which are based on the distributions they induce on finite groups. For every finite group $G$, a word $w$ in the free group on $k$ generators induces…
For $G$ a finite group, let $d_2(G)$ denote the proportion of triples $(x, y, z) \in G^3$ such that $[x, y, z] = 1$. We determine the structure of finite groups $G$ such that $d_2(G)$ is bounded away from zero: if $d_2(G) \geq \epsilon >…
We describe a procedure which verifies that a group given by generators and relators is word-hyperbolic. This procedure always works with a group which is word-hyperbolic, provided there is sufficient memory and time devoted to the problem.…
A right Engel sink of an element $g$ of a group $G$ is a subset containing all sufficiently long commutators $[...[[g,x],x],\dots ,x]$. We prove that if $G$ is a compact group in which, for some $k$, every commutator $[...[g_1,g_2],\dots…
The \emph{word problem} of a group $G = \langle \Sigma \rangle$ can be defined as the set of formal words in $\Sigma^*$ that represent the identity in $G$. When viewed as formal languages, this gives a strong connection between classes of…
Given a discrete (resp. profinite) group $G$, we define $NCC(G)$ to be the smallest number of cyclic (resp. procyclic) subgroups of $G$ whose conjugates cover $G$. In this paper we determine all residually finite discrete groups with finite…
A profinite group $G$ is just infinite if every closed normal subgroup of $G$ is of finite index. We prove that an infinite profinite group is just infinite if and only if, for every open subgroup $H$ of $G$, there are only finitely many…
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.
Let G be a finite group of nilpotency class 2 and w a group word. In this short paper we show that the probability that a random n-tuple of elements from G satisfies w is at least one over the order of G. This answers a special case of a…
Let G be a finite quasisimple group of Lie type. We show that there are regular semisimple elements x,y in G, x of prime order, and |y| is divisible by at most two primes, such that the product of the conjugacy classes of x and y contain…
We initiate the study of profinite groups of non-negative deficiency. The principal focus of the paper is to show that the existence of a finitely generated normal subgroup of infinite index in a profinite group $G$ of non-negative…
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…
To any infinite word w over a finite alphabet A we can associate two infinite words min(w) and max(w) such that any prefix of min(w) (resp. max(w)) is the lexicographically smallest (resp. greatest) amongst the factors of w of the same…
We define a group as strongly bounded if every isometric action on a metric space has bounded orbits. This latter property is equivalent to the so-called uncountable strong cofinality, recently introduced by G. Bergman. Our main result is…
By arithmeticity and superrigidity, a commensurability class of lattices in a higher rank Lie group is defined by a unique algebraic group over a unique number subfield of $\mathbb{R}$ or $\mathbb{C}$. We prove an adelic version of…
An element of a group is called $\textit{strongly reversible}$ or $\textit{strongly real}$ if it can be expressed as a product of two involutions. We provide necessary and sufficient conditions for an element of $\mathrm{SL}(n,\mathbb{C})$…
Let $F$ be a free non-abelian group. We show that for any group word $w$ the set $w[F]$ of all values of $w$ in $F$ is rational in $F$ if and only if $w[F] = 1$ or $w[F] = F.$ We generalize this to a wide class of free products of groups.
Profinite congruences on profinite algebras determining profinite quotients are difficult to describe. In particular, no constructive description is known of the least profinite congruence containing a given binary relation on the algebra.…
Surface groups are known to be the Poincar\'e Duality groups of dimension two since the work of Eckmann, Linnell and M\"uller. We prove a prosolvable analogue of this result that allows us to show that surface groups are profinitely (and…
We introduce the notion of a subgraph generated by an $R$-word $r$ of the Sch\"{u}tzenberger graph of a positive word $w$, $S\Gamma(w)$, where $w$ contains $r$ as its subword. We show that the word problem for a finitely presented Adian…