Related papers: A note on words having the same image on finite gr…
We consider pairs of finitely presented, residually finite groups $u:P\hookrightarrow \Gamma$. We prove that there is no algorithm that, given an arbitrary such pair, can determine whether or not the associated map of profinite completions…
We define and study the class of positively finitely related (PFR) profinite groups. Positive finite relatedness is a probabilistic property of profinite groups which provides a first step to defining higher finiteness properties of…
An element w in the free group on r letters defines a map f from G^r to G for each group G. In this note, we show that whenever w is non-trivial and G is a semisimple algebraic group, f is dominant. When G is a finite simple group, the…
We construct non-power words which have small image in SL(2; 22n) for each n. In particular, the corresponding word maps are non-surjective. We also use this to construct word maps whose values are precisely the identity and a single…
The usual way to investigate the statistical properties of finitely generated subgroups of free groups, and of finite presentations of groups, is based on the so-called word-based distribution: subgroups are generated (finite presentations…
The idempotent problem of a finitely generated inverse semigroup is the formal language of all words over the generators representing idempotent elements. This note proves that a finitely generated inverse semigroup with regular idempotent…
We prove that if G is the circle group or a profinite group, then the all of the homotopical information of the category of rational G-spectra is captured by triangulated structure of the rational G-equivariant stable homotopy category.…
A word in a group is called a test element if any endomorphism fixing it is necessarily an automorphism. In this note, we give a sufficient condition in geometry to construct test elements for monomorphisms of a free group, by using the…
In the algebraic theory of codes and formal languages, the set $Q$ of all primitive words over some alphabet $\zi $ has received special interest. With this survey article we give an overview about relevant research to this topic during the…
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…
We initiate the study of profinite rigidity for modules over a Noetherian domain: to what extent are these objects determined by their finite images? We establish foundational statements in analogy to classical results in the category of…
We show that for any finite group $G$ and for any $d$ there exists a word $w\in F_{d}$ such that a $d$-tuple in $G$ satisfies $w$ if and only if it generates a solvable subgroup. In particular, if $G$ itself is not solvable, then it cannot…
We prove that amongst the class of free-by-cyclic groups, Gromov hyperbolicity is an invariant of the profinite completion. We show that whenever $G$ is a free-by-cyclic group with first Betti number equal to one, and $H$ is a…
A group G has restricted centralizers if for each g in G the centralizer C_G(g) either is finite or has finite index in G. A theorem of Shalev states that a profinite group with restricted centralizers is abelian-by-finite. In the present…
It is shown, for a given graph group $G$, that the fixed point subgroup Fix$\,\varphi$ is finitely generated for every endomorphism $\varphi$ of $G$ if and only if $G$ is a free product of free abelian groups. The same conditions hold for…
We show that if the Sch\"{u}tzenberger graph of every positive word, that contains an $R$-word only once as it's subword, is finite over an Adain presentation $\langle X|u=v\rangle$, then the Sch\"{u}tzenberger graph of every positive word…
Two finitely generated groups have the same set of finite quotients if and only if their profinite completions are isomorphic. Consider the map which sends (the isomorphism class of) an S-arithmetic group to (the isomorphism class of) its…
We say that an infinite word w is weak abelian periodic if it can be factorized into finite words with the same frequencies of letters. In the paper we study properties of weak abelian periodicity, its relations with balance and frequency.…
This paper concerns a specific class of strict standard episturmian words whose directive words resemble those of characteristic Sturmian words. In particular, we explicitly determine all integer powers occurring in such infinite words,…
A group-word w is called concise if whenever the set of w-values in a group G is finite it always follows that the verbal subgroup w(G) is finite. More generally, a word w is said to be concise in a class of groups X if whenever the set of…