EUVIMEDEUVIMED entdecken
Crossref

A computer‐free property (T) proof for high‐rank Aut(Fn)

Martin Nitsche

Bulletin of the London Mathematical Society · 2026-04 · 58 (4)

DOI: 10.1112/blms.70334 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Bulletin of the London Mathematical Society, online erschienen am 20.03.2026. Verfasst von Martin Nitsche. Die Arbeit nennt 9 Literaturangaben. Gefördert von: Deutsche Forschungsgemeinschaft.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Existing property (T) proofs for , , rely crucially on extensive computer calculations. We give a new proof that has property (T) for all but finitely many , which 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 of as .

Förderung

  • Deutsche Forschungsgemeinschaft

Zitieren

APA

Nitsche, M. (2026). A computer‐free property (T) proof for high‐rank Aut(Fn). Bulletin of the London Mathematical Society, 58(4). https://doi.org/10.1112/blms.70334

Vancouver

Nitsche M. A computer‐free property (T) proof for high‐rank Aut(Fn). Bulletin of the London Mathematical Society. 2026;58(4). doi:10.1112/blms.70334

BibTeX
@article{Nitsche2026,
  author = {Nitsche, Martin},
  title = {A computer‐free property (T) proof for high‐rank Aut(Fn)},
  journal = {Bulletin of the London Mathematical Society},
  year = {2026},
  volume = {58},
  number = {4},
  doi = {10.1112/blms.70334}
}
Kostenlos starten →