We compute the higher $Σ$-invariants $Σ^m(F_{n,\infty})$ of the generalized Thompson groups $F_{n,\infty}$, for all $m,n\ge 2$. This extends the $n=2$ case done by Bieri, Geoghegan and Kochloukova, and the $m=2$ case done by Kochloukova. Our approach differs from those used in the $n=2$ and $m=2$ cases; we look at the action of $F_{n,\infty}$ on a $\textrm{CAT}(0)$ cube complex, and use Morse theory to compute all the $Σ^m(F_{n,\infty})$.
We also obtain lower bounds on $Σ^m(H_n)$, for the Houghton groups $H_n$, again using actions on $\textrm{CAT}(0)$ cube complexes, and discuss evidence that these bounds are sharp.
This article is dedicated to the study of asymptotically rigid mapping class groups of infinitely-punctured surfaces obtained by thickening planar trees. Such groups include the braided Ptolemy-Thompson groups $T^\sharp,T^\ast$ introduced by Funar and Kapoudjian, and the braided Houghton groups $\mathrm{br}H_n$ introduced by Degenhardt. We present an elementary construction of a contractible cube complex, on which these groups act with cube-stabilisers isomorphic to finite extensions of braid groups. As an application, we prove Funar-Kapoudjian's and Degenhardt's conjectures by showing that $T…
The co-word problem of a group G generated by a set X is defined as the set of words in X which do not represent 1 in G. We introduce a new method to decide if a permutation group has context-free co-word problem. We use this method to show, that the Higman-Thompson groups, and therefore the Houghton groups, have context-free co-word problem. We also give some examples of groups, that even have an easier co-word problem. We call this property semi-deterministic context-free. The second Houghton group belongs to this class.
We say that $x,y\in Γ$ are in the same $ϕ$-twisted conjugacy class and write $x\sim_ϕy$ if there exists an element $γ\in Γ$ such that $y=γxϕ(γ^{-1})$. This is an equivalence relation on $Γ$ called the $ϕ$-twisted conjugacy. Let $R(ϕ)$ denote the number of $ϕ$-twisted conjugacy classes in $Γ$. If $R(ϕ)$ is infinite for all $ϕ\in Aut(Γ)$, we say that $Γ$ has the $R_\infty$-property. The purpose of this note is to show that the symmetric group $S_\infty$, the Houghton groups and the pure symmetric automorphism groups have the $R_\infty$-property. We show, also, that the Richard Thompson group $T$…
The main result of this article is that any braided (resp. annular, planar) diagram group $D$ splits as a short exact sequence $1 \to R \to D \to S \to 1$ where $R$ is a subgroup of some right-angled Artin group and $S$ a subgroup of Thompson's group $V$ (resp. $T$, $F$). As an application, we show that several braided diagram groups embeds into Thompson's group $V$, including Higman's groups $V_{n,r}$, groups of quasi-automorphisms $QV_{n,r,p}$, and generalised Houghton's groups $H_{n,p}$.
Orderable Thompson-like groups arising from Ore categories
Université de Genève（日内瓦大学）；Université Paris-Saclay（巴黎萨克雷大学）；CNRS（法国国家科学研究中心）；Laboratoire de mathématiques d’Orsay（奥赛数学实验室）；Université de Rennes（雷恩大学）；IRMAR（雷恩数学与应用研究所）
This Thesis presents a 2-dimensional generalization of Houghtons' groups H_n. H_n is defined to be the group of all permutations p of a disjoint union of copies of the natural numbers N, with the property that each copy of N contains a cofinite subset on which p restricts to a translation. Our group G(n) is defined to be the group of all permutations p of a disjoint union of quadrants (i.e., copies of NxN) with the property that each quadrant contains a subquadrant on which p is a translation, while p restricted to the remaining set is piecewise isometric on a cofinite disjoint union of rays (…
We describe a procedure for constructing a generalized Thompson group out of a family of groups that is equipped with what we call a cloning system. The previously known Thompson groups F, V, Vbr and Fbr arise from this procedure using, respectively, the systems of trivial groups, symmetric groups, braid groups and pure braid groups. We give new examples of families of groups that admit a cloning system and study how the finiteness properties of the resulting generalized Thompson group depend on those of the original groups. The main new examples here include upper triangular matrix groups, mo…
Let $X$ be a set and let $S$ be an inverse semigroup of partial bijections of $X$. Thus, an element of $S$ is a bijection between two subsets of $X$, and the set $S$ is required to be closed under the operations of taking inverses and compositions of functions. We define $Γ_{S}$ to be the set of self-bijections of $X$ in which each $γ\in Γ_{S}$ is expressible as a union of finitely many members of $S$. This set is a group with respect to composition. The groups $Γ_{S}$ form a class containing numerous widely studied groups, such as Thompson's group $V$, the Nekrashevych-Röver groups, Houghton'…
We look at the automorphisms of Thompson type groups of piecewise linear homeomorphisms of the real line or circle that use slopes that are integral powers of a fixed integer n with n>2. We show that large numbers of "exotic" automorphisms appear---automorphisms that are represented as conjugation by non-PL homeomorphisms of the real line or circle. This is in contrast to the n=2 case where no such automorphisms appear.
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.
We study the equivalence relation $R_N$ generated by the (non-free) action of the generalized Thompson group $F_N$ on the unit interval. We show that this relation is a standard, quasipreserving ergodic equivalence relation. Using results of Feldman-Moore, Krieger and Connes we prove that the von Neumann algebra $M(R_N)$ associated to $R_N$ is the hyperfinite type $III_λ$ factor, with $λ=1/N$.
In this paper we prove that the general version, F(N) of the Thompson group is inner amenable. As a consequence we generalize a result of P.Jolissaint. To do so, we prove first that F(N) together with a normal subgroup are i.c.c (infinite conjugacy classes) groups. Then, we investigate the relative McDuff property out of which we extract property $Γ$ for the group von Neumann algebras involved. By a result of E.G.Effros, F(N) follows inner amenable.
Let $F(p)$, $p\ge2$ be the family of generalized Thompson's groups. Here F(2) is the famous Richard Thompson's group usually denoted by $F$. We find the growth rate of the monoid of positive words in $F(p)$ and show that it does not exceed $p+1/2$. Also we describe new normal forms for elements of $F(p)$ and, using these forms, we find a lower bound for the growth rate of $F(p)$ in its natural generators. This lower bound asymptotically equals $(p-1/2)\log_2 e+1/2$ for large values of $p$.
We consider the subgroup lpG_{k,1} of length preserving elements of the Thompson-Higman group G_{k,1} and we show that all elements of G_{k,1} have a unique lpG_{k,1}.F_{k,1} factorization. This applies to the Thompson-Higman group T_{k,1} as well. We show that lpG_{k,1} is a ``diagonal'' direct limit of finite symmetric groups, and that lpT_{k,1} is a k^infinity Pr"ufer group. We find an infinite generating set of lpG_{k,1} which is related to reversible boolean circuits. We further investigate connections between the Thompson-Higman groups, circuits, and complexity. We show that elements of …
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.
A remarkable result of Thompson states that a finite group is soluble if and only if its two-generated subgroups are soluble. This result has been generalized in numerous ways, and it is in the core of a wide area of research in the theory of groups, aiming for global properties of groups from local properties of two-generated (or more generally, $n$-generated) subgroups. We contribute an extension of Thompson's theorem from the perspective of factorized groups. More precisely, we study finite groups $G = AB$ with subgroups $A,\ B$ such that $\langle a, b\rangle$ is soluble for all $a \in A$ a…
We prove new results about the remarkable infinite simple groups introduced by Richard Thompson in the 1960s. We define the groups as partial transformation groups and we give a faithful representation in the Cuntz C*-algebra. For the finitely presented simple group T_fin (also known as V) we show that the word-length and the table size satisfy an n log n relation, just like the symmetric groups. We show that the word problem of T_fin belongs to the parallel complexity class AC^1 (a subclass of plynomial time). We show that the generalized word problem of T_fin is undecidable. We study the dis…
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 p…
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…
The study of associativity of the commutator operation in groups goes back to some work of Levi in 1942. In the 1960's Richard J. Thompson created a group F whose elements are representatives of the generalized associative law for an arbitrary binary operation. In 2006, Geoghegan and Guzman proved that a group G is solvable if and only if the commutator operation in G eventually satisfies ALL instances of the associative law, and also showed that many non-solvable groups do not satisfy any instance of the generalized associative law. We will address the question: Is there a non-solvable group …
Let $PL_0(I)$ represent the group of orientation-preserving piecewise-linear homeomorphisms of the unit interval which admit finitely many breaks in slope, under the operation of composition. We find a non-solvable group $W$ and show that $W$ embeds in every non-solvable subgroup of $PL_0(I)$. We find mild conditions under which other non-solvable subgroups ($B$, $(\wr\Z\wr)^{\infty}$, $(\Z\wr)^{\infty}$, and $^{\infty}(\wr\Z)$) embed in subgroups of $PL_0(I)$. We show that all solvable subgroups of $PL_0(I)$ embed in all non-solvable subgroups of $PL_0(I)$. These results continue to apply if …
A group $G$ is said to have the property $R_\infty$ if every automorphism $ϕ\in {\rm Aut}(G)$ has an infinite number of $ϕ$-twisted conjugacy classes. Recent work of Gonçalves and Kochloukova uses the $Σ^n$ (Bieri-Neumann-Strebel-Renz) invariants to show the $R_{\infty}$ property for a certain class of groups, including the generalized Thompson's groups $F_{n,0}$. In this paper, we make use of the $Ω^n$ invariants, analogous to $Σ^n$, to show $R_{\infty}$ for certain finitely generated groups. In particular, we give an alternate and simpler proof of the $R_{\infty}$ property for BS(1,n). Moreo…
