Embeddings into Thompson's group V and coCF groups
From MaRDI portal
Publication:2835337
Abstract: Lehnert and Schweitzer show in [20] that R. Thompson's group is a co-context-free () group, thus implying that all of its finitely generated subgroups are also groups. Also, Lehnert shows in his thesis that embeds inside the group , which is a group of particular bijections on the vertices of an infinite binary -edge-colored tree, and he conjectures that is a universal group. We show that embeds into , and thus obtain a new form for Lehnert's conjecture. Following up on these ideas, we begin work to build a representation theory into R. Thompson's group . In particular we classify precisely which Baumslag-Solitar groups embed into .
Recommendations
- Groups with context-free co-word problem and embeddings into Thompson's group \(V\)
- Free products in R. Thompson's group V.
- The graph structure of graph groups that are subgroups of Thompson's group V
- Quasi-isometrically embedded subgroups of Thompson's group \(F\)
- Some embeddings between symmetric R.\ Thompson groups
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- Centralizers in the R. Thompson group \(V_n\).
- Conjugacy and dynamics in Thompson's groups.
- Diagram groups
- Free products in R. Thompson's group V.
- GROUPS AND SEMIGROUPS WITH A ONE-COUNTER WORD PROBLEM
- GROUPS WITH CONTEXT-FREE CO-WORD PROBLEM
- GROUPS WITH INDEXED CO-WORD PROBLEM
- Groups of homeomorphisms of one-manifolds III: nilpotent subgroups
- Groups with context-free conjugacy problems.
- Groups, the theory of ends, and context-free languages
- Higher dimensional Thompson groups.
- Random groups contain surface subgroups
- Surface subgroups from linear programming
- The accessibility of finitely presented groups
- The co-word problem for the Higman-Thompson group is context-free
- The theory of ends, pushdown automata, and second-order logic
- Thompson's group V from a dynamical viewpoint.
Cited in
(18)- Regular left-orders on groups
- Groups of piecewise isometric permutations of lattice points, or Finitary rearrangements of tessellations
- On Thompson groups for Ważewski dendrites
- Normalish Amenable Subgroups of the R. Thompson Groups
- Quasiautomorphism groups of type \(F_\infty\)
- Type systems and maximal subgroups of Thompson's group V
- Infinite 32‐generated groups
- Some embeddings between symmetric R.\ Thompson groups
- Groups with context-free co-word problem and embeddings into Thompson's group \(V\)
- HNN decompositions of the Lodha-Moore groups, and topological applications
- A dynamical definition of f.g. virtually free groups
- Quasi-automorphisms of the infinite rooted 2-edge-coloured binary tree
- The graph structure of graph groups that are subgroups of Thompson's group V
- Quadratic Diophantine equations, the Heisenberg group and formal languages
- Classification of Thompson related groups arising from Jones' technology II
- Some isomorphism results for Thompson-like groups V_n(G)
- Free products in R. Thompson's group V.
- Embeddings into Thompson's groups from quasi-median geometry
This page was built for publication: Embeddings into Thompson's group \(V\) and \(\mathrm{co}\mathcal{C}{F}\) groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835337)