Related papers: Finite groups with a certain number of cyclic subg…
In this paper we introduce and study the concept of cyclic factorization number of a finite group G. By using the Mobius inversion formula and other methods involving the cyclic subgroup structure, this is explicitly computed for some…
We prove that if $G$ is a finite simple group which is the unit group of a ring, then $G$ is isomorphic to either (a) a cyclic group of order 2; (b) a cyclic group of prime order $2^k -1$ for some $k$; or (c) a projective special linear…
In this paper, we classify the finite simple groups with an abelian Sylow subgroup.
In this paper we survey a new criteria for solvability of finite groups in terms of number of supersolvable (also known as polycyclic) and non-supersolvable subgroups. In particular, we present original examples of supersolvable groups such…
An abstract group $G$ is called totally $2$-closed if $H=H^{(2),\Omega}$ for any set $\Omega$ with $G\cong H\leq{\rm Sym}(\Omega)$, where $H^{(2),\Omega}$ is the largest subgroup of ${\rm Sym}(\Omega)$ whose orbits on $\Omega\times\Omega$…
In this note, we show that among finite nilpotent groups of a given order or finite groups of a given odd order, the cyclic group of that order has the minimum number of edges in its cyclic subgroup graph. We also conjecture that this holds…
Here we show that a finite nilpotent group is 2-closed if and only if it is either cyclic or a direct product of a generalized quaternion group with a cyclic group of odd order.
Let $\lambda(G)$ be the maximum number of subgroups in an irredundant covering of a finite group $G$. We prove that the finite groups with $\lambda(G)=|G|-t$, where $t\leq 5$, are solvable, and classify such groups.
We give a complete classification of the finite $2$-groups $G$ for which the automorphism group $\operatorname{Aut}(G)$ acting naturally on $G$ has three orbits. There are two infinite families and one additional group, of order $2^9$. All…
In this paper we introduce and study the relative cyclic subgroup commutativity degrees of a finite group. We show that there is a finite group with $n$ such degrees for all $n \in \mathbb{N}^*\setminus \lbrace 2\rbrace$ and we indicate…
We prove that the subgroup graph of a finite group $G$ is regular if and only if $G$ is cyclic with square-free order.
We consider the quotient group $T(G)$ of the multiple holomorph by the holomorph of a finite $p$-group $G$ of class two for an odd prime $p$. By work of the first-named author, we know that $T(G)$ contains a cyclic subgroup of order…
A subgroup of a finite group G is said to be second maximal if it is maximal in every maximal subgroup of G that contains it. A question which has received considerable attention asks: can every positive integer occur as the number of the…
We prove an upper bound for the number of cyclic transitive subgroups in a finite permutation group and clarify the structure of the groups for which this bound becomes sharp. We also give an application in the theory of number fields.
In this note we study the finite groups whose subgroup lattices are dismantlable.
We introduce and study the concept of cyclicity degree of a finite group $G$. This quantity measures the probability of a random subgroup of $G$ to be cyclic. Explicit formulas are obtained for some particular classes of finite groups. An…
The structure of groups for which certain sets of commutator subgroups are finite is investigated, with a particular focus on the relationship between these groups and those with finite derived subgroup.
In this short note, we describe finite groups all of whose non-trivial cyclic subgroups have the same Chermak-Delgado measure.
In this article we introduce and study a class of finite groups for which the orders of normal subgroups satisfy a certain inequality. It is closely connected to some well-known arithmetic classes of natural numbers.
Let $G$ be a finite group and let $c(G)$ be the number of cyclic subgroups of $G$. We study the function $\alpha(G) = c(G)/|G|$. We explore its basic properties and we point out a connection with the probability of commutation. For many…