Tame combing and almost convexity conditions.
DOI10.1007/S00209-010-0759-5zbMATH Open1256.20040arXiv0909.0279OpenAlexW2010055214MaRDI QIDQ658323FDOQ658323
Authors: Sean Cleary, Melanie Stein, Jennifer Taback, Susan Hermiller
Publication date: 12 January 2012
Published in: Mathematische Zeitschrift (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0909.0279
Recommendations
- T-convexity and tame extensions
- Convex combinations of strict t-norms
- T-convexity and tame extensions II
- scientific article; zbMATH DE number 7638387
- GENERALIZED CONVEXITY AND CLOSURE CONDITIONS
- THE COMBINATION THEOREM AND QUASICONVEXITY
- scientific article; zbMATH DE number 1790523
- A certain condition of almost convexity
- scientific article; zbMATH DE number 3948643
Cayley graphspresentationsThompson group \(F\)finitely presented groupsBaumslag-Solitar groupsquasi-isometry invariantsalmost convexitycombings of groupstame combings
Cites Work
- Introductory notes on Richard Thompson's groups
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorial properties of Thompson’s group 𝐹
- An infinite-dimensional torsion-free \(\text{FP}_{\infty}\) group
- Minimal length elements of Thompson's group \(F\)
- Almost convex groups, Lipschitz combing, and \(\pi^ \infty _ 1\) for universal covering spaces of closed 3-manifolds
- Geometry ``à la Gromov for the fundamental group of a closed 3- manifold \(M^ 3\) and the simple connectivity at infinity of \(\widetilde{M}^ 3\)
- Tame Combings of Groups
- Measuring the tameness of almost convex groups
- The Dehn function of Richard Thompson's group \(F\) is quadratic.
- Almost convex groups
- Minimal almost convexity
- Title not available (Why is that?)
- Solvable Baumslag-Solitar groups are not almost convex.
- A note on the Poénaru condition
- Computing word length in alternate presentations of Thompson's group \(F\).
- The geometry of groups satisfying weak almost-convexity or weak geodesic-combability conditions
Cited In (8)
- A note on convexity properties of Thompson's group \(F\).
- Minimal almost convexity
- Tame filling invariants for groups
- Thompson's group \(F\) is 1-counter graph automatic.
- Thompson's group \(F(n)\) is not minimally almost convex.
- Autostackability of Thompson's group \(F\)
- The geometry of groups satisfying weak almost-convexity or weak geodesic-combability conditions
- Measuring the tameness of almost convex groups
This page was built for publication: Tame combing and almost convexity conditions.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658323)