Related papers: Finite groups of arbitrary deficiency

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

We show that every finitely generated group admits weak analogues of an invariant expectation, whose existence characterizes exact groups. This fact has a number of applications. We show that Hopf $G$-modules are relatively injective, which…

It is shown that there exist infinitely many non-integers $r>2$ such that the Dehn function of some finitely presented group is $\simeq n^r$. For each positive rational number $s$ we construct pairs of finitely presented groups $H\subset G$…

In this paper we introduce the concept of weighted deficiency for abstract and pro-$p$ groups and study groups of positive weighted deficiency which generalize Golod-Shafarevich groups. In order to study weighted deficiency we introduce…

An $integral$ of a group $G$ is a group $H$ whose derived group (commutator subgroup) is isomorphic to $G$. This paper discusses integrals of groups, and in particular questions about which groups have integrals and how big or small those…

A group $G$ is said to have dense normalizers if each non-empty open interval in its subgroup lattice $L(G)$ contains the normalizer of a certain subgroup of $G$. In this note, we find all finite groups satisfying this property. We also…

We give a simple proof of a result originally due to Dimca and Suciu: a group that is both Kaehler and the fundamental group of a closed three-manifold is finite. We also prove that a group that is both the fundamental group of a closed…

We show that the discrete Heisenberg group has unbounded dead-end depth with respect to every finite generating set. We also show that, in contrast, it has bounded retreat depth.

Let $G$ be a group. A subset $D$ of $G$ is a determining set of $G$, if every automorphism of $G$ is uniquely determined by its action on $D$. The determining number of $G$, denoted by $\alpha(G)$, is the cardinality of a smallest…

We study finite groups $G$ with the property that for any subgroup $M$ maximal in $G$ whose order is divisible by all the prime divisors of $|G|$, $M$ is supersolvable. We show that any nonabelian simple group can occur as a composition…

A finite presentation < X | R > of a finite group is called `just finite' if removing any relation from R results in a presentation for an infinite group. It has been an open question (Kourovka Notebook, Problem 21.10) whether every finite…

We show that for every positive integer $n$ there exists a simple group that is of type $\mathrm{F}_{n-1}$ but not of type $\mathrm{F}_n$. For $n\ge 3$ these groups are the first known examples of this kind. They also provide infinitely…

Over any partially ordered abelian group whose positive cone is closed in an appropriate sense and has finitely many faces, modules that satisfy a weak finiteness condition admit finite primary decompositions. This conclusion rests on the…

For every N > 0 there exists a group of deficiency less than -N that arises as the fundamental group of a smooth homology 4-sphere and also as the fundamental group of the complement of a compact contractible submanifold of the 4-sphere. A…

Let $k(G)$ be the number of conjugacy classes of finite groups $G$ and $\pi_e(G)$ be the set of the orders of elements in $G$. Then there exists a non-negative integer $k$ such that $k(G)=|\pi_e(G)|+k$. We call such groups to be $co(k)$…

Let $\mathcal{F}$ be a set of finite groups. A finite group $G$ is called an \emph{$\mathcal{F}$-cover} if every group in $\mathcal{F}$ is isomorphic to a subgroup of $G$. An $\mathcal{F}$-cover is called \emph{minimal} if no proper…

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…

Every finite non-abelian group of order $n$ has a non-central element whose centralizer has order exceeding $n^{1/3}$. The proof does not rely on the classification of finite simple groups, yet it uses the Feit-Thompson theorem.

The prime graph (or Gruenberg-Kegel graph) of a finite group $G$ is a familiar graph. In this paper first, we investigate the structure of the finite groups with a non-complete prime graph. Then we prove that every alternating group…

Let $p$ be a prime number and suppose that every maximal subgroup of a finite group is either $p$-nilpotent or has prime index. Such group need not be $p$-solvable, and we study its structure by proving that only one nonabelian simple group…