On finite decomposition complexity of Thompson group.
DOI10.1016/J.JFA.2011.04.006zbMATH Open1220.20041OpenAlexW1969069815MaRDI QIDQ550384FDOQ550384
Authors: Yan Wu, Xiaoman Chen 
Publication date: 8 July 2011
Published in: Journal of Functional Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jfa.2011.04.006
Recommendations
asymptotic dimensionThompson group \(F\)exact metric spacesfinite decomposition complexityreduced forest diagramsword-metrics
Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Asymptotic properties of groups (20F69)
Cites Work
- Introductory notes on Richard Thompson's groups
- Title not available (Why is that?)
- Title not available (Why is that?)
- Amenability for discrete convolution semigroup algebras.
- Coarsely embeddable metric spaces without Property A
- Wreath products with the integers, proper actions and Hilbert space compression.
- Asymptotic dimension in Będlewo.
Cited In (11)
- Non-commutative arithmetics on Thompson's monoid
- Tree-based language complexity of Thompson's group \(F\).
- A computational approach to the Thompson group F
- Large scale properties for bounded automata groups.
- Asymptotic dimension, decomposition complexity, and Haver's property C
- 3-manifold group and finite decomposition complexity
- Asymptotic property C of the wreath product \(\mathbb{Z} \wr \mathbb{Z}\)
- Thompson's group \(F\) and the linear group \(\mathrm{GL}_\infty(\mathbb Z)\).
- Discrete groups with finite decomposition complexity
- Metric spaces with complexity of the smallest infinite ordinal number
- Complexity among the finitely generated subgroups of Thompson's group
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)
