Related papers: The subgroup identification problem for finitely p…

We study the Diophantine problem (decidability of finite systems of equations) in different classes of finitely generated solvable groups (nilpotent, polycyclic, metabelian, free solvable, etc), which satisfy some natural…

Given a $p$-adic group $G$ equipped with an action of a finite group $\Gamma\subset\mathrm{Aut}_F(\mathbf{G})$, and a reductive fixed-point subgroup $G^\Gamma$, we establish a relationship between constructions of types for these two groups…

Assume $G$ is a solvable group whose elementary abelian sections are all finite. Suppose, further, that $p$ is a prime such that $G$ fails to contain any subgroups isomorphic to $C_{p^\infty}$. We show that if $G$ is nilpotent, then the…

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…

Hard instances of natural computational problems are often elusive. In this note we present an example of a natural decision problem, the word problem for a certain finitely presented group, whose hard instances are easy to find. More…

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…

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…

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…

We further investigate the weak topology generated by the irreducible unitary representations of a group $G$. A deep result due to Ernest \cite{Ernest1971} and Hughes \cite{Hughes1973} asserts that every weakly compact subset of a locally…

We exhibit a family of infinite, finitely-presented, nilpotent-by-abelian groups. Each member of this family is a solvable S-arithmetic group that is related to Baumslag-Solitar groups, and everyone of these groups has a quasi-isometry…

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…

We determine which of the finite-type Artin groups are locally indicable, and compute presentations for their commutator subgroups.

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…

In this paper, we provide some conditions of (super)-solvability and nilpotency of a finite group $G$ based on its number of subgroups $Sub(G)$. Our results generalize the classification of finite groups with less than $20$ subgroups by…

Let $ H $ be a subgroup of a finite group $ G $. We say that $ H $ satisfies the $ \Pi $-property in $ G $ if for any chief factor $ L / K $ of $ G $, $ |G/K : N_{G/K}(HK/K\cap L/K )| $ is a $ \pi (HK/K\cap L/K) $-number. In this paper, we…

We generalize the classical definition of effectively closed subshift to finitely generated groups. We study classical stability properties of this class and then extend this notion by allowing the usage of an oracle to the word problem of…

The Equation Problem in finitely presented groups asks if there exists an algorithm which determines in finite amount of time whether any given equation system has a solution or not. We show that the Equation Problem in central extensions…

For a variety of finite groups $\mathbf H$, let $\overline{\mathbf H}$ denote the variety of finite semigroups all of whose subgroups lie in $\mathbf H$. We give a characterization of the subsets of a finite semigroup that are pointlike…

The Hidden Subgroup Problem is used in many quantum algorithms such as Simon's algorithm and Shor's factoring and discrete log algorithms. A polynomial time solution is known in case of abelian groups, and normal subgroups of arbitrary…

There exist right angled Artin groups $A$ such that the isomorphism problem for finitely presented subgroups of $A$ is unsolvable, and for certain finitely presented subgroups the conjugacy and membership problems are unsolvable. It follows…