On finite decomposition complexity of Thompson group.
From MaRDI portal
Recommendations
Cites work
- Amenability for discrete convolution semigroup algebras.
- Asymptotic dimension in Będlewo.
- Coarsely embeddable metric spaces without Property A
- scientific article; zbMATH DE number 5722690 (Why is no real title available?)
- scientific article; zbMATH DE number 1101561 (Why is no real title available?)
- Introductory notes on Richard Thompson's groups
- Wreath products with the integers, proper actions and Hilbert space compression.
Cited in
(11)- Metric spaces with complexity of the smallest infinite ordinal number
- Thompson's group \(F\) and the linear group \(\mathrm{GL}_\infty(\mathbb Z)\).
- Complexity among the finitely generated subgroups of Thompson's group
- Non-commutative arithmetics on Thompson's monoid
- Large scale properties for bounded automata groups.
- Asymptotic dimension, decomposition complexity, and Haver's property C
- Discrete groups with finite decomposition complexity
- A computational approach to the Thompson group F
- Asymptotic property C of the wreath product \(\mathbb{Z} \wr \mathbb{Z}\)
- Tree-based language complexity of Thompson's group \(F\).
- 3-manifold group and finite decomposition complexity
This page was built for publication: On finite decomposition complexity of Thompson group.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q550384)