Let $G$ be 2-generated group. The generating graph $Γ(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 2-generated profinite group $G,$ considering in this case topological generation. We prove that the set $V(G)$ of non-isolated vertices of $Γ(G)$ is closed in $G$ and that, if $G$ is prosoluble, then the graph $Δ(G)$ obtained from $Γ(G)$ by removing its isolated vertices is connected with diameter at most 3. However we construct an example of a 2-generated profinite group $G$ with the property that $Δ(G)$ has $2^{\aleph_0}$ connected components. This implies that the so called "swap conjecture" does not hold for finitely generated profinite groups. We also prove that if an element of $V(G)$ has finite degree in the graph $Γ(G),$ then $G$ is finite.
Given a finite group $G$ and an element $g\in G$, we may compare the expected number $e(G)$ of elements needed to generate $G$ and the expected number $e(G,g)$ of elements of $G$ needed to generate $G$ together with $g.$ We address the following question: how large can the difference $e(G)-e(G,g)$ be?
Let $(\mathcal{G},Γ)$ be an abstract graph of finite groups. If $Γ$ is finite, we can construct a profinite graph of groups in a natural way $(\hat{\mathcal{G}},Γ)$, where $\hat{\mathcal{G}}(m)$ is the profinite completion of $\mathcal{G}(m)$ for all $m \in Γ$. The main reason for this is that $Γ$ is finite, so it is already profinite. In this paper we deal with the infinite case, by constructing a profinite graph $\overlineΓ$ where $Γ$ is densely embedded and then defining a profinite graph of groups $(\widehat{\mathcal{G}},\overlineΓ)$. We also prove that the fundamental group $Π_1(\widehat{…
Let $M$ be a closed, orientable, irreducible, geometrizable 3-manifold. We prove that the profinite topology on the fundamental group of $π_1(M)$ is efficient with respect to the JSJ decomposition of $M$. We go on to prove that $π_1(M)$ is good, in the sense of Serre, if all the pieces of the JSJ decomposition are. We also prove that if $M$ is a graph manifold then $π_1(M)$ is conjugacy separable.
We define cofinite graphs and cofinite groupoids in a unified way that extends the notion of cofinite groups introduced by Hartley. The common underlying structure of all these objects is that they are directed graphs endowed with a certain type of uniform structure, that we call a cofinite uniformity. We begin by exploring the fundamental theory of cofinite directed graphs in full generality. The general theory turns out to be almost completely analogous to that of cofinite groups. For instance, every cofinite directed graph has a unique completion which is a com- pact cofinite direct graph. …
For a formation $\mathfrak{F}$ of finite groups, tight connections are established between the pro-$\mathfrak{F}$-topology of a finitely generated free group $F$ and the geometry of the Cayley graph $Γ(\hat{F_{\mathfrak{F}}})$ of the pro-$\mathfrak{F}$-completion $\hat{F_{\mathfrak {F}}}$ of $F$. For example, the Ribes--Zalesskii-Theorem is proved for the pro-$\mathfrak{F}$-topology of $F$ in case $Γ(\hat{F_{\mathfrak F}})$ is a tree-like graph. All these results are established by purely geometric proofs, without the use of inverse monoids which were indispensable in earlier papers, thereby g…
There has been much recent interest into those properties of a 3-manifold determined by the profinite completion of its fundamental group. In this paper we give readily computable criteria specifying precisely when two orientable graph manifold groups have isomorphic profinite completions. Our results also distinguish graph manifolds among the class of all 3-manifolds and give information about the structure of totally hyperbolic manifolds, and give control over the pro-$p$ completion of certain graph manifold groups.
Profinite detection of free products and free factors
Instituto de Ciencias Matemáticas, CSIC-UAM-UC3M-UCM（数学科学研究所）；Departamento de Matemáticas, Universidad Autónoma de Madrid（马德里自治大学数学系）；Departamento de Matemática, Universidade de Brasília（巴西利亚大学数学系）
The first author has associated in a natural way a profinite group to each irreducible subshift. The group in question was initially obtained as a maximal subgroup of a free profinite semigroup. In the case of minimal subshifts, the same group is shown in the present paper to also arise from geometric considerations involving the Rauzy graphs of the subshift. Indeed, the group is shown to be isomorphic to the inverse limit of the profinite completions of the fundamental groups of the Rauzy graphs of the subshift. A further result involving geometric arguments on Rauzy graphs is a criterion for…
A topological group G is profinite if it is compact and totally disconnected. Equivalently, G is the inverse limit of a surjective system of finite groups carrying the discrete topology. We discuss how to represent a countably based profinite group as a point in a Polish space. Then we study the complexity of isomorphism using the theory of Borel reducibility in descriptive set theory. For topologically finitely generated profinite groups this complexity is the same as the one of identity for reals. In general, it is the same as the complexity of isomorphism for countable graphs.
An asymmetric coloring of a graph is a coloring of its vertices that is not preserved by any non-identity automorphism of the graph. The motion of a graph is the minimal degree of its automorphism group, i.e., the minimum number of elements displaced by any non-identity automorphism. In this paper we confirm Tom Tucker's "Infinite Motion Conjecture" that connected locally finite graphs with infinite motion admit an asymmetric 2-coloring. We infer this from the more general result that the inverse limit of a sequence of finite permutation groups with disjoint domains, viewed as a permutation gr…
In this paper we investigate the following general problem. Let $G$ be a group and let $i(G)$ be a property of $G$. Is there an integer $d$ such that $G$ contains a $d$-generated subgroup $H$ with $i(H)=i(G)$? Here we consider the case where $G$ is a profinite group and $H$ is a closed subgroup, extending earlier work of Lucchini and others on finite groups. For example, we prove that $d=3$ if $i(G)$ is the prime graph of $G$, which is best possible, and we show that $d=2$ if $i(G)$ is the exponent of a finitely generated prosupersolvable group $G$.
We give necessary and sufficient conditions on the graph of a right-angled Artin group that determine whether the group is subgroup separable or not. Moreover, we investigate the profinite topology of the direct product of two free groups. We show that the profinite topology of the above group is strongly connected with the profinite topology of the free group of rank two.
In this paper we prove that RAAGs are distinguished from each other by their pro-$p$ completions for any choice of prime $p$, and that RACGs are distinguished from each other by their pro-2 completions. We also give a new proof that hyperbolic virtually special groups are good in the sense of Serre. Furthermore we give an example of a property of the underlying graph of a RAAG that translates to a property of the profinite completion.
Suzuki recently gave constructions of non-discrete examples of locally compact C*-simple groups and Raum showed C*-simplicity of the relative profinite completions of the Baumslag-Solitar groups by using Suzuki's results. We extend this result to some fundamental groups of graphs of groups called generalized Baumslag-Solitar groups. In this article, we focus on some sufficient condition to show that these locally compact groups are C*-simple and that KMS-weights of these reduced group C*-algebras are unique. This condition is an analogue of the Powers averaging property of discrete groups and …
We use the theory of group actions on profinite trees to prove that the fundamental group of a finite, 1-acylindrical graph of free groups with finitely generated edge groups is conjugacy separable. This has several applications: we prove that positive, $C'(1/6)$ one-relator groups are conjugacy separable; we provide a conjugacy separable version of the Rips construction; we use this latter to provide an example of two finitely presented, residually finite groups that have isomorphic profinite completions, such that one is conjugacy separable and the other does not even have solvable conjugacy…
We study profinite actions of residually finite groups in terms of weak containment. We show that two strongly ergodic profinite actions of a group are weakly equivalent if and only if they are isomorphic. This allows us to construct continuum many pairwise weakly inequivalent free actions of a large class of groups, including free groups and linear groups with property (T). We also prove that for chains of subgroups of finite index, Lubotzky's property ($τ$) is inherited when taking the intersection with a fixed subgroup of finite index. That this is not true for families of subgroups in gene…
Let $\{G_i :i\in\N\}$ be a family of finite Abelian groups. We say that a subgroup $G\leq \prod\limits_{i\in \N}G_i$ is \emph{order controllable} if for every $i\in \mathbb{N}$ there is $n_i\in \mathbb{N}$ such that for each $c\in G$, there exists $c_1\in G$ satisfying that $c_{1|[1,i]}=c_{|[1,i]}$, $supp (c_1)\subseteq [1,n_i]$, and order$(c_1)$ divides order$(c_{|[1,n_i]})$. In this paper we investigate the structure of order controllable group codes. It is proved that if $G$ is an order controllable, shift invariant, group code over a finite abelian group $H$, then $G$ possesses a finite ca…
In this paper, we study the actions of profinite groups on Cantor sets which arise from representations of Galois groups of certain fields of rational functions. Such representations are associated to polynomials, and they are called profinite iterated monodromy groups. We are interested in a topological invariant of such actions called the asymptotic discriminant. In particular, we give a complete classification by whether the asymptotic discriminant is stable or wild in the case when the polynomial generating the representation is quadratic. We also study different ways in which a wild asymp…
We prove that the property of being cyclic subgroup separable, that is having all cyclic subgroups closed in the profinite topology, is preserved under forming graph products. Furthermore, we develop the tools to study the analogous question in the pro-$p$ case. For a wide class of groups we show that the relevant cyclic subgroups - which are called $p$-isolated - are closed in the pro-$p$ topology of the graph product. In particular, we show that every $p$-isolated cyclic subgroup of a right-angled Artin group is closed in the pro-$p$ topology, and we fully characterise such subgroups.
We prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.
A cohomological translation of the Kaplansky radical for profinite groups
Università di Milano-Bicocca（米兰比可卡大学）；Femto-St, Université Marie et Louis Pasteur（微纳科学与技术研究所，玛丽和路易·巴斯德大学）；Universidade Federal de Minas Gerais（米纳斯吉拉斯联邦大学）；University of Insubria（因斯布鲁克大学）
A well known question of Gromov asks whether every one-ended hyperbolic group $Γ$ has a surface subgroup. We give a positive answer when $Γ$ is the fundamental group of a graph of free groups with cyclic edge groups. As a result, Gromov's question is reduced (modulo a technical assumption on 2-torsion) to the case when $Γ$ is rigid. We also find surface subgroups in limit groups. It follows that a limit group with the same profinite completion as a free group must in fact be free, which answers a question of Remeslennikov in this case.
Given a 2-generated finite group $G$, the non-generating graph of $G$ has as vertices the elements of $G$ and two vertices are adjacent if and only if they are distinct and do not generate $G$. We consider the graph $Σ(G)$ obtained from the non-generating graph of $G$ by deleting the universal vertices. We prove that if the derived subgroup of $G$ is not nilpotent, then this graph is connected, with diameter at most 5. Moreover we give a complete classification of the finite groups $G$ such that $Σ(G)$ is disconnected.
Given a finite group $G$, the invariably generating graph of $G$ is defined as the undirected graph in which the vertices are the nontrivial conjugacy classes of $G$, and two classes are adjacent if and only if they invariably generate $G$. In this paper we study this object for alternating and symmetric groups. The main result of the paper states that, if we remove the isolated vertices from the graph, the resulting graph is connected and has diameter at most $6$.
Let $G$ be $2$-generated group. The generating graph 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 graph encodes the combinatorial structure of the distribution of generating pairs across $G$. In this paper we study several natural graph theoretic properties related to the connectedness of $Γ(G)$ in the case where $G$ is a finite nilpotent group. For example, we prove that if $G$ is nilpotent, then the graph obtained from $Γ(G)$ by removing its isolated vertices is maximally connected and, if $|G| \…
Let $G$ be a $2$-generated group. The generating graph $Γ(G)$ is the graph whose vertices are the elements of $G$ and where two vertices $g_1$ and $g_2$ are adjacent if $G = \langle g_1, g_2 \rangle.$ This graph encodes the combinatorial structure of the distribution of generating pairs across $G.$ In this paper we study some graph theoretic properties of $Γ(G)$, with particular emphasis on those properties that can be formulated in terms of forbidden induced subgraphs. In particular we investigate when the generating graph $Γ(G)$ is a cograph (giving a complete description when $G$ is soluble…
Royal Holloway, University of London（伦敦大学皇家霍洛威学院）；Università degli Studi di Padova（帕多瓦大学）；FernUniversität in Hagen（哈根远程大学）；Università degli Studi di Firenze（佛罗伦萨大学）
A well-known conjecture of Babai states that if $G$ is a finite simple group and $X$ is a generating set of $G$, then the diameter of the Cayley graph $Cay(G,X)$ is bounded above by $(\log |G|)^c$ for some absolute constant $c$. The goal of this paper is to prove such a bound for the diameter of $Cay(G,X)$ whenever $G=SL(n,p)$ and $X$ is a generating set of $G$ which contains a transvection. A natural analogue of this result is also proved for $G=SL(n,K)$, where $K$ can be any field.
Given a finite group $G$, the generating graph $Γ(G)$ of $G$ has as vertices the non-identity elements of $G$ and two vertices are adjacent if and only if they are distinct and generate $G$ as group elements. Let $G$ be a 2-generated finite group. We prove that $Γ(G)$ is planar if and only if $G$ is isomorphic to one of the following groups: $C_2, C_3, C_4, C_5, C_6, C_2 \times C_2, D_3, D_4, Q_8, C_4\times C_2, D_6.$
A well-known conjecture of Babai states that if $G$ is any finite simple group and $X$ is a generating set for $G$, then the diameter of the Cayley graph $Cay(G,X)$ is bounded by $\log|G|^c$ for some universal constant $c$. In this paper, we prove such a bound for $Cay(G,X)$ for $G=PSL(n,q),PSp(n,q)$ or $PSU(n,q)$ where $q$ is odd, under the assumptions that $X$ contains a transvection and $q\neq 9$ or $81$.
Given a finite group $G$, the generating graph $Γ(G)$ of $G$ has as vertices the (nontrivial) elements of $G$ and two vertices are adjacent if and only if they are distinct and generate $G$ as group elements. In this paper we investigate properties about the degrees of the vertices of $Γ(G)$ when $G$ is an alternating group or a symmetric group. In particular, we determine the vertices of $Γ(G)$ having even degree and show that $Γ(G)$ is Eulerian if and only if $n$ and $n-1$ are not equal to a prime number congruent to 3 modulo 4.
Assume that $G$ is a finite group and let $a$ and $b$ be non-negative integers. We define an undirected graph $Γ_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if and only $\langle x_1,\dots,x_a,y_1,\dots,y_b \rangle =G.$ Our aim is to estimate the genus, the thickness and the crossing number of the graph $Γ_{a,b}(G)$ when $a$ and $b$ are positive integers.
Assume that $G$ is a finite group. For every $a, b \in\mathbb N,$ we define a graph $Γ_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if and only if $\langle x_1,\dots,x_a,y_1,\dots,y_b \rangle =G.$ We study several properties of these graphs (isolated vertices, loops, connectivity, diameter of the connected components) and we investigate the relations between their properties and the group structure, with the aim of understanding which information about $G$ are encoded by these graphs.
The generating graph $Γ(G)$ of a finite group $G$ has vertex set the non-identity elements of $G$, with two elements connected exactly when they generate $G$. A coclique in a graph is an empty induced subgraph, so a coclique in $Γ(G)$ is a subset of $G$ such that no pair of elements generate $G$. A coclique is maximal if it is contained in no larger coclique. It is easy to see that the non-identity elements of a maximal subgroup of $G$ form a coclique in $Γ(G)$, but this coclique need not be maximal. In this paper we determine when the intransitive maximal subgroups of $\textrm{S}_n$ and $\tex…
For a nilpotent group $G$, let $Ξ(G)$ be the difference between the complement of the generating graph of $G$ and the commuting graph of $G$, with vertices corresponding to central elements of $G$ removed. That is, $Ξ(G)$ has vertex set $G \setminus Z(G)$, with two vertices adjacent if and only if they do not commute and do not generate $G$. Additionally, let $Ξ^+(G)$ be the subgraph of $Ξ(G)$ induced by its non-isolated vertices. We show that if $Ξ(G)$ has an edge, then $Ξ^+(G)$ is connected with diameter $2$ or $3$, with $Ξ(G) = Ξ^+(G)$ in the diameter $3$ case. In the infinite case, our res…
We find a set of generators for the automorphism group of a graph product of finitely generated abelian groups entirely from a certain labeled graph. In addition, we find generators for the important subgroup of star-automorphisms defined in [7]. We follow closely the plan of M. Laurence's paper [11].
This is a collection of examples showing how the GAP system can be used to compute information about the generating graphs of finite groups. It includes all examples that were needed for the computational results in the paper "Hamiltonian cycles in the generating graphs of finite groups" by Thomas Breuer, Robert M. Guralnick, Andrea Lucchini, Attila Maróti, and Gábor P. Nagy. The purpose of this writeup is twofold. On the one hand, the computations are documented this way. On the other hand, the GAP code shown for the examples can be used as test input for automatic checking of the data and th…
