English
Related papers

Related papers: Subgroups of groups finitely presented in Burnside…

200 papers

The following refinement of the Higman embedding theorem is proved: A finitely generated group $R$ is recursively presented if and only if there exists a quasi-isometric malnormal embedding of $R$ into a finitely presented group $H$ such…

Group Theory · Mathematics 2026-03-05 Francis Wagner

We prove that every finitely presented self-similar group embeds in a finitely presented simple group. This establishes that every group embedding in a finitely presented self-similar group satisfies the Boone-Higman conjecture. The simple…

Group Theory · Mathematics 2025-01-22 Matthew C. B. Zaremsky

We construct an embedding of a free Burnside group $B(m,n)$ of odd $n > 2^{48}$ and rank $m >1$ in a finitely presented group with some special properties. The main application of this embedding is an easy construction of finitely presented…

Group Theory · Mathematics 2007-05-23 S. V. Ivanov

We suggest a modified and briefer version for the proof of Higman's embedding theorem stating that a finitely generated group can be embedded in a finitely presented group if and only if it is recursively presented. In particular, we…

Group Theory · Mathematics 2023-10-18 V. H. Mikaelian

In this paper, we prove a series of results on group embeddings in groups with a small number of generators. We show that each finitely generated group $G$ lying in a variety ${\mathcal M}$ can be embedded in a $4$-generated group $H \in…

Group Theory · Mathematics 2020-09-22 Vitaly Roman'kov

We propose an algorithm which for any recursive group $G$, given by its effectively enumerable generators and recursively enumerable relations, outputs an explicit embedding of $G$ into a finitely presented group directly written by its…

Group Theory · Mathematics 2026-01-22 V. H. Mikaelian

The Burnside Problem asks whether a finitely generated group of exponent n is finite. We present a solution for 2-generator groups of prime power exponent. Results of P. Hall and G. Higman extends the finiteness conclusion to groups having…

Group Theory · Mathematics 2008-03-12 Seymour Bachmuth

This is the first of a sequence of papers devoted to studying the link between the complexity of the Word Problem for a finitely generated recursively presented group $G$ and the isoperimetric functions of the finitely presented groups in…

Group Theory · Mathematics 2025-09-23 Francis Wagner

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…

Group Theory · Mathematics 2024-03-27 D. Osin

Let $S$ be a closed surface and $\text{Diff}_{\text{Vol}}(S)$ be the group of volume preserving diffeomorphisms of $S$. A finitely generated group $G$ is periodic of bounded exponent if there exists $k \in \mathbb{N}$ such that every…

Dynamical Systems · Mathematics 2020-12-23 Sebastian Hurtado , Alejandro Kocsard , Federico Rodríguez-Hertz

The Boone--Higman conjecture is that every recursively presented group with solvable word problem embeds in a finitely presented simple group. We discuss a brief history of this conjecture and work towards it. Along the way we describe some…

Group Theory · Mathematics 2023-06-27 James Belk , Collin Bleak

The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},\ldots , a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}\cdots a_{n} =a_{\sigma (1)} a_{\sigma (2)} \cdots a_{\sigma (n)}$, where…

Rings and Algebras · Mathematics 2022-03-16 Ferran Cedo , Eric Jespers , Georg Klein

William W. Boone and Graham Higman proved that a finitely generated group has soluble word problem if and only if it can be embedded in a simple group that can be embedded in a finitely presented group. We prove the exact analogue for…

Group Theory · Mathematics 2007-10-10 A. M. W. Glass

A finitely generated group $G$ is said to be condensed if its isomorphism class in the space of finitely generated marked groups has no isolated points. We prove that every product variety $\mathcal{UV}$, where $\mathcal{U}$ (respectively,…

Group Theory · Mathematics 2021-02-16 D. Osin

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…

Group Theory · Mathematics 2023-10-18 V. H. Mikaelian

The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},..., a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}... a_{n} =a_{\sigma (a)} a_{\sigma (2)} ... a_{\sigma (n)}$, where $\sigma$…

Rings and Algebras · Mathematics 2008-10-03 F. Cedo , E. Jespers , J. Okninksi

We prove that every noncyclic subgroup of a free $m$-generator Burnside group $B(m,n)$ of odd exponent $n \gg 1$ contains a subgroup $H$ isomorphic to a free Burnside group $B(\infty,n)$ of exponent $n$ and countably infinite rank such that…

Group Theory · Mathematics 2007-05-23 S. V. Ivanov

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

Given any finitely presented group G we find a triangular algebra such that has two presentations, one with fundamental group G and another with trivial group. Thus proving that given a collection G1,...,Gn of finitely presented groups…

Group Theory · Mathematics 2008-07-30 Jorge Nicolas Lopez

All groups have 2 generators. For every prime power q, the Generalized Burnside Theorem (Theorem GB) produces an infinite number of solvable groups, Some, such as groups of a prime power exponent, have only elements of finite order and are…

Group Theory · Mathematics 2007-09-17 S. Bachmuth
‹ Prev 1 2 3 10 Next ›