Related papers: On minimal non-$CL$-groups

We introduce L-presentations: group presentations given by a generating set, a set of relations and a set of substitution rules on the generating set producing more relations. We first study in full generality the structure of finitely…

Let $\sigma=\{\sigma_j\,:\, j\in J\}$ be a partition of the set $\mathbb{P}$ of all prime numbers. A subgroup $X$ of a finite group $G$ is~\textit{$\sigma$-subnormal} in $G$ if there exists a chain of subgroups $$X=X_0\leq X_1\leq\ldots\leq…

For every non-nilpotent finite group $G$, there exists at least one proper subgroup $M$ such that $G$ is the setwise product of a finite number of conjugates of $M$. We define $\gamma_{\text{cp}}\left( G\right) $ to be the smallest number…

A proper subgroup $H$ of a group $G$ is said to be: $\Bbb{P}$-subnormal in $G$ if there exists a chain of subgroups $H=H_0 < H_1< ... < H_{n}=G$ such that $|H_{i}:H_{i-1}|$ is a prime for $i=1,...,n$; $\Bbb{P}$-abnormal in $G$ if for every…

This paper introduces the cyclic subfactors, generalizing the cyclic groups as the subfactors generalize the groups, and generalizing the natural numbers as the maximal subfactors generalize the prime numbers. On one hand, a theorem of O.…

We show that if G is a finite group then no chain of modular elements in its subgroup lattice L(G) is longer than a chief series. Also, we show that if G is a nonsolvable finite group then every maximal chain in L(G) has length at least two…

For a finite group G with subgroup H the Chermak-Delgado measure of H in G refer to the product of the order of H with the order of its centralizer, C_G(H). The set of all subgroups with maximal Chermak-Delgado measure form a sublattice,…

Following Isaacs (see [Isa08, p. 94]), we call a normal subgroup N of a finite group G large, if $C_G(N) \leq N$, so that N has bounded index in G. Our principal aim here is to establish some general results for systematically producing…

An $f$-subgroup is a linear recurring sequence subgroup, a multiplicative subgroup of a field whose elements can be generated (without repetition) by a linear recurrence relation, with characteristic polynomial $f$. It is called…

A group $G$ is said to have dense solitary subgroups if each non-empty open interval in its subgroup lattice $L(G)$ contains a solitary subgroup. In this short note, we find all finite groups satisfying this property.

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…

In 1904, Issai Schur proved the following result. If $G$ is an arbitrary group such that $G/\Z(G)$ is finite, where $\Z(G)$ denotes the center of the group $G$, then the commutator subgroup of $G$ is finite. A partial converse of this…

Finite groups are said to be isospectral if they have the same sets of element orders. A finite nonabelian simple group $L$ is said to be almost recognizable by spectrum if every finite group isospectral to $L$ is an almost simple group…

In this note, we prove that for every integer $d\geq 2$ which is not a prime power, there exists a finite solvable group $G$ such that $d\mid |G|$, $\pi(G)=\pi(d)$ and $G$ has no subgroup of order $d$. We also introduce the CLT-degree of a…

Let $A$ and $G$ be finite groups such that $A$ acts coprimely on $G$ by automorphisms, we first prove some results on the solvability of finite groups in which some maximal $A$-invariant subgroups have indices a prime or the square of a…

We consider the lattice of subsemigroups of the general linear group over an Artinian ring containing the group of diagonal matrices and show that every such semigroup is actually a group.

An unrefinable chain of a finite group $G$ is a chain of subgroups $G = G_0 > G_1 > \cdots > G_t = 1$, where each $G_i$ is a maximal subgroup of $G_{i-1}$. The length (respectively, depth) of $G$ is the maximal (respectively, minimal)…

Consider a nonsolvable finite group G, where R(G) represents the solvable radical of G. For any element x in G, the solvabilizer of x in G, denoted by Sol_G(x), is defined as the set of all elements y in G such that the subgroup generated…

A group $G$ is invariably generated (IG) if there is a subset $S \subseteq G$ such that for every subset $S' \subseteq G$, obtained from $S$ by replacing each element with a conjugate, $S'$ generates $G$. $G$ is finitely invariably…

A lattice $L$ is said lowly finite if the set $[\mathsf{0},a]$ is finite for every element $a$ of $L$. We mainly aim to provide a complete proof that, if $M$ is a subset of a complete lowly finite distributive lattice $L$ containing its…