REVIEW 2 cited by
Quasi-isometry classification of right-angled Artin groups II: several infinite out cases
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We are motivated by the question that for which class of right-angled Artin groups (RAAG's), the quasi-isometry classification coincides with commensurability classification. This is previously known for RAAG's with finite outer automorphism groups. In this paper, we identify two classes of RAAG's, where their outer automorphism groups are allowed to contain adjacent transvections and partial conjugations, hence infinite. If $G$ belongs to one of these classes, then any other RAAG $G'$ is quasi-isometric to $G$ if and only if $G'$ is commensurable to $G$. We also show that in this case, there exists an algorithm to determine whether two RAAG's are quasi-isometric by looking at their defining graphs. Compared to the finite out case, as well as the previous quasi-isometry rigidity results for symmetric spaces, thick Euclidean buildings and mapping class groups, the main issue we need to deal with here is the reconstruction map may not have nice properties as before, or may not even exist. We introduce a deformation argument, as well as techniques from cubulation to deal with this issue.
Forward citations
Cited by 2 Pith papers
-
Coarse embeddings of products of trees as quasi-isometry invariants
The maximal number of bushy free factors that coarsely embed into a standard HHS is the orthogonality number of its bushy domains; this distinguishes Torelli groups, Johnson kernels and surface braid groups.
-
Quasi-isometry classification of certain graph $2$-braid groups and its applications
Two 2-braid groups over circumference-one graphs are quasi-isometric exactly when their quasi-minimal representatives are isometric, and the comparison is algorithmic.
Discussion (0). Continue with ORCID to comment.