Related papers: Thompson's group F is not almost convex

A theory T is tight if different deductively closed extensions of T (in the same language) cannot be bi-interpretable. Many well-studied foundational theories are tight, including PA [Visser2006], ZF, Z2, and KM [enayat2017]. In this…

We construct an explicit infinite family of pairwise non-isomorphic infinite simple groups of type $\mathrm{F}_\infty$ (in particular, they are finitely presented) that act faithfully on the circle by orientation-preserving homeomorphisms,…

In phylogenetics, a key problem is to construct evolutionary trees from collections of characters where, for a set X of species, a character is simply a function from X onto a set of states. In this context, a key concept is convexity,…

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…

In 1968, John Thompson proved that a finite group $G$ is solvable if and only if every $2$-generator subgroup of $G$ is solvable. In this paper, we prove that solvability of a finite group $G$ is guaranteed by a seemingly weaker condition:…

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 provide the first example of a finitely presented (in fact, type $F_\infty$) group with elements whose stable commutator length is algebraic and irrational, answering a question of Calegari. Our example is the lift to the real line of…

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…

The purpose of this note is to prove a lower bound on the Folner function for Thompson's groups F.

In this paper we present a new kind of semigroups called convex body semigroups which are generated by convex bodies of R^k. They generalize to arbitrary dimension the concept of proportionally modular numerical semigroup of [7]. Several…

The reflection length of an element of a Coxeter group is the minimal number of conjugates of the standard generators whose product is equal to that element. In this paper we prove the conjecture of McCammond and Petersen that reflection…

We show that for every positive integer $n$ there exists a simple group that is of type $\mathrm{F}_{n-1}$ but not of type $\mathrm{F}_n$. For $n\ge 3$ these groups are the first known examples of this kind. They also provide infinitely…

It was shown in a previous work of the first named author with De Chiffre, Glebsky and Thom that there exists a finitely presented group which cannot be approximated by almost-homomorphisms to the unitary groups $U(n)$ equipped with the…

This is an announcement of some of the results obtained as a part of the second author's Ph.D. thesis. In the first part, we prove that the fundamental group of an acylindrical complex of hyperbolic groups with finite edge groups is…

We study the hardness of approximation of clause minimum and literal minimum representations of pure Horn functions in $n$ Boolean variables. We show that unless P=NP, it is not possible to approximate in polynomial time the minimum number…

We prove that under two natural probabilistic models (studied by Cleary, Elder, Rechnitzer and Taback), the probability that a random pair of elements of Thompson's group $F$ generate the entire group is positive. We also prove that for any…

We prove that the group of almost-automorphisms of the infinite rooted regular $d$-ary tree $\mathcal{T}_d$ arises naturally as the Thompson-like group of a so called $d$-ary cloning system. A similar phenomenon occurs for any…

We give lower bounds on the complexity of the word problem of certain non-solvable groups: for a large class of non-solvable infinite groups, including in particular free groups, Grigorchuk's group and Thompson's groups, we prove that their…

We show that properties $F_n$ and $FP_n$ hold for a relatively hyperbolic group if and only if they hold for all the peripheral subgroups. As an application we show that there are at least countably many distinct quasi-isometry classes of…

Computational asymmetry, i.e., the discrepancy between the complexity of transformations and the complexity of their inverses, is at the core of one-way transformations. We introduce a computational asymmetry function that measures the…