Related papers: The groups of Richard Thompson and complexity

Pursueing our investigations on the relations between Thompson groups and mapping class groups, we introduce the group $T^*$ (and its further generalizations) which is an extension of the Ptolemy-Thompson group $T$ by means of the full…

We construct a finitely presented group with coNP-complete word problem, and a finitely generated simple group with coNP-complete word problem. These groups are represented as Thompson groups, hence as partial transformation groups of…

We show that one can naturally describe elements of R. Thompson's finitely presented infinite simple group $V$, known by Thompson to have a presentation with four generators and fourteen relations, as products of permutations analogous to…

In a recent paper Uffe Haagerup and Kristian Knudsen Olesen show that for Richard Thompson's group $T$, if there exists a finite set $H$ which can be decomposed as disjoint union of sets $H_1$ and $H_2$ with $\sum_{g\in…

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…

We construct examples of finitely generated decidable group presentations that satisfy certain combinations of solvability for the word problem, solvability for the bounded word problem, and computablity for the Dehn function. We prove that…

The groups G_{k,1} of Richard Thompson and Graham Higman can be generalized in a natural way to monoids, that we call M_{k,1}, and to inverse monoids, called Inv_{k,1}; this is done by simply generalizing bijections to partial functions or…

We construct a family of infinite simple groups that we call \emph{twisted Brin-Thompson groups}, generalizing Brin's higher-dimensional Thompson groups $sV$ ($s\in\mathbb{N}$). We use twisted Brin-Thompson groups to prove a variety of…

We consider generalisations of Thompson's group $V$, denoted by $V_r(\Sigma)$, which also include the groups of Higman, Stein and Brin. It was shown by the authors in [20] that under some mild conditions these groups and centralisers of…

In 1987, the second author of this paper reported his conjecture, all finite simple groups $S$ can be characterized uniformly using the order of $S$ and the set of element orders in $S$, to Prof. J. G. Thompson. In their communications,…

We introduce the Pythagorean dimension: a natural number (or infinity) for all representations of the Cuntz algebra and certain unitary representations of the Richard Thompson groups called Pythagorean. For each natural number d we…

In a previous paper, we defined a higher dimensional analog of Thompson's group V, and proved that it is simple, infinite, finitely generated, and not isomorphic to any of the known Thompson groups. There are other Thompson groups that are…

In his papers [2], [3] Brin introduced the higher dimensional Thompson groups nV which are generalizations to the Thompson's group V of self-homeomorphisms of the Cantor set and found a finite set of generators and relations in the case n =…

We introduce two new types of Dehn functions of group presentations which seem more suitable (than the standard Dehn function) for infinite group presentations and prove the fundamental equivalence between the solvability of the word…

We analyze the proof by Lehnert and Schweitzer that the word problem of the Thompson group V is co-context-free, and we show that this word problem is the complement of the cyclic closure of a union of reverse deterministic context-free…

The higher-dimensional Thompson groups $nV$, for $n \geq 2$, were introduced by Brin in 2005. We provide new presentations for each of these infinite simple groups. The first is an infinite presentation, analogous to the Coxeter…

The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real…

The Arithmetic is interpreted in all the groups of Richard Thompson and Graham Higman, as well as in other groups of piecewise affine permutations of an interval which generalize the groups of Thompson and Higman. In particular, the…

We construct rearrangement groups for edge replacement systems, an infinite class of groups that generalize Richard Thompson's groups F, T, and V . Rearrangement groups act by piecewise-defined homeomorphisms on many self-similar…

We give lower bounds on the complexity of the word problem of certain non-solvable groups: for a large class of non-solvable infinite groups, including in particular free groups, Grigorchuk's group and Thompson's groups, we prove that their…