Related papers: Interpreting the arithmetic in Thompson's group F

It is a long standing open problem whether the Thompson group $F$ is an amenable group. In this paper we show that if $A$, $B$, $C$ denote the standard generators of Thompson group $T$ and $D:=C B A^{-1}$ then…

We show that each of Thompson's groups F, T, and V have infinitely many ends relative to certain subgroups. We go on to show that T and V both have Serre's property FA, i.e., any action of T or V on a tree will have a fixed point. (The…

This paper demonstrates the uniformly finite homology developed by Block and Weinberger and its relationship to amenable spaces via applications to the Cayley graph of Thompson's Group F. In particular, a certain class of subgraph of F is…

We give a combinatorial equivalent to the existence of a non-free hereditarily separable group of cardinality aleph_1. This can be used, together with a known combinatorial equivalent of the existence of a non-free Whitehead group, to prove…

We prove that the solvable radical of a finite group G coincides with the set of elements y having the following property: for any x in G the subgroup of G generated by x and y is solvable. We present analogues of this result for finite…

We show that hereditarily indecomposable spaces can be characterized by a special instance of the Intermediate Value Theorem in their rings of continuous functions.

We find new presentations for the Thompson's groups $F$, the derived group $F^{'}$ and the intermediate group $D$. These presentations have a common ground in that their relators are the same and only the generating sets differ. As an…

A finitely generated subgroup H of a torsion-free hyperbolic group G is called immutable if there are only finitely many conjugacy classes of injections of H into G. We show that there is no uniform algorithm to recognize immutability,…

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…

A (discrete) group is called amenable whenever there exists a finitely additive right invariant probablity measure on it. For Thompson's group $F$ the problem whether it is amenable is a long-standing open question. We consider presentation…

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…

The finiteness problem for automaton groups and semigroups has been widely studied, several partial positive results are known. However we prove that, in the most general case, the problem is undecidable. We study the case of automaton…

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…

It has been known for a long time that the fundamental group of the quotient of $\RR ^3$ by the Case-Chamberlin continuum is nontrivial. In the present paper we prove that this group is in fact, uncountable.

We determine the abstract commensurator com(F) of Thompson's group F and describe it in terms of piecewise linear homeomorphisms of the real line and in terms of tree pair diagrams. We show com (F) is not finitely generated and determine…

Every finite simple group can be generated by two elements and, in fact, every nontrivial element is contained in a generating pair. Groups with this property are said to be $\frac{3}{2}$-generated, and the finite $\frac{3}{2}$-generated…

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…

In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…

We show that the following groups are invariably generated; the group of piecewise projective homeomorphisms of the real line, the group of piecewise $\mathrm{PSL}(2,\mathbb{Z})$ homeomorphisms of the real line, Monod's group…

We show that locally solvable subgroups of PLo(I) are countable. Then for each countable ordered set, we construct a locally solvable subgroup of Thompson's Group F. We develop machinery for understanding embeddings from solvable subgroups…