Related papers: Conjugacy and Dynamics in Thompson's Groups

We begin with a review of the notion of a braid group. We then discuss some known solutions to decision problems in braid groups. We then move on to proving new results in braid group algorithmics. We offer a quick solution to the…

A connection relating Tamari lattices on symmetric groups regarded as lattices under the weak Bruhat order to the positive monoid P of Thompson group F is presented. Tamari congruence classes correspond to classes of equivalent elements in…

This article deals with the study of affine cactus groups from a combinatorial point of view. Those groups are extensions of cactus groups, which are related to braid and diagram groups and have gained an important place in many mathematics…

We prove that the braided Thompson's groups $V_{\rm br}$ and $F_{\rm br}$ are of type $F_\infty$, confirming a conjecture by John Meier. The proof involves showing that matching complexes of arcs on surfaces are highly connected. In an…

We show that the density of elements in Thompson's groups T and V which have north-south dynamics acting on the circle is positive with respect to a stratification in terms of size. We show that the fraction of element pairs which generate…

Thompson's groups, which are denoted by $F, T$ and $V$, were introduced by R. Thompson. It is known that they are related to various fields in mathematics. In this paper, we establish that Thompson's groups are regarded as subgroups of…

Given a group G, the conjugacy problem in G is the problem of giving an effective procedure for determining whether or not two given elements f, g of G are conjugate, i.e. whether there exists h belonging to G with fh = hg. This paper is…

We prove that R. Thompson groups F, T, V have linear divergence functions.

The space of configurations of n ordered points in the plane serves as a classifying space for the pure braid group PB_n. Elements of Thompson's group F admit a model similar to braids, except instead of braiding the strands split and…

Garside-theoretical solutions to the conjugacy problem in braid groups depend on the determination of a characteristic subset of the conjugacy class of any given braid, e.g. the sliding circuit set. It is conjectured that, among rigid…

We define a family of groups that generalises Thompson's groups $T$ and $G$ and also those of Higman, Stein and Brin. For groups in this family we descrine centralisers of finite subgroups and show, that for a given finite subgroup $Q$,…

We study a systematic improvement of perturbation theory for gauge fields on the lattice [hep-lat/0606001]; the improvement entails resumming, to all orders in the coupling constant, a dominant subclass of tadpole diagrams. This method,…

The connections between Tarski's relation algebras and Thompson's groups F, T, V, and his monoid M are reviewed here, along with Jonsson-Tarski algebras, fork algebras, true pairing algebras, and tabular relation algebras. All of these…

The conjugacy problem for a finitely generated group $G$ is the two-variable problem of deciding for an arbitrary pair $(u,v)$ of elements of $G$, whether or not $u$ is conjugate to $v$ in $G$. We construct examples of finitely generated,…

The conjugacy problem in braid groups has been extensively studied, particularly from an algorithmic perspective. Established methods based on Garside structures, such as initial summit sets and super summit sets, provide effective…

We present a solution to the conjugacy decision problem and the conjugacy search problem in Garside groups, which is theoretically simpler than the usual one, with no loss of efficiency. This is done by replacing the well known cycling and…

We study the notion of twisted conjugacy separability (essentially introduced in our previous paper for a proof of twisted version of Burnside-Frobenius theorem) and some related properties. We give examples of groups with and without this…

Following a procedure due to V. Jones, using suitably normalized elements in a Temperley-Lieb-Jones (planar) algebra we introduce a 3-parametric family of unitary representations of the Thompson's group $F$ equipped with canonical (vacuum)…

A matching complex of a simple graph $G$ is a simplicial complex with faces given by the matchings of $G$. The topology of matching complexes is mysterious; there are few graphs for which the homotopy type is known. Marietti and Testa…

There is a map, defined and studied by Jones, from Thompson's group $F$ to knots. Jones proved that every knot is in the image of this map -- that is, that every knot can be seen as the "knot closure" of a Thompson group element. We…