Related papers: The groups of Richard Thompson and complexity

In an earlier paper, the authors introduced partial translation algebras as a generalisation of group C*-algebras. Here we establish an extension of partial translation algebras, which may be viewed as an excision theorem in this context.…

We introduce a new method for computing the word length of an element of Thompson's group F with respect to a "consecutive" generating set of the form X_n={x_0,x_1,...,x_n}, which is a subset of the standard infinite generating set for F.…

We introduce a combinatorial property for finitely generated groups called stackable that implies the existence of an inductive procedure for constructing van Kampen diagrams with respect to a canonical finite presentation. We also define…

In this paper we show that the cloning system construction of Skipper and Zaremsky [SZ21], under sufficient conditions, gives rise to Thompson-Like groups which are stable; in particular, these are McDuff groups in the sense of Deprez and…

We introduce and study \emph{shift-similar} groups $G\le\textrm{Sym}(\mathbb{N})$, which play an analogous role in the world of Houghton groups that self-similar groups play in the world of Thompson groups. We also introduce Houghton-like…

We show that the Word Problem in finitely generated subgroups of $\textsf{GL}_d(\mathbb{Z})$ can be solved in linear average-case complexity. This is done under the bit-complexity model, which accounts for the fact that large integers are…

We prove that the generalised word problem of a finitely generated subgroup of a finitely generated virtually free group is context-free, that a hyperbolic group must be virtually free if it has a torsion-free quasiconvex subgroup of…

We study an abstract group of reversible Turing machines. In our model, each machine is interpreted as a homeomorphism over a space which represents a tape filled with symbols and a head carrying a state. These homeomorphisms can only…

The purpose of this article is to extend the earliest results of A.A. Brudno, connecting topological entropy of a subshift X over $\mathbb{N}$ to the Kolmogorov complexity of words in X, to subshifts over computable groups that posses…

We generalize the notion of a graph automatic group introduced by Kharlampovich, Khoussainov and Miasnikov (arXiv:1107.3645) by replacing the regular languages in their definition with more powerful language classes. For a fixed language…

A group theoretical description of basic discrete symmetries (space inversion P, time reversal T and charge conjugation C) is given. Discrete subgroups of orthogonal groups of multidimensional spaces over the fields of real and complex…

In this paper, we study isometric actions on finite-dimensional CAT(0) spaces for the Higman-Thompson groups $T_n$, which are generalizations of Thompson's group $T$. It is known that every semi-simple action of $T$ on a complete CAT(0)…

We prove that Thompson's group $T$ and, more generally, all the Higman-Thompson groups $T_n$ have quadratic Dehn function.

We investigate the notion of complexity for finitely presented groups and the related notion of complexity for three-dimensional manifolds. We give two-sided estimates on the complexity of all the Milnor groups (the finite groups with free…

Existentially closed groups are, informally, groups that contain solutions to every consistent finite system of equations and inequations. They were introduced in 1951 in an algebraic context and subsequent research elucidated deep…

It is well known that the problem solving equations in virtually free groups can be reduced to the problem of solving twisted word equations with regular constraints over free monoids with involution. In this paper we prove that the set of…

We establish sufficient conditions for the C$^*$-simplicity of two classes of groups. The first class is that of groups acting on trees, such as amalgamated free products, HNN-extensions, and their normal subgroups; for example normal…

We show how all topological full groups coming from a one-sided irreducible shift of finite type, as studied by Matui, can be re-interpreted as groups of colour-preserving tree almost automorphisms. As an application, we show that they…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

For every finitely generated recursively presented group G we construct a finitely presented group H containing G such that G is (Frattini) embedded into H and the group H has solvable conjugacy problem if and only if G has solvable…