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 partial injective functions. The monoids M_{k,1} have connections with circuit complexity (studied in another paper). Here we prove that M_{k,1} and Inv_{k,1} are congruence-simple for all k. Their Green relations J and D are characterized: M_{k,1} and Inv_{k,1} are J-0-simple, and they have k-1 non-zero D-classes. They are submonoids of the multiplicative part of the Cuntz algebra O_k. They are finitely generated, and their word problem over any finite generating set is in P. Their word problem is coNP-complete over certain infinite generating sets.
Changes in this version: Section 4 has been thoroughly revised, and errors have been corrected; however, the main results of Section 4 do not change. Sections 1, 2, and 3 are unchanged, except for the proof of Theorem 2.3, which was incomplete; a complete proof was published in the Appendix of reference [6], and is also given here.
V.S.Guba had proved that the R.Thompson group $T$ satisfies polynomial isoperimetric inequality and $Φ_T(n)\preceq n^7$, where $Φ_T$ is the Dehn function of group $T$. In this paper, we show that $Φ_T(n)\preceq n^5$.
Richard Thompson's group F is the group of piecewise linear homeomorphisms of the unit interval with a finite number of break points, all at dyadic rational numbers (their denominators are powers of 2) and with slopes which are powers of 2. A discrete group G is amenable if there exists a finitely-additive probability measure on G which is invariant under left translations and is defined on all subsets of G. The amenability question for F is a well known open problem. In this paper we prove that group F is not amenable.
Let $f$ be an automorphism of a group $G$. Two elements $x, y$ in $G$ are said to be in the same $f$-twisted conjugacy class if there exists an element $z$ in $G$ such that $y=z x f(z^{-1})$. This is an equivalence relation known as $f$-twisted conjugacy. If the number $R(f)$ of $f$-twisted conjugacy classes is infinite for every automorphism $f$ of $G$ one says that $G$ has the $R_\infty$-property. We show that the Richard Thompson group $T$ has the $R_\infty$-property.
A slight modification of the definition of the Thompson-Higman groups G_k1 and F_k1 leads to inverse monoids that map onto G_k1 (respectively F_k1), and that have interesting properties: they are finitely generated, and residually finite. These inverse monoids are closely related to the suffix expansion of G_k1 (respectively F_k1).
We revisit our construction of the Thompson groups from the polycyclic inverse monoids in the light of new research. Specifically, we prove that the Thompson group $G_{n,1}$ is the group of units of a Boolean inverse monoid $C_{n}$ called the Cuntz inverse monoid. This inverse monoid is proved to be the tight completion of the polycyclic inverse monoid $P_{n}$. The étale topological groupoid associated with $C_{n}$ under non-commutative Stone duality is the usual groupoid associated with the corresponding Cuntz $C^{\ast}$-algebra. We then show that the group $G_{n,1}$ is also the group of auto…
We generalize the Brin-Higman-Thompson groups $n G_{k,1}$ to monoids $n M_{k,1}$, for $n \ge 1$ and $k \ge 2$, by replacing bijections by partial functions. The monoid $n M_{k,1}$ has $n G_{k,1}$ as its group of units, and is congruence-simple. Moreover, $n M_{k,1}$ is finitely generated, and for $n \ge 2$ its word problem is {\sf coNP}-complete. We also present new results about higher-dimensional joinless codes.
The Bernoulli measure on strings is used to define height functions for the dense R- and L-orders of the Thompson-Higman monoids M_{k,1}. The measure can also be used to characterize the D-relation of certain submonoids of M_{k,1}. The computational complexity of computing the Bernoulli measure of certain sets, and in particular, of computing the R- and L-height of an element of M_{k,1} is investigated.
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 transpositions. This perspective provides an intuitive explanation towards the simplicity of $V$ and also perhaps indicates a reason as to why it was one of the first discovered infinite finitely presented simple groups: it is (in some basic sense) a relative of the finite alternating groups. We find a natural infinite presentation for $V$ as a group generate…
本文证明了RichardThompson在20世纪60年代提出的关于无穷单群的新结果。我们定义这些群为部分变换群，并在Cuntz C ~*-代数中给出了一个忠实的表示.对于本文提出的单群T_fin（也称为V），我们证明了字长和表大小满足n log n关系，就像对称群一样.我们证明了T_fin的字问题属于并行复杂性类AC^1（多项式时间的一个子类）。我们证明了T_fin的广义字问题是不可判定的。本文研究了T_fin的畸变函数，证明了T_fin包含所有由线性畸变子群生成的自由群的有限直积.因此，直到函数的多项式等价，以下三个集合是相同的：T_fin的失真集合，所有Dehn函数的集合，以及非确定性图灵机的时间复杂度函数的集合。
We describe, through the use of Rubin's theorem, the automorphism groups of the Higman-Thompson groups $G_{n,r}$ as groups of specific homeomorphisms of Cantor spaces $\mathfrak{C}_{n,r}$. This continues a thread of research begun by Brin, and extended later by Brin and Guzmán: to characterise the automorphism groups of the `Chameleon groups of Richard Thompson,' as Brin referred to them in 1996. The work here completes the first stage of that twenty-year-old program, containing (amongst other things) a characterisation of the automorphism group of $V$, which was the `last chameleon.' The home…
On the model of simple braids, defined to be the left divisors of Garside's elements $Δ\_n$ in the monoid $B\_\infty^+$ , we investigate simple elements in Thompson's monoid $F^+$ and in a larger monoid $H^+$ that is a hybrid of $B\_\infty^+$ and $F^+$ : in both cases, we count how many simple elements left divide the right lcm of the first n -- 1 atoms, and characterize their normal forms in terms of forbidden factors. In the case of $H^+$, a generalized Pascal triangle appears.
The Thompson-Higman groups G_{k,i} have a natural generalization to monoids M_{k,i}, and inverse monoids Inv_{k,i}. We study some structural features of M_{k,i} and Inv_{k,i} and investigate the computational complexity of decision problems. The main interest of these monoids is their close connection with circuits and circuit complexity. The maximal subgroups of M_{k,1} are isomorphic to the groups G_{k,j} (1 \leq j \leq k-1); so we rediscover all the Thompson-Higman groups within M_{k,1}. The Green relations \leq_J and \equiv_D of M_{k,1} can be decided in deterministic polynomial time when …
We investigate the connection between Tamari lattices and the Thompson group F, summarized in the fact that F is a group of fractions for a certain monoid F+sym whose Cayley graph includes all Tamari lattices. Under this correspondence, the Tamari lattice operations are the counterparts of the least common multiple and greatest common divisor operations in F+sym. As an application, we show that, for every n, there exists a length l chain in the nth Tamari lattice whose endpoints are at distance at most 12l/n.
We determine exactly which graph products, also known as Right Angled Artin Groups, embed into Richard Thompson's group $V$. It was shown by Bleak and Salazar-Diaz that $\mathbb{Z}^2 * \mathbb{Z}$ was an obstruction. We show that this is the only obstruction. This is shown by proving a graph theory result giving an alternate description of simple graphs without an appropriate induced subgraph.
We introduce a new distributional invariance principle, called `partial spreadability', which emerges from the representation theory of the Thompson monoid $F^+$ in noncommutative probability spaces. We show that a partially spreadable sequence of noncommutative random variables is adapted to a local Markov filtration. Conversely we show that a large class of noncommutative stationary Markov sequences provides representations of the Thompson monoid $F^+$. In the particular case of a classical probability space, we arrive at a de Finetti theorem for stationary Markov sequences with values in a …
We show how to construct a family of groups with simple commutator subgroups from aperiodic 1-vertex, finitely aligned higher rank graphs (which are, in fact, a class of cancellative monoids). Inverse semigroups form the intermediary between these cancellative monoids and the family of groups we are interested in. These groups can naturally be viewed as higher-dimensional generalizations of the classical Thompson groups since the finite direct products of free monoids are examples of the appropriate 1-vertex higher rank graphs.
Vaughan Jones discovered unexpected connections between Richard Thompson's group and subfactor theory while attempting to construct conformal field theories (in short CFT). Among other this founded Jones' technology: a powerful new method for constructing actions of fraction groups which had numerous applications in mathematical physics, operator algebras, group theory and more surprisingly in knot theory and noncommutative probability theory. We propose and outline a program in the vein of Jones' work but where the Thompson group is replaced by a family of groups that we name forest-skein gro…
If $ϕ$ is an automorphism of a group $G$ and $x,y\in G$, we say that $x$ and $y$ are $ϕ$-twisted conjugates if there exists an $z\in G$ such that $y=z.x.ϕ(z^{-1})$. This is an equivalence relation. If there are infinitely many $ϕ$-twisted conjugacy classes for every automorphism $ϕ$ of $G$ we say that $G$ has the $R_\infty$-property. We prove that the generalized Richard Thompson groups $F_n$ and $F(l,A,P)$ have the $R_\infty$-property.
Let $R=K[G]$ be a group ring of a group $G$ over a field $K$. The Ore condition says that for any $a,b\in R$ there exist $u,v\in R$ such that $au=bv$, where $u\ne0$ or $v\ne0$. It always holds whenever $G$ is amenable. Recently it was shown that for R.\,Thompson's group $F$ the converse is also true. So the famous amenability problem for $F$ is equivalent to the question on the Ore condition for the group ring of the same group. It is easy to see that the problem on the Ore condition for $K[F]$ is equivalent to the same property for the monoid ring $K[M]$, where $M$ is the monoid of positive e…
We show that Thompson's group F is the symmetry group of the "generic idempotent". That is, take the monoidal category freely generated by an object A and an isomorphism A \otimes A --> A; then F is the group of automorphisms of A.
Surprisingly Richard Thompson's groups have recently appeared in Jones' subfactor theory. Vaughan Jones is famous for linking theories that are a priori completely disconnected; for instance, his celebrated polynomial for links emanating from subfactor theory. This note is about a new beautiful story in mathematics which results from a fortunate accident in the land of quantum field theory.
The Thompson group $V$, as well as the Brin-Thompson group $2V$, is finitely generated and can be defined as a monoid acting on bitstrings, respectively pairs of bitstrings. Therefore evaluation problems can be defined for $V$ and $2V$. We show that these evaluation problems reduce to the corresponding word problems, and that in general, these evaluation problems are actually equivalent to the word problems. The long-input version of the evaluation problem is deterministic context-free and reverse deterministic context-free for $V,$ and P-complete for $2V$.
Given any linear isometry from a Hilbert space to its square one can explicitly construct a so-called Pythagorean unitary representation of Richard Thompson's group F. We introduce a condition on the isometry implying that the associated representation does not contain any induced representations by finite-dimensional ones. This provides the first result of this kind. We illustrate this theorem via a family of representations parametrised by the real 3-sphere for which all of them have this property except two sub-circles.
Let $G$ be a finitely generated group, and let $Σ$ be a finite subset that generates $G$ as a monoid. The \emph{word problem of $G$ with respect to $Σ$} consists of all words in the free monoid $Σ^{\ast}$ that are equal to the identity in $G$. The \emph{co-word problem of $G$ with respect to $Σ$} is the complement in $Σ^{\ast}$ of the word problem. We say that a group $G$ is \emph{co$\mathcal{CF}$} if its co-word problem with respect to some (equivalently, any) finite generating set $Σ$ is a context-free language. We describe a generalized Thompson group $V_{(G, θ)}$ for each finite group G an…
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 H_1}π(g)=\sum_{h\in H_2}π(h)$ and such that the closed ideal generated by $\sum_{g\in H_1}λ(g)-\sum_{h\in H_2}λ(h)$ coincides with $C^*_λ(T)$, then the Richard Thompson group $F$ is not amenable. In particular, if $C_λ^*(T)$ is simple then $F$ is not amenable. Here we prove the converse, namely, if $F$ is not amenable then we can find two sets $H_1$ and $H_2$ with the above pro…
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 elementary theories of all these groups are undecidable. Moreover, Thompson's group $F$ and some of its generalizations interpret the Arithmetic without parameters.
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 elementary theories of all these groups are undecidable. Moreover, Thompson's group $F$ and some of its generalizations interpret the Arithmetic without parameters.
We demonstrate the existence of a family of finitely generated subgroups of Richard Thompson's group $F$ which is strictly well-ordered by the embeddability relation in type $ε_0 +1$. All except the maximum element of this family (which is $F$ itself) are elementary amenable groups. In fact we also obtain, for each $α< ε_0$, a finitely generated elementary amenable subgroup of $F$ whose EA-class is $α+ 2$. These groups all have simple, explicit descriptions and can be viewed as a natural continuation of the progression which starts with $\mathbf{Z} + \mathbf{Z}$, $\mathbf{Z} \wr \mathbf{Z}$, a…
The recent paper "The further chameleon groups of Richard Thompson and Graham Higman: automorphisms via dynamics for the Higman groups $G_{n,r}$" of Bleak, Cameron, Maissel, Navas and Olukoya (BCMNO) characterises the automorphisms of the Higman-Thompson groups $G_{n,r}$ as the specific subgroup of the rational group $\mathcal{R}_{n,r}$ of Grigorchuk, Nekrashevych and Suchanski{\u i}'s consisting of those elements which have the additional property of being bi-synchronizing. In this article, we extend the arguments of BCMNO and characterise the automorphism group of $T_{n,r}$ as a subgroup of …
In the quest in constructing conformal field theories (CFT) Jones has discovered a beautiful and deep connection between CFT, Richard Thompson's groups and knot theory. This led to a powerful functorial framework for constructing actions of particular groups arising from categories such as Thompson's groups and braid groups. In particular, given a group and two of its endomorphisms one can construct a semidirect product where the largest Thompson's group $V$ is acting. These semidirect products have remarkable diagrammatic descriptions which were previously used to provide new examples of grou…
In this second article, we continue to study classes of groups constructed from a functorial method due to Vaughan Jones. A key observation of the author shows that these groups have remarkable diagrammatic properties that can be used to deduce their properties. Given any group and two of its endomorphisms, we construct a semidirect product. In our first article dedicated to this construction, we classify up to isomorphism all these semidirect products when one of the endomorphisms is trivial and described their automorphism group. In this article we focus on the case where both endomorphisms …
Richard J. Thompson invented his group F in the 60s; it is a group full of surprises: it has a finite presentation with 2 generators and 2 relators, and a derived group that is simple; it admits a peculiar infinite presentation and has a local definition which implies that F is dense in the topological group of all orientation preserving homeomorphisms of the unit interval. In this monograph groups G are studied which depend on three parameters I, A, and P and which generalize the local definition of Thompson's group F thus: G consists of all orientation preserving PL-homeomorphisms of the rea…
