Related papers: Interpreting the arithmetic in Thompson's group F
The purpose of this article is prove that Thompson's group F is amenable. The methods developed will then be used to prove a generalization of Hindman's theorem for the free nonassociative binary system on one generator.
We study subgroups of Thompson's group $F$ by means of an automaton associated with them. We prove that every maximal subgroup of $F$ of infinite index is closed, that is, it coincides with the subgroup of $F$ accepted by the automaton…
In 1984 Brown and Geoghegan proved that Thompson's group $F$ is of type $\textrm{F}_\infty$, making it the first example of an infinite dimensional torsion-free group of type $\textrm{F}_\infty$. Over the decades a different, shorter proof…
The purpose of this paper is to study the properties of the irrational-slope Thompson's group $F_\tau$ introduced by Cleary in 1995. We construct presentations, both finite and infinite and we describe its combinatorial structure using…
We describe the results of some computational explorations in Thompson's group F. We describe experiments to estimate the cogrowth of F with respect to its standard finite generating set, designed to address the subtle and difficult…
We prove that Thompson's group F is not minimally almost convex with respect to any generating set which is a subset of the standard infinite generating set for F and which contains x_1. We use this to show that F is not almost convex with…
In this short note, we show that R. Thompson's group $F$ admits a normalish amenable subgroup, and that the standard copy of $F$ in R. Thompson's group $T$ is normalish in $T$. We further conjecture that if $F$ is non-amenable, then $T$…
Let $F$ denote the Thompson group with standard generators $A=x_0$, $B=x_1$. It is a long standing open problem whether $F$ is an amenable group. By a result of Kesten from 1959, amenability of $F$ is equivalent to $$(i)\qquad ||I+A+B||=3$$…
This paper allows one to obtain a criterion for the existence of a projectively invariant measure formulated in terms of combinatorial properties of a group (amenability of some canonical quotient group). Such necessary and sufficient…
In this short article, we prove that any automorphism of the R. Thompson's group $F$ has infinitely many twisted conjugacy classes. The result follows from the work of Matthew Brin, together with a standard facts on R. Thompson's group $F$,…
We show that the problem `whether a finite set of regular-linear axioms defines a rigid theory' is undecidable.
Using a result of Kari and Ollinger, we prove that the torsion problem for elements of the Brin-Thompson group 2V is undecidable. As a result, we show that there does not exist an algorithm to determine whether an element of the rational…
It is well known that whenever a class of structures $\mathcal{K}_1$ is interpretable in a class of structures $\mathcal{K}_2$, then the hereditary undecidability of (a fragment of) the theory of $\mathcal{K}_1$ implies the hereditary…
Recall that a group $G$ is said to be $\frac{3}{2}$-generated if every non-trivial element of $G$ belongs to a generating pair of $G$. Thompson's group $V$ was proved to be $\frac{3}{2}$-generated by Donoven and Harper in 2019. It was the…
We show that the Diophantine problem(decidability of equations) is undecidable in free associative algebras over any field and in the group algebras over any field of a wide variety of torsion free groups, including toral relatively…
We construct the first examples of an algorithmically complex finitely presented residually finite groups and first examples of finitely presented residually finite groups with arbitrarily large (recursive) Dehn function and depth function.…
We introduce the subgroup identification problem, and show that there is a finitely presented group G for which it is unsolvable, and that it is uniformly solvable in the class of finitely presented locally Hopfian groups. This is done as…
The subgroup structure of Thompson's group F is not yet fully understood. The group F is a subgroup of the group PL(I) of orientation preserving, piecewise linear self homeomorphisms of the unit interval and this larger group thus also has…
A machine developed by the second author produces a rich family of unitary representations of the Thompson groups F,T and V. We use it to give direct proofs of two previously known results. First, we exhibit a unitary representation of V…
The solvability of monomial groups is a well-known result in character theory. Certain properties of Artin L-series suggest a generalization of these groups, namely to such groups where every irreducible character has some multiple which is…