English
Related papers

Related papers: Strictly ascending HNN extensions in soluble group…

200 papers

We prove the following version of Milnor's theorem on solvable groups of exponential growth: A finitely generated solvable group which is not polycyclic contains an ascending HNN extension. Consequently, a finitely generated solvable group…

Group Theory · Mathematics 2007-05-23 Roger Alperin

We find a non-Hopfian ascending HNN-extension of a finitely presented Hopfian group by providing an explicit construction. This result addresses an analogous question to the one posed by Sapir and Wise, which asks whether there is a…

Group Theory · Mathematics 2025-12-11 Jan Kim , Junseok Kim , Yoonjin Lee

In 2005, Borisov and Sapir proved that ascending HNN extensions of finitely generated linear groups are residually finite. Subsequently, Dru\c{t}u and Sapir noted the existence of finitely generated non-linear residually finite groups based…

Group Theory · Mathematics 2023-09-26 Donsung Lee

We find strictly ascending HNN extensions of finite rank free groups possessing a presentation 2-complex which is a non positively curved square complex. On showing these groups are word hyperbolic, we have by results of Wise and Agol that…

Group Theory · Mathematics 2013-02-22 J. O. Button

We prove that a finitely generated solvable group which is not virtually nilpotent has exponential conjugacy growth.

Group Theory · Mathematics 2011-05-17 Emmanuel Breuillard , Yves de Cornulier

We classify finitely generated, residually finite automorphism-induced HNN-extensions in terms of the residual separability of a single associated subgroup. This classification provides a method to construct automorphism-induced…

Group Theory · Mathematics 2018-10-25 Alan D. Logan

We prove that every {finitely generated residually finite}-by-sofic group satisfies Kaplansky's direct and stable finiteness conjectures with respect to all noetherian rings. We use this result to provide countably many new examples of…

Group Theory · Mathematics 2015-01-14 Federico Berlai

Stackability for finitely presented groups consists of a dynamical system that iteratively moves paths into a maximal tree in the Cayley graph. Combining with formal language theoretic restrictions yields auto- or algorithmic stackability,…

Group Theory · Mathematics 2016-05-23 Susan Hermiller , Conchita Martínez-Pérez

We give an example of a subgroup of SL(2,C) which is a strictly ascending HNN extension of a non-abelian finitely generated free group F. In particular, we exhibit a free group F in SL(2,C) of rank 6 which is conjugate to a proper subgroup…

Group Theory · Mathematics 2007-05-23 Danny Calegari , Nathan M. Dunfield

We exhibit infinitely many natural numbers $n$ for which there exists at least one insolvable group of order $n$, and yet the holomorph of any solvable group of order $n$ has no insolvable regular subgroup. We also solve Problem 19.90 (d)…

Group Theory · Mathematics 2020-03-20 Cindy Tsang , Chao Qin

In this note we look at presentations of subgroups of finitely presented groups with infinite cyclic quotients. We prove that if $H$ is a finitely generated normal subgroup of a finitely presented group $G$ with $G/H$ cyclic, then $H$ has…

Group Theory · Mathematics 2011-12-09 Mustafa Gokhan Benli

The solvable Farb growth of a group quantifies how well-approximated the group is by its finite solvable quotients. In this note we present a new characterization of polycyclic groups which are virtually nilpotent. That is, we show that a…

Group Theory · Mathematics 2011-04-13 Khalid Bou-Rabee

A 1-ended finitely presented group has semistable fundamental group at $\infty$ if it acts geometrically on some (equivalently any) simply connected and locally finite complex $X$ with the property that any two proper rays in $X$ are…

Group Theory · Mathematics 2017-09-27 Michael Mihalik

We prove that every finitely generated soluble group which is not virtually abelian has a subgroup of one of a small number of types.

Group Theory · Mathematics 2015-10-09 Tara Brough , Derek Holt

The computational complexity of the word problem in HNN-extension of groups is studied. HNN-extension is a fundamental construction in combinatorial group theory. It is shown that the word problem for an ascending HNN-extension of a group H…

Group Theory · Mathematics 2021-07-06 Markus Lohrey

We classify finite groups in which the centralisers of certain non-central elements are soluble. This includes a full structural description of groups whose non-central element centralisers are all soluble, and a reduction theorem for the…

Group Theory · Mathematics 2025-11-19 Valentina Grazian , Carmine Monetta , Gareth Tracey

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…

Group Theory · Mathematics 2019-12-03 Mark Pengitore

We define the notion of computability of F{\o}lner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich group, a finitely presented solvable group with unsolvable word problem, has…

Group Theory · Mathematics 2018-07-04 Matteo Cavaleri

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 show that all finitely generated free-by-cyclic groups are conjugacy separable: if a finitely generated group $G$ surjects onto $\mathbb{Z}$ with free kernel, then for every pair of non-conjugate elements $g,h\in G$, there exists a…

Group Theory · Mathematics 2026-04-22 François Dahmani , Sam Hughes , Monika Kudlinska , Nicholas Touikan
‹ Prev 1 2 3 10 Next ›