Related papers: Finite axiomatizability for profinite groups

William W. Boone and Graham Higman proved that a finitely generated group has soluble word problem if and only if it can be embedded in a simple group that can be embedded in a finitely presented group. We prove the exact analogue for…

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…

A subgroup $H$ of a group $G$ is said to be an $IC\Phi$-subgroup of $G$ if $H \cap [H,G] \le \Phi(H)$. We analyze the structure of a finite group $G$ under the assumption that some given subgroups of $G$ are $IC\Phi$-subgroups of $G$. A new…

We study the question of whether a given regular language of finite trees can be defined in first-order logic. We develop an algebraic approach to address this question and we use it to derive several necessary and sufficient conditions for…

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…

The motivation for this paper is to extend the known model theoretic treatment of differential Galois theory to the case of linear difference equations (where the derivative is replaced by an automorphism.) The model theoretic difficulties…

A profinite group equipped with an expansive endomorphism is equivalent to a one-sided group shift. We show that these groups have a very restricted structure. More precisely, we show that any such group can be decomposed into a finite…

A group word $w$ is said to be strongly concise in a class $\mathscr C$ of profinite groups if, for any group $G$ in $\mathscr C$, either $w$ takes at least continuum values in $G$ or the verbal subgroup $w(G)$ is finite. It is conjectured…

We consider finitely presented,residually finite groups $G$ and finitely generated normal subgroups $A$ such that the inclusion $A\hookrightarrow G$ induces an isomorphism from the profinite completion of $A$ to a direct factor of the…

We introduce and investigate a class of profinite groups defined via extensions of centralizers analogous to the extensively studied class of finitely generated fully residually free groups, that is, limit groups (in the sense of Z. Sela).…

A finitely presented group F is called flawed if Hom(F,G)//G deformation retracts onto its subspace Hom(F,K)/K for reductive affine algebraic groups G and maximal compact subgroups K in G. After discussing generalities concerning flawed…

The article deals with profinite groups in which the centralizers are abelian (CA-groups), that is, with profinite commutativity-transitive groups. It is shown that such groups are virtually pronilpotent. More precisely, let G be a…

We give necessary and sufficient conditions for the group of a rational maximal bifix code $Z$ to be isomorphic with the $F$-group of $Z\cap F$, when $F$ is recurrent and $Z\cap F$ is rational. The case where $F$ is uniformly recurrent,…

We define, for any group $G$, finite approximations ; with this tool, we give a new presentation of the profinite completion $\hat{\pi} : G \to \hat{G}$ of an abtract group $G$. We then prove the following theorem : if $k$ is a finite prime…

We study the profinite genus of HNN-extensions whose associated subgroups are finite. We give precise formulas for the number of isomorphism classes of HNN(G,H,K,t,f) and of its profinite completion and compute the profinite genus of such…

A group $\Gamma$ has separable cohomology if the profinite completion map $\iota \colon \Gamma \to \widehat{\Gamma}$ induces an isomorphism on cohomology with finite coefficient modules. In this article, cohomological separability 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…

Autostackability for finitely presented groups is a topological property of the Cayley graph combined with formal language theoretic restrictions, that implies solvability of the word problem. The class of autostackable groups is known to…

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…

A set $F$ of formulas is complete relative to a given class of logics, if every logic from this class can be axiomatized by formulas from $F$. A set of formulas $F$ is {\L}-complete relative to a given class of logics, if every logic of…