Related papers: Factorizations of groups of small order

A finite group $G$ is \emph{coprimely-invariably generated} if there exists a set of generators $\{g_1, ..., g_u\}$ of $G$ with the property that the orders $|g_1|, ..., |g_u|$ are pairwise coprime and that for all $x_1, ..., x_u \in G$ the…

For a finite group $G$, we define the inclusion graph of subgroups of $G$, denoted by $\mathcal I(G)$, is a graph having all the proper subgroups of $G$ as its vertices and two distinct vertices $H$ and $K$ in $\mathcal I(G)$ are adjacent…

We consider formal maps in any finite dimension $d$ with coefficients in an integral domain $K$ with identity. Those invertible under formal composition form a group $\mathcal{G}$. We consider the centraliser $C_g$ of an element…

Let $q$ be a power of a prime $p$ and let $G$ be a completely reducible subgroup of $\mathrm{GL}(d,q)$. We prove that the number of composition factors of $G$ that have prime order $p$ is at most $(\varepsilon_q d-1)/(p-1)$, where…

In this paper, we provide new criteria for the solvability and supersolvability of a finite group based on its number of cyclic subgroups. A finite group G is called n-cyclic if it contains n cyclic subgroups. This paper also partially…

A decomposition of a multigraph $G$ is a partition of its edges into subgraphs $G(1), \ldots , G(k)$. It is called an $r$-factorization if every $G(i)$ is $r$-regular and spanning. If $G$ is a subgraph of $H$, a decomposition of $G$ is said…

Let $o(G)$ be the average order of a finite group $G$. In this paper, we prove that if $o(G)<\frac{31}{12}$\,, then $G$ is supersolvable. Moreover, we have $o(G)=\frac{31}{12}$ if and only if $G\cong A_4$. We also classify finite groups $G$…

We determine the finite groups $G$ in which every subset $A \subseteq G$ of cardinality dividing the order of $G$ is a \emph{factor}, i.e. has a complement $B \subseteq G$ of cardinality $|G|/|A|$ such that $G = A \cdot B$ or $G = B \cdot…

We study the number of factorizations of a positive integer, where the parts of the factorization are of l different colors (or kinds). Recursive or explicit formulas are derived for the case of unordered and ordered, distinct and…

Let G be a reductive complex algebraic group and V a finite-dimensional G-module. From elements of the invariant algebra C[V]^G we obtain by polarization elements of C[kV]^G, where k\geq 1 and kV denotes the direct sum of k copies of V. For…

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…

In this paper we study a group G which is the quotient of a free product of three non-trivial groups by the normal closure of a single element. In particular we show that if the relator has length at most eight, then G is non-trivial. In…

Let $K:=\mathbb{Q}(G)$ be the number field generated by the complex character values of a finite group $G$. Let $\mathbb{Z}_K$ be the ring of integers of $K$. In this paper we investigate the suborder $\mathbb{Z}[G]$ of $\mathbb{Z}_K$…

The number of subgroups and the number of cyclic subgroups are natural combinatorial invariants of a finite group. We investigate how restrictions on these quantities, together with the number of distinct prime divisors of $|G|$, enforce…

Let K be a set of infinite cardinals such that the cardinality of K is the first strong limit cardinal greater than uncountably many strong limit cardinals. We construct a family of pairwise non-embeddable groups which contains 2^k groups…

We prove that all Mathieu groups, some linear, and unitary groups are factorizable.

Let $G$ be a group. The orbits of the natural action of $\mbox{Aut}(G)$ on $G$ are called "automorphism orbits" of $G$, and the number of automorphism orbits of $G$ is denoted by $\omega(G)$. In this paper the finite nonsolvable groups $G$…

Let $G$ be a finite group. Let $k(G)$ denote the number of conjugacy classes of $G$ and let $m(G)$ denote the least positive integer $n$ such that the union of any $n$ distinct non-trivial conjugacy classes of $G$ together with the identity…

It has been recently observed that fundamental aspects of the classical theory of factorization can be greatly generalized by combining the languages of monoids and preorders. This has led to various theorems on the existence of certain…

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…