Related papers: A characterization of nilpotent bicyclic groups

Let $G$ be a finite group admitting a coprime automorphism $\alpha$. Let $J_G(\alpha)$ denote the set of all commutators $[x,\alpha]$, where $x$ belongs to an $\alpha$-invariant Sylow subgroup of $G$. We show that $[G,\alpha]$ is soluble or…

The notion of bounded FC-nilpotent group is introduced and it is shown that any such group is nilpotent-by-finite, generalizing a result of Neumann on bounded FC-groups.

A free-by-cyclic group $F_N\rtimes_\phi\mathbb{Z}$ has non-trivial centre if and only if $[\phi]$ has finite order in ${\rm{Out}}(F_N)$. We establish a profinite ridigity result for such groups: if $\Gamma_1$ is a free-by-cyclic group with…

Suppose that a metacyclic Frobenius group $FH$, with kernel $F$ and complement $H$, acts by automorphisms on a finite group $G$, in such a way that $C_G(F)$ is trivial and $C_G(H)$ is nilpotent. It is known that $G$ is nilpotent and its…

In the first part, we prove that the dominion (in the sense of Isbell) of a subgroup of a finitely generated nilpotent group is trivial in the category of all nilpotent groups. In the second part, we show that the dominion of a subgroup of…

Li and Praeger classified finite nonabelian simple groups, it has only one or two fusion classes of any certain value. As a by-product, they classified m-CI-groups, which is critical in the research of Cayley graphs. In the paper, we will…

It is known that every nilpotent group contains solution of every finite unimodular system of equatiuons over itself. This statement, however, is not true for infinite systems. Moreover, there are abelian groups which disprove the infinite…

If a soluble group $G$ contains two finitely generated abelian subgroups $A,B$ such that the number of double cosets $AgB$ is finite, then $G$ is shown to be virtually polycyclic.

A group G is almost cyclic if there is an element x in G, such that for all g in G, there is an element y in G and an integer n with ygy^{-1} = x^n (that is, every element is conjugate to some power of x). W. Ziller asked whether there are…

A subgroup of a finite group is wide if each prime divisor of the group order divides the subgroup order. We obtain the description of finite soluble groups with no wide subgroups. We also prove that a finite soluble group with nilpotent…

We prove that if $X$ is a compact, oriented, connected $4$-dimensional smooth manifold, possibly with boundary, satisfying $\chi(X)\neq 0$, then there exists an integer $C\geq 1$ such that any finite group $G$ acting smoothly and…

Let $A$ and $G$ be finite groups such that $A$ acts coprimely on $G$ by automorphisms. We provide a complete classification of a finite group $G$ in which every maximal $A$-invariant subgroup containing the normalizer of some $A$-invariant…

We prove that every free metabelian non--cyclic group has a finitely generated isolated subgroup which is not separable in the class of nilpotent groups. As a corollary we prove that for every prime number $p$ an arbitrary free metabelian…

Let $H$ be a finite abelian (commutative) group of order $n \geq 2$, and $m >1$ be an integer. We define the $m$-graph of $H$, denoted by $m-G(H)$, as a simple undirected graph with vertex set $H$, and two distinct vertices, $a, b \in H$,…

A complete mapping of a group $G$ is a bijection $\phi\colon G\to G$ such that $x\mapsto x\phi(x)$ is also bijective. Hall and Paige conjectured in 1955 that a finite group $G$ has a complete mapping whenever $\prod_{x\in G} x$ is the…

By a result of Noritzsch, a finite solvable group whose non-linear character degrees have the same set of prime divisors is meta-abelian. In this note we investigate finite non-solvable groups whose non-linear character degrees have the…

We prove that if $G$ and $H$ are finite metacyclic groups with isomorphic rational group algebras and one of them is nilpotent then $G$ and $H$ are isomorphic.

We study a class $\mathfrak{M}$ of cyclically presented groups that includes both finite and infinite groups and is defined by a certain combinatorial condition on the defining relations. This class includes many finite metacyclic…

The word problem is an old and central problem in (computational) group theory. It is well-known that the word problem is undecidable in general, but decidable for specific types of presentations. Consistent polycyclic presentations are an…

A countable discrete group is said to be Frobenius stable if every function from the group to unitary matrices that is "almost multiplicative" in the Frobenius norm is "close" to a unitary representation in the Frobenius norm. The purpose…