We define graph products of families of pairs of groups and study the question when two such graph products are commensurable. As an application we prove linearity of certain graph products.
We initiate the study of the $p$-local commensurability graph of a group, where $p$ is a prime. This graph has vertices consisting of all finite-index subgroups of a group, where an edge is drawn between $A$ and $B$ if $[A : A\cap B]$ and $[B: A\cap B]$ are both powers of $p$. We show that any component of the $p$-local commensurability graph of a group with all nilpotent finite quotients is complete. Further, this topological criterion characterizes such groups. In contrast to this result, we show that for any prime $p$ the $p$-local commensurability graph of any large group (e.g. a nonabelia…
The commensurability index between two subgroups $A, B$ of a group $G$ is $[A : A \cap B] [B : A\cap B]$. This gives a notion of distance amongst finite-index subgroups of $G$, which is encoded in the p-local commensurability graphs of $G$. We show that for any metabelian group, any component of the $p$-local commensurabilty graph of $G$ has diameter bounded above by 4. However, no universal upper bound on diameters of components exists for the class of finite solvable groups. In the appendix we give a complete classification of components for upper triangular matrix groups in $\text{GL}(2, \m…
Suppose a group $G$ is quasi-isometric to a free product of a finite set $S$ of finitely generated abelian groups; let $S'$ denote the set of ranks of the free abelian parts of the groups in $S$. Then $G$ is commensurable with the free product of $\Z$ with a $\Z^n$ for each $n$ occurring in $S'$.
We define and discuss a notion called fibered commensurability of outer automorphisms of free groups. This notion lets us study symmetry of outer automorphisms. The notion of fibered commensurability is first defined by Calegari-Sun-Wang on mapping class groups. The Nielsen-Thurston type of mapping classes is a commensurability invariant. One of the important facts of fibered commensurability on mapping class groups is for the case of pseudo-Anosovs, there is a unique minimal element in each fibered commensurability class. For outer automorphisms, we first show that being atoroidal and fully i…
We give explicit necessary and sufficient conditions for the abstract commensurability of certain families of 1-ended, hyperbolic groups, namely right-angled Coxeter groups defined by generalized theta-graphs and cycles of generalized theta-graphs, and geometric amalgams of free groups whose JSJ graphs are trees of diameter at most 4. We also show that if a geometric amalgam of free groups has JSJ graph a tree, then it is commensurable to a right-angled Coxeter group, and give an example of a geometric amalgam of free groups which is not quasi-isometric (hence not commensurable) to any group w…
We study to what extent torsion-free (Gromov)-hyperbolic groups are elementarily equivalent to their finite index subgroups. In particular, we prove that a hyperbolic limit group either is a free product of cyclic groups and surface groups, or admits infinitely many subgroups of finite index which are pairwise non elementarily equivalent.
We show that two uniform lattices of a regular right-angled Fuchsian building are commensurable, provided the chamber is a polygon with at least six edges. We show that in an arbitrary Gromov-hyperbolic regular right-angled building associated to a graph product of finite groups, a uniform lattice is commensurable with the graph product provided all of its quasiconvex subgroups are separable. We obtain a similar result for uniform lattices of the Davis complex of Gromov-hyperbolic two-dimensional Coxeter groups. We also prove that every extension of a uniform lattice of a CAT(0) square complex…
Fudan University(复旦大学);Shanghai Center for Mathematical Sciences, Jiangwan Campus, Fudan University(复旦大学江湾校区上海数学中心);NYU Shanghai(纽约大学上海分校);NYU-ECNU Institute of Mathematical Sciences at NYU Shanghai(纽约大学上海分校纽约大学-华东师范大学数学科学研究所)
Let $G$ be a right-angled Artin group with defining graph $Γ$ and let $H$ be a finitely generated group quasi-isometric to $G(Γ)$. We show if $G$ satisfies (1) its outer automorphism group is finite; (2) $Γ$ does not have induced 4-cycle; (3) $Γ$ is star-rigid; then $H$ is commensurable to $G$. We show condition (2) is sharp in the sense that if $Γ$ contains an induced 4-cycle, then there exists an $H$ quasi-isometric to $G(Γ)$ but not commensurable to $G(Γ)$. Moreover, one can drop condition (1) if $H$ is a uniform lattice acting on the universal cover of the Salvetti complex of $G(Γ)$. As a …
Two groups have a common model geometry if they act properly and cocompactly by isometries on the same proper geodesic metric space. The Milnor-Schwarz lemma implies that groups with a common model geometry are quasi-isometric; however, the converse is false in general. We consider free products of uniform lattices in isometry groups of rank-1 symmetric spaces and prove, within each quasi-isometry class, residually finite groups that have a common model geometry are abstractly commensurable. Our result gives the first examples of hyperbolic groups that are quasi-isometric but do not virtually …
A BMW group of degree $(m,n)$ is a group that acts simply transitively on vertices of the product of two regular trees of degrees $m$ and $n$. We show that the number of commensurability classes of BMW groups of degree $(m,n)$ is bounded between $(mn)^{αmn}$ and $(mn)^{βmn}$ for some $0<α<β$. In fact, we show that the same bounds hold for virtually simple BMW groups. We introduce a random model for BMW groups of degree $(m,n)$ and show that asymptotically almost surely a random BMW group in this model is irreducible and hereditarily just-infinite.
We establish a general criterion for the finite presentability of subdirect products of groups and use this to characterize finitely presented residually free groups. We prove that, for all $n\in\mathbb{N}$, a residually free group is of type ${\rm{FP}}_n$ if and only if it is of type ${\rm{F}}_n$. New families of subdirect products of free groups are constructed, including the first examples of finitely presented subgroups that are neither ${\rm{FP}}_\infty$ nor of Stallings-Bieri type. The template for these examples leads to a more constructive characterization of finitely presented residua…
We prove that the topological full group $[[X]]$ of a two-sided full shift $X = Σ^{\mathbb{Z}}$ contains every right-angled Artin group (also called a graph group). More generally, we show that the family of subgroups with "linear look-ahead" is closed under graph products. We show that the lamplighter group $\mathbb{Z}_2 \wr \mathbb{Z}$ embeds in $[[X]]$, and conjecture that it does not embed in $[[X]]$ with linear look-ahead. Generalizing the lamplighter group, we show that whenever $G$ acts with "unique moves" (or at least "move-$A$ithfully"), we have $A \wr G \leq [[X]]$ for finite abelian…
We obtain a complete classification of graph products of finite abelian groups whose Cayley graphs with respect to the standard presentations are planar.
We study $(G,2)$-arc-transitive graphs for innately transitive permutation groups $G$ such that $G$ can be embedded into a wreath product $\symΓ\wr\sy\ell$ acting in product action on $Γ^\ell$. We find two such connected graphs: the first is Sylvester's double six graph with 36 vertices, while the second is a graph with $120^2$ vertices whose automorphism group is $\aut\sp 44$. We prove that under certain conditions no more such graphs exist.
We describe an underlying right angled building structure of any graph product of buildings. We describe the automorphism group of the graph product of buildings. We show that the notion of generalized graph product of a collection of groups, each with an action on a building, corresponds to the group of automorphisms generated via lifts. It follows that if each building is finite, then the generalized graph product is residually finite.
A notion of \emph{graph-wreath product} is introduced. We obtain sufficient conditions for these products to satisfy the topologically inspired finiteness condition type $\operatorname{F}_n$. Under various additional assumptions we show that these conditions are necessary. Our results generalise results of Cornulier about wreath products in case $n=2$. Graph-wreath products include classical permutational wreath products and semidirect products of right-angled Artin groups by groups of automorphisms amongst others.
We prove that the class of residually C groups is closed under taking graph products, provided that C is closed under taking subgroups, finite direct products and that free-by-C groups are residually C. As a consequence, we show that local embeddability into various classes of groups is stable under graph products. In particular, we prove that graph products of residually amenable groups are residually amenable, and that locally embeddable into amenable groups are closed under taking graph products.
Given a finite simplicial graph $Γ=(V,E)$ with a vertex-labelling $φ:V\rightarrow\left\{\text{non-trivial finitely generated groups}\right\}$, the graph product $G_Γ$ is the free product of the vertex groups $φ(v)$ with added relations that imply elements of adjacent vertex groups commute. For a quasi-isometric invariant $\mathcal{P}$, we are interested in understanding under which combinatorial conditions on the graph $Γ$ the graph product $G_Γ$ has property $\mathcal{P}$. In this article our emphasis is on number of ends of a graph product $G_Γ$. In particular, we obtain a complete character…
Weak amenability of discrete groups was introduced by Haagerup and co-authors in the 1980's. It is an approximation property known to be stable under direct products and free products. In this paper we show that graph products of weakly amenable discrete groups are weakly amenable (with Cowling-Haagerup constant 1). Along the way we construct a wall space associated to the word length structure of a graph product and also give a method for extending completely bounded functions on discrete groups to a completely bounded function on their graph product.
In this paper, we generalise Magnus' Freiheitssatz and solution to the word problem for one-relator groups by considering one relator quotients of certain classes of right-angled Artin groups and graph products of locally indicable polycyclic groups.
The goal of the paper "A new graph over semi-direct products of groups" is to define a graph Γ(G) on a group G when G splits over a normal subgroup. We demonstrate herein that the graph is ill-defined. We also attempt to ascertain causes for the discrepancies.
We show that $\mathcal{U}(\mathbb{Z}G)$, the unit group of the integral group ring $\mathbb{Z} G$, either satisfies Kazhdan's property (T) or is, up to commensurability, a non-trivial amalgamated product, in case $G$ is a finite group satisfying some mild conditions. Crucial in the proof is the construction of amalgamated decompositions of the elementary group $\operatorname{E}_2(\mathcal{O})$, where $\mathcal{O}$ is an order in a rational division algebra. A major step is to introduce subgroups $\operatorname{E}_2(Γ_n(\mathbb{Z}))$ inside the so-called higher modular groups $\operatorname{SL}…
Inspired by the definition of generalized wreath product of permutation groups, we define the generalized wreath product of graphs, containing the classical Cartesian and wreath product of graphs as particular cases. We prove that the generalized wreath product of Cayley graphs of finite groups is the Cayley graph of the generalized wreath product of the corresponding groups.
A graph product kernel means the kernel of the natural surjection from a graph product to the corresponding direct product. We prove that a graph product kernel of countable groups is special, and a graph product of finite or cyclic groups is virtually cocompact special in the sense of Haglund and Wise. The proof of this yields conditions for a graph over which the graph product of arbitrary nontrivial groups (or some cyclic groups, or some finite groups) contains a hyperbolic surface group. In particular, the graph product of arbitrary nontrivial groups over a cycle of length at least five, o…
We compute: * the cohomology with group ring coefficients of Artin groups (or actually, of their associated Salvetti complexes), Bestvina-Brady groups, and graph products of groups, * the L^2-Betti numbers of Bestvina-Brady groups and of graph products of groups, * the weighted L^2-Betti numbers of graph products of Coxeter groups. In the case of arbitrary graph products there is an additional proviso: either all factors are infinite or all are finite.(However, for graph products of Coxeter groups this proviso is unnecessary.)
We prove the exponential growth of product replacement graphs for a large class of groups. Much of our effort is dedicated to the study of product replacement graphs of Grigorchuk groups, where the problem is most difficult.
In this paper, we discuss the structural information about 2-arc-transitive (non-bipartite and bipartite) graphs of product action type. It is proved that a 2-arc-transitive graph of product action type requires certain restrictions on either the vertex-stabilizers or the valency. Based on the existence of some equidistant linear codes, a construction is given for 2-arc-transitive graphs of non-diagonal product action type, which produces several families of such graphs. Besides, a nontrivial construction is given for 2-arc-transitive bipartite graphs of diagonal product action type
The power graph $P(G)$ of a finite group $G$ is the graph with vertex set $G$ and two distinct vertices are adjacent if either of them is a power of the other. Here we show that the power graph $P(G_1 \times G_2)$ of the direct product of two groups $G_1$ and $G_2$ is not isomorphic to either of the direct, cartesian and normal product of their power graphs $P(G_1)$ and $P(G_2)$. A new product of graphs, namely generalized product, has been introduced and we prove that the power graph $P(G_1 \times G_2)$ is isomorphic to a generalized product of $P(G_1)$ and $P(G_2)$.
We define a free product of connected simple graphs that is equivalent to several existing definitions when the graphs are vertex-transitive but differs otherwise. The new definition is designed for the automorphism group of the free product to be as large as possible, and we give sufficient criteria for it to be non-discrete. Finally, we transfer Tits' classification of automorphisms of trees and simplicity criterion to free products of graphs.
Given an edge-independent random graph G(n,p), we determine various facts about the cohomology of graph products of groups for the graph G(n,p). In particular, the random graph product of a sequence of finite groups is a rational duality group with probability tending to 1 as n goes to infinity. This includes random right angled Coxeter groups as a special case.