English
Related papers

Related papers: Embeddings into left-orderable simple groups

200 papers

Let $G$ be a finitely generated group, and let $\Sigma$ be a finite subset that generates $G$ as a monoid. The \emph{word problem of $G$ with respect to $\Sigma$} consists of all words in the free monoid $\Sigma^{\ast}$ that are equal to…

Group Theory · Mathematics 2014-12-04 Rose Berns-Zieve , Dana Fry , Johnny Gillings , Hannah Hoganson , Heather Mathews

Previously, the authors proved that the presentation complex of a one-relator group $G$ satisfies a geometric condition called negative immersions if every two-generator, one-relator subgroup of $G$ is free. Here, we prove that one-relator…

Group Theory · Mathematics 2024-02-09 Larsen Louder , Henry Wilton

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…

Group Theory · Mathematics 2008-01-03 R. Guralnick , B. Kunyavskii , E. Plotkin , A. Shalev

We establish a general criterion for the finite presentability of subdirect products of groups and use this to characterize finitely presented residually free groups. We prove that, for all $n\in\mathbb{N}$, a residually free group is of…

Group Theory · Mathematics 2008-09-23 Martin R. Bridson , James Howie , Charles F. Miller , Hamish Short

The main theorem of this article is that every countable model of set theory M, including every well-founded model, is isomorphic to a submodel of its own constructible universe. In other words, there is an embedding $j:M\to L^M$ that is…

Logic · Mathematics 2014-02-14 Joel David Hamkins

Every countable group $G$ can be embedded in a finitely generated group $G^*$ that is hopfian and complete, i.e. $G^*$ has trivial centre and every epimorphism $G^*\to G^*$ is an inner automorphism. Every finite subgroup of $G^*$ is…

Group Theory · Mathematics 2024-11-20 Martin R. Bridson , Hamish Short

We show that the compressed word problem in a finitely-generated fully residually free group (F -group) is decidable in polynomial time, and use the result to show that the word problem in the automorphism group of such a group is decidable…

Group Theory · Mathematics 2009-10-21 Jeremy Macdonald

Given nontrivial finite groups $A$ and $B$, not both of order 2, we prove that every finite simple group of sufficiently large rank is an image of the free product $A \ast B$. To show this, we prove that every finite simple group of…

Group Theory · Mathematics 2018-04-05 Carlisle S. H. King

We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite…

Group Theory · Mathematics 2021-03-19 Emmanuel Rauzy

We prove that two countable locally finite-by-abelian groups G,H endowed with proper left-invariant metrics are coarsely equivalent if and only if their asymptotic dimensions coincide and the groups are either both finitely-generated or…

Group Theory · Mathematics 2008-09-30 T. Banakh , J. Higes , I. Zarichinyy

We prove that the finitely generated simple left orderable groups constructed by the second author with Hyde have vanishing second bounded cohomology, both with trivial real and trivial integral coefficients. As a consequence, these are the…

Group Theory · Mathematics 2023-06-06 Francesco Fournier-Facio , Yash Lodha

For all sufficiently large odd integers $n$, the following version of Higman's embedding theorem is proved in the variety ${\cal B}_n$ of all groups satisfying the identity $x^n=1$. A finitely generated group $G$ from ${\cal B}_n$ has a…

Group Theory · Mathematics 2019-09-24 Alexander Olshanskii

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…

Group Theory · Mathematics 2023-04-11 Victor Guba

In the present paper we continue studying regular free group actions on $\mathbb{Z}^n$-trees. We show that every finitely generated $\mathbb{Z}^n$-free group $G$ can be embedded into a finitely generated $\mathbb{Z}^n$-free group $H$ acting…

Group Theory · Mathematics 2021-08-12 Olga Kharlampovich , Alexei Miasnikov , Denis Serbin

A B-group is a group such that all its minimal generating sets (with respect to inclusion) have the same size. We prove that the class of finite B-groups is closed under taking quotients and that every finite B-group is solvable. Via a…

Group Theory · Mathematics 2012-11-28 Paul Apisa , Benjamin Klopsch

Motivated by recent activity in low-dimensional topology, we provide a new criterion for left-orderability of a group under the assumption that the group is circularly-orderable: A group $G$ is left-orderable if and only if $G \times…

Group Theory · Mathematics 2020-10-27 Jason Bell , Adam Clay , Tyrone Ghaswala

We study the codegree isomorphism problem for finite simple groups. In particular, we show that such a group is determined by the codegrees (counting multiplicity) of its irreducible characters. The proof is uniform for all simple groups…

Group Theory · Mathematics 2023-02-28 Nguyen N. Hung , Alexander Moretó

The set of finitely generated subgroups of the group $PL_+(I)$ of orientation-preserving piecewise-linear homeomorphisms of the unit interval includes many important groups, most notably R.~Thompson's group $F$. In this paper we show that…

Group Theory · Mathematics 2016-05-23 Collin Bleak , Tara Brough , Susan Hermiller

We refine Feighn--Handel's results on subgroups of mapping tori of free groups to the special case of free-by-cyclic groups. We use these refinements to show that any finitely generated free-by-cyclic group embeds in a {finitely generated…

Group Theory · Mathematics 2026-04-23 Marco Linton

The purpose of this article is to extend the earliest results of A.A. Brudno, connecting topological entropy of a subshift X over $\mathbb{N}$ to the Kolmogorov complexity of words in X, to subshifts over computable groups that posses…

Dynamical Systems · Mathematics 2015-10-14 Nikita Moriakov
‹ Prev 1 3 4 5 6 7 10 Next ›