Related papers: Embeddings into left-orderable simple groups

We address the question: for which collections of finite simple groups does there exist an algorithm that determines the images of an arbitrary finitely presented group that lie in the collection? We prove both positive and negative…

Let $\mathcal G$ denote the space of finitely generated marked groups. For any finitely generated group $G$, we construct a continuous, injective map $f$ from the space of subgroups $Sub(G)$ to $\mathcal G$ that sends conjugate subgroups to…

We prove that in every finitely generated profinite group, every subgroup of finite index is open; this implies that the topology on such groups is determined by the algebraic structure. This is deduced from the main result about finite…

We study in this paper the validity of the mean ergodic theorem along \emph{left} F\o lner sequences in a countable amenable group $G$. Although the \emph{weak} ergodic theorem always holds along \emph{any} left F\o lner sequence in $G$, we…

We arrange classical small cancellation constructions to produce left-orderable groups: we show that every finitely generated group is the quotient of a left-ordered small cancellation group by a finitely generated kernel (Rips…

We present an alternative approach to the result of Guentner, Higson, and Weinberger concerning the Baum-Connes conjecture for finitely generated subgroups of SL(2,C). Using finite-dimensional methods, we show that the Baum-Connes assembly…

We provide polynomial lower bounds for residual finiteness of residually finite, finitely generated solvable groups that admit infinite order elements in the Fitting subgroup of strict distortion at least exponential. For this class of…

We study the geometry of positive cones of left-invariant total orders (left-order, for short) in finitely generated groups. We introduce the \textit{Hucha property} and the \texit{Prieto property} for left-orderable groups. The first one…

In this work we employ machine learning to understand structured mathematical data involving finite groups and derive a theorem about necessary properties of generators of finite simple groups. We create a database of all 2-generated…

Explicit embeddings of the group $\mathbb{Q}$ into a finitely presented group $\mathcal{Q}$ and into a $2$-generator finitely presented group $T_{\mathcal{Q}}$ are suggested. The constructed embeddings reflect questions mentioned by…

For a fixed finite dimensional algebra $A$, we study representation embeddings of the form $mod(B)\rightarrow mod(A)$. Such an embedding is called homological, if it induces an isomorphism on all Ext-groups and weakly homological, if only…

We prove that Thompson's group $F$ has a subgroup $H$ such that the conjugacy problem in $H$ is undecidable and the membership problem in $H$ is easily decidable. The subgroup $H$ of $F$ is a closed subgroup of $F$. That is, every function…

We prove that the order of an ordered group is an interval order if and only if it is a semiorder. Next, we prove that every semiorder is isomorphic to a collection $\mathcal J$ of intervals of some totally ordered abelian group, these…

We show that certain orderable groups admit no isolated left orders. The groups we consider are cyclic amalgamations of a free group with a general orderable group, the HNN extensions of free groups over cyclic subgroups, and a particular…

Every left-invariant ordering of a group is either discrete, meaning there is a least element greater than the identity, or dense. Corresponding to this dichotomy, the spaces of left, Conradian, and bi-orderings of a group are naturally…

Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed subgroup of some family of automorphisms, or family of endomorphisms of $F$ and, in the…

We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…

For a commutative finite $\mathbb{Z}$-algebra, i.e., for a commutative ring $R$ whose additive group is finitely generated, it is known that the group of units of $R$ is finitely generated, as well. Our main results are algorithms to…

We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…

A left orderable monster is a finitely generated left orderable group all of whose fixpoint-free actions on the line are proximal: the action is semiconjugate to a minimal action so that for every bounded interval $I$ and open interval $J$,…