A human property (T) proof for high-rank $Aut(F_n)$
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914645684518912 |
|---|---|
| author | Nitsche, Martin |
| author_facet | Nitsche, Martin |
| contents | Existing property (T) proofs for $Aut(F_n)$, $n\geq 4$, rely crucially on extensive computer calculations. We give a new proof that $Aut(F_n)$ has property (T) for all but finitely many $n$ that is inspired by the semidefinite programming approach but does not use the computer in any step. More specifically, we prove property (T) for a certain extension $Γ_n$ of $SAut(F_n)$ as $n\to\infty$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_13917 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | A human property (T) proof for high-rank $Aut(F_n)$ Nitsche, Martin Group Theory 22D55 (Primary) 20F28 (Secondary) Existing property (T) proofs for $Aut(F_n)$, $n\geq 4$, rely crucially on extensive computer calculations. We give a new proof that $Aut(F_n)$ has property (T) for all but finitely many $n$ that is inspired by the semidefinite programming approach but does not use the computer in any step. More specifically, we prove property (T) for a certain extension $Γ_n$ of $SAut(F_n)$ as $n\to\infty$. |
| title | A human property (T) proof for high-rank $Aut(F_n)$ |
| topic | Group Theory 22D55 (Primary) 20F28 (Secondary) |
| url | https://arxiv.org/abs/2312.13917 |