Conjugacy and dynamics in Thompson’s groups

@article{Belk2007ConjugacyAD,
  title={Conjugacy and dynamics in Thompson’s groups},
  author={James M. Belk and Francesco Matucci},
  journal={Geometriae Dedicata},
  year={2007},
  volume={169},
  pages={239-261}
}
We give a unified solution to the conjugacy problem for Thompson’s groups $$F, \,T$$F,T, and $$V$$V. The solution uses “strand diagrams”, which are similar in spirit to braids and generalize tree-pair diagrams for elements of Thompson’s groups. Strand diagrams are closely related to piecewise-linear functions for elements of Thompson’s groups, and we use this correspondence to investigate the dynamics of elements of $$F$$F. Though many of the results in this paper are known, our approach is new… Expand

Paper Mentions

Blog Post
An Implementation of the Solution to the Conjugacy Problem on Thompson's Group V
We describe an implementation of the solution to the conjugacy problem in Thompson’s group V as presented by James Belk and Francesco Matucci in 2013. Thompson’s group V is an infinite finitelyExpand
Deciding Conjugacy in Thompson's Group F in Linear Time
TLDR
It is proved that the solution to the conjugacy problem in Thompson's group F theoretically achieves a linear time bound in the size of the input, and the algorithm is presented a quadratic time working solution. Expand
The conjugacy problem in extensions of Thompson’s group F
We solve the twisted conjugacy problem on Thompson’s group F. We also exhibit orbit undecidable subgroups of Aut(F), and give a proof that Aut(F) and Aut+(F) are orbit decidable provided a certainExpand
The conjugacy problem for Thompson-like groups.
In this paper we generalize techniques of Belk-Matucci to solve the conjugacy problem for every Thompson-like group $V_n(H)$, where $n \geq 2$ and $H$ is a subgroup of the symmetric group on $n$Expand
The power conjugacy problem in Higman-Thompson groups
TLDR
An introduction to the universal algebra approach to Higman–Thompson groups (including Thompson’s group V) is given, following a series of lectures by Graham Higman in 1973, and an algorithm for the power conjugacy problem in these groups is constructed. Expand
THE SIMULTANEOUS CONJUGACY PROBLEM IN GROUPS OF PIECEWISE LINEAR FUNCTIONS
Guba and Sapir asked, in their joint paper [8], if the simultaneous conjugacy problem was solvable in Diagram Groups or, at least, for Thompson's group F. We give an elementary proof for the solutionExpand
Embedding and nonembedding results for R. Thompson's group V and related groups
Adviser: Professor Mark Brittenham We study Richard Thompson's group V , and some generalizations of this group. V was one of the first two examples of a finitely presented, infinite, simple group.Expand
Finiteness Properties of the Braided Thompson's Groups and the Brin-Thompson Groups
A group G is of type Fn if there is a K(G, 1) complex that has finite n-skeleton. It is of type F∞, if it is of type Fn for all n ∈ N. Here the property F1 is equivalent to G being finitely generatedExpand
Röver's Simple Group Is of Type $F_\infty$
We prove that Claas R\"over's Thompson-Grigorchuk simple group $V\mathcal{G}$ has type $F_\infty$. The proof involves constructing two complexes on which $V\mathcal{G}$ acts: a simplicial complexExpand
The braided Thompson's groups are of type F∞
Abstract We prove that the braided Thompson’s groups Vbr{V_{\mathrm{br}}} and Fbr{F_{\mathrm{br}}} are of type F∞{\rm F}_{\infty}, confirming a conjecture by John Meier. The proof involves showingExpand
...
1
2
3
4
...

References

SHOWING 1-10 OF 14 REFERENCES
THE SIMULTANEOUS CONJUGACY PROBLEM IN GROUPS OF PIECEWISE LINEAR FUNCTIONS
Guba and Sapir asked, in their joint paper [8], if the simultaneous conjugacy problem was solvable in Diagram Groups or, at least, for Thompson's group F. We give an elementary proof for the solutionExpand
Algorithms and classification in groups of piecewise-linear homeomorphisms
The first part (Chapters 2 through 5) studies decision problems in Thompson's groups F, T, V and some generalizations. The simultaneous conjugacy problem is determined to be solvable for Thompson'sExpand
On subgroups of R. Thompson's group $ F$ and other diagram groups
In the present paper we continue our study of an interesting class of groups, the so-called diagram groups. In simple terms, a diagram is a labelled planar graph bounded by two paths (the top and theExpand
Finiteness properties of groups
Recall that a group r is said to be of type FP, (resp. FP,) if the ZT-module Z admits a projective resolution which is finitely generated in dimensions <n (resp. in all dimensions), cf. [4] or [S].Expand
PRESENTATIONS, CONJUGACY, ROOTS, AND CENTRALIZERS IN GROUPS OF PIECEWISE LINEAR HOMEOMORPHISMS OF THE REAL LINE
For an open interval (bounded or unbounded) of the real line R, we consider groups of the form PLF(S) consisting of those piecewise linear, order preserving homeomorphisms of R that have finitely m...
The algebra of strand splitting. I. A braided version of Thompson's group V
We construct a braided version of Thompson's group V.
On Theories with a Combinatorial Definition of "Equivalence"
The name "combinatorial theory" is often given to branches of mathematics in which the central concept is an equivalence relation defined by means of certain "allowed transformations" or "moves." AExpand
Graphs on Surfaces
  • B. Mohar, C. Thomassen
  • Computer Science, Mathematics
  • Johns Hopkins series in the mathematical sciences
  • 2001
TLDR
This chapter discusses Embeddings Combinatorially, Contractibility, of Cycles, and the Genus Problem, which focuses on planar graphs and the Jordan Curve Theorem, and colorings of Graphs on Surfaces, which are 5-choosable. Expand
...
1
2
...