Related papers: Embeddings into left-orderable simple groups

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…

There has been interest recently concerning when a left ordered group is locally indicable. Bergman and Tararin have shown that not all left ordered groups are locally indicable, but all known examples contain a nonabelian free subgroup. We…

General arguments of Baumslag and Bieri guarantee that any metabelian group of finite Pr\"ufer rank can be embedded in a metabelian constructible group. Here, we consider the metric behavior of a rich class of examples and analyze the…

We prove that the groups $\mathrm{Aut}(F_n)$ satisfy the Boone-Higman conjecture for all $n$, meaning each $\mathrm{Aut}(F_n)$ embeds in a finitely presented simple group. In fact, we prove that each $\mathrm{Aut}(F_n)$ satisfies the…

The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and…

A group is called $\Lambda$-free if it has a free Lyndon length function in an ordered abelian group $\Lambda$, which is equivalent to having a free isometric action on a $\Lambda$-tree. A group has a regular free length function in…

There are various results that frame left-orderability of a group as a geometric property. Indeed, the fundamental group of a 3-manifold is left-orderable whenever the first Betti number is positive; in the case that the first Betti number…

We construct examples of finitely generated infinite simple groups of homeomorphisms of the real line. Equivalently, these are examples of finitely generated simple left (or right) orderable groups. This answers a well known open question…

Let $d \geq 2$ be an integer. We conjecture that there is a finitely generated perfect group whose homomorphic images include all finite $d$-generated perfect groups. We prove a special case of this conjecture for the finite perfect groups…

It is known that there exists a first-order sentence that holds in a finite group if and only if the group is soluble. Here it is shown that the corresponding statements with 'solubility' replaced by 'nilpotence' and 'perfectness', among…

We construct total orders on the vertex set of an oriented tree. The orders are based only on up-down counts at the interior vertices and the edges along the unique geodesic from a given vertex to another. As an application, we provide a…

Let S be a subsemigroup of an abelian torsion-free group G. If S is a positive cone of G, then all C*-algebras generated by faithful isometrical non-unitary representations of S are canonically isomorphic. Proved by Murphy, this statement…

A prefix monoid is a finitely generated submonoid of a finitely presented group generated by the prefixes of its defining relators. Important results of Guba (1997), and of Ivanov, Margolis and Meakin (2001), show how the word problem for…

We show that every countable group embeds in a group of type $FP_2$.

We investigate the fundamental group of Griffiths' space, and the first singular homology group of this space and of the Hawaiian Earring by using (countable) reduced tame words. We prove that two such words represent the same element in…

In the context of Higman embeddings of recursive groups into finitely presented groups we suggest an algorithm which uses Higman operations to explicitly constructs the specific recursively enumerable sets of integer sequences arising…

We extend F{\o}lner's amenability criterion to the realm of general topological groups. Building on this, we show that a topological group $G$ is amenable if and only if its left translation action can be approximated in a uniform manner by…

A real number is called left-computable if there exists a computable increasing sequence of rational numbers converging to it. In this article we are investigating a proper subset of the left-computable numbers. We say that a real number…

We prove that every finitely generated, residually finite group $G$ embeds into a finitely generated perfect branch group $\Gamma$ such that many properties of $G$ are preserved under this embedding. Among those are the properties of being…

For a finite group $G$ and a positive integer $n$, let $G(n)$ be the set of all elements in $G$ such that $x^{n}=1$. The groups $G$ and $H$ are said to be of the same (order) type if $G(n)=H(n)$, for all $n$. The main aim of this paper is…