English
Related papers

Related papers: Effective Subgroup Separability of Finitely Genera…

200 papers

An algebra is finitely related (or has finite degree) if its term functions are determined by some finite set of finitary relations. Nilpotent monoids built from words, via Rees quotients of free monoids, have been used to exhibit many…

Group Theory · Mathematics 2024-07-08 Daniel Glasson

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

We define the notion of accessibility for a pro-$p$ group. We prove that finitely generated pro-$p$ groups are accessible given a bound on the size of their finite subgroups. We then construct a finitely generated inaccessible pro-$p$…

Group Theory · Mathematics 2018-11-07 Gareth Wilkes

We introduce the concept of quantifying the extent to which a finitely generated group is residually finite. The quantification is carried out for some examples including free groups, the first Grigorchuk group, finitely generated nilpotent…

Group Theory · Mathematics 2010-04-16 Khalid Bou-Rabee

In this note we study the finite groups whose subgroup lattices are dismantlable.

Group Theory · Mathematics 2015-02-18 Marius Tarnauceanu

Given a finite group $G,$ we denote by $\Delta(G)$ the graph whose vertices are the proper subgroups of $G$ and in which two vertices $H$ and $K$ are joined by an edge if and only if $G=\langle H,K\rangle.$ We prove that if there exists a…

Group Theory · Mathematics 2023-06-22 Andrea Lucchini

Word maps provide a wealth of information about finite groups. We examine the connection between the probability distribution induced by a word map and the underlying structure of a finite group. We show that a finite group is nilpotent if…

Group Theory · Mathematics 2018-07-20 William Cocke , Meng-Che "Turbo" Ho

We prove that the finitely presentable subgroups of residually free groups are separable and that the subgroups of type $\mathrm{FP}_\infty$ are virtual retracts. We describe a uniform solution to the membership problem for finitely…

Group Theory · Mathematics 2007-06-29 Martin R. Bridson , Henry Wilton

Let $ n, q $ be positive integers. We show that if $ G $ is a finitely generated residually finite group satisfying the identity $ [x,_ny^q]\equiv 1, $ then there exists a function $ f(n) $ such that $ G $ has a nilpotent subgroup of finite…

Group Theory · Mathematics 2020-02-17 Danilo Silveira

Let $\mathfrak{Nil}$ be the class of nilpotent groups. This article explores the finiteness of meta and para-$\mathfrak{Nil}$-Hamiltonian groups or their derived subgroups when these groups contain a soluble subgroup of finite index or a…

Group Theory · Mathematics 2025-02-11 Hamid Mousavi

It is shown that a closed solvable subgroup of a connected Lie group is compactly generated. In particular, every discrete solvable subgroup of a connected Lie group is finitely generated. Generalizations to locally compact groups are…

Group Theory · Mathematics 2011-02-19 Karl Heinrich Hofmann , Karl-Hermann Neeb

We investigate the palindromic width of finitely generated solvable groups. We prove that every finitely generated $3$-step solvable group has finite palindromic width. More generally, we show the finiteness of palindromic width for…

Group Theory · Mathematics 2015-10-29 Valeriy G. Bardakov , Krishnendu Gongopadhyay

Every finite group $G$ has a normal series each of whose factors either is soluble or is a direct product of nonabelian simple groups. We define the nonsoluble length $\lambda (G)$ as the minimum number of nonsoluble factors in a series of…

Group Theory · Mathematics 2014-09-02 E. I. Khukhro , P. Shumyatsky

We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…

Group Theory · Mathematics 2021-10-01 A. S. Detinko , D. L. Flannery

Let $\Gamma_G$ denote a graph associated with a group $G$. A compelling question about finite groups asks whether or not a finite group $H$ must be nilpotent provided $\Gamma_H$ is isomorphic to $\Gamma_G$ for a finite nilpotent group $G$.…

Group Theory · Mathematics 2023-09-22 Valentina Grazian , Andrea Lucchini , Carmine Monetta

Thompson's theorem stated that a finite group $G$ is solvable if and only if every $2$-generated subgroup of $G$ is solvable. In this paper, we prove some new criteria for both solvability and nilpotency of a finite group using certain…

Group Theory · Mathematics 2024-02-29 Hung P. Tong-Viet

The question of computing the group complexity of finite semigroups and automata was first posed in K. Krohn and J. Rhodes, \textit{Complexity of finite semigroups}, Annals of Mathematics (2) \textbf{88} (1968), 128--160, motivated by the…

Group Theory · Mathematics 2008-12-19 Karsten Henckell , John Rhodes , Benjamin Steinberg

Let $G$ be a group that is relatively hyperbolic with respect to a collection of subgroups $\{H_{\lambda}\}_{\lambda\in \Lambda}$. Suppose that $G$ is given by a finite relative presentation $\mathcal{P}$ with respect to this collection. We…

Group Theory · Mathematics 2025-01-09 Oleg Bogopolski

Let $A$ and $G$ be finite groups such that $A$ acts coprimely on $G$ by automorphisms. For any fixed prime divisor $p$ of $|G|$, we provide a complete characterization of the structure of a group $G$ in which every maximal $A$-invariant…

Group Theory · Mathematics 2025-02-11 Jiangtao Shi , Mengjiao Shan , Fanjie Xu

In this paper we consider the palindromic width of free nilpotent groups. In particular, we prove that the palindromic width of a finitely generated free nilpotent group is finite. We also prove that the palindromic width of a free…

Group Theory · Mathematics 2014-02-25 Valeriy G. Bardakov , Krishnendu Gongopadhyay
‹ Prev 1 3 4 5 6 7 10 Next ›