2020
DOI: 10.1090/tran/7991
|View full text |Cite
|
Sign up to set email alerts
|

Commensurations of subgroups of 𝑂𝑒𝑑(𝐹_{𝑁})

Abstract: A theorem of Farb and Handel [FH07] asserts that for N β‰₯ 4, the natural inclusion from Out(F N ) into its abstract commensurator is an isomorphism. We give a new proof of their result, which enables us to generalize it to the case where N = 3. More generally, we give sufficient conditions on a subgroup Ξ“ of Out(F N ) ensuring that its abstract commensurator Comm(Ξ“) is isomorphic to its relative commensurator in Out(F N ). In particular, we prove that the abstract commensurator of the Torelli subgroup IA N for … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
7
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(8 citation statements)
references
References 54 publications
1
7
0
Order By: Relevance
“…Then the group of twists of S is isomorphic to Z by a result of Levitt (see [Lev,Proposition 3.1]). The next proposition is similar to a result in the case of the outer automorphism group of a free group (see [CL2] and [HW,Lemma 2.7]). Recall that an element w P W n is root-closed if there does not exist w 0 P W n and an integer n Δ› 2 such that w " w n 0 .…”
Section: Rigidity Of the Graph Of One-edge Compatible W NΒ΄2 -Starssupporting
confidence: 75%
See 4 more Smart Citations
“…Then the group of twists of S is isomorphic to Z by a result of Levitt (see [Lev,Proposition 3.1]). The next proposition is similar to a result in the case of the outer automorphism group of a free group (see [CL2] and [HW,Lemma 2.7]). Recall that an element w P W n is root-closed if there does not exist w 0 P W n and an integer n Δ› 2 such that w " w n 0 .…”
Section: Rigidity Of the Graph Of One-edge Compatible W NΒ΄2 -Starssupporting
confidence: 75%
“…Proposition 2.1. [HW,Proposition 1.1] Let G be a group. Let X be a graph with no edge-loops, no multiple edges between pairs of vertices and such that G acts on X by graph automorphisms.…”
Section: Commensurationsmentioning
confidence: 99%
See 3 more Smart Citations