Related papers: Generating sets of finite groups

For a group $G$, the generating graph $\Gamma(G)$ is defined as the graph with the vertex set $G$, and any two distinct vertices of $\Gamma(G)$ are adjacent if they generate $G$. In this paper, we study the generating graph of $D_n,$ where…

A {\it graph product} $G$ on a graph $\Gamma$ is a group defined as follows: For each vertex $v$ of $\Gamma$ there is a corresponding non-trivial group $G_v$. The group $G$ is the quotient of the free product of the $G_v$ by the commutation…

The rank of a finite semigroup is the smallest number of elements required to generate the semigroup. A formula is given for the rank of an arbitrary (non necessarily regular) Rees matrix semigroup over a group. The formula is expressed in…

We explore transversals of finite index subgroups of finitely generated groups. We show that when $H$ is a subgroup of a rank $n$ group $G$ and $H$ has index at least $n$ in $G$ then we can construct a left transversal for $H$ which…

The residual finiteness growth $\text{RF}_G: \mathbb{N} \to \mathbb{N}$ of a finitely generated group $G$ is a function that gives the smallest value of the index $[G:N]$ with $N$ a normal subgroup not containing a non-trivial element $g$,…

The equivalence (or weak equivalence) classes of orientation-preserving free actions of a finite group G on an orientable 3-dimensional handlebody of genus g can be enumerated in terms of sets of generators of G. They correspond to the…

An algorithm is constructed that, when given an explicit presentation of a finitely generated nilpotent group $G,$ decides for any pair of endomorphisms $\varphi, \psi : G \to G$ and any pair of elements $u, v \in G,$ whether or not the…

The aim of this paper is to compare and contrast the class of residually finite groups with the class of equationally Noetherian groups - groups over which every system of coefficient-free equations is equivalent to a finite subsystem. It…

The purpose of the article is to provide an unified way to formulate zero-sum invariants. Let $G$ be a finite additive abelian group. Let $B(G)$ denote the set consisting of all nonempty zero-sum sequences over G. For $\Omega \subset B(G$),…

Let $\Gamma(G)$ be the Gruenberg-Kegel graph of a finite group $G$. We prove that if $G$ is solvable and $\sigma$ is a cut-set for $\Gamma(G)$, then $G$ has a $\sigma$-series of length $5$ whose factors are controlled. As a consequence, we…

Let $G$ be a periodic group, and let $LCM(G)$ be the set of all $x\in G$ such that $o(x^nz)$ divides the least common multiple of $o(x^n)$ and $o(z)$ for all $z$ in $G$ and all integers $n$. In this paper, we prove that the subgroup…

In the paper we characterize the class of finite solvable groups by two-variable identities in a way similar to the characterization of finite nilpotent groups by Engel identities. More precisely, a sequence of words $u_1,...,u_n,... $ is…

We study the realization problem of finite groups as the group of homotopy classes of self-homotopy equivalences of finite spaces. Let $G$ be a finite group. Using an infinite family of pairwise non weakly homotopic asymmetric spaces we…

The enhanced power graph of a finite group $G$, denoted by $\mathcal{P}_E(G)$, is the simple undirected graph whose vertex set is $G$ and two distinct vertices $x, y$ are adjacent if $x, y \in \langle z \rangle$ for some $z \in G$. In this…

The following theorem is proved: Let $G$ be a finite group and $\pi_e(G)$ be the set of element orders in $G$. If $\pi_e(G) \cap \{2\}=\emptyset$; or $\pi_e(G) \cap \{3, 4\}=\emptyset$; or $\pi_e(G) \cap \{3,5\}=\emptyset$, then $G$ is…

This paper proposes a new approach to deriving a finite particle content, suitable for the construction of a gauge theory. Specifically, the outlined construction generates a finite set of irreducible gauge representations, which are…

Denote by $G$ a finite group and by $\psi(G)$ the sum of element orders in $G$. If $t$ is a positive integer, denote by $C_t$ the cyclic group of order $t$ and write $\psi(t)=\psi(C_t)$. In this paper we proved the following Theorem A: Let…

We consider the graph $\Gamma_{\rm{virt}}(G)$ whose vertices are the elements of a finitely generated profinite group $G$ and where two vertices $x$ and $y$ are adjacent if and only if they topologically generate an open subgroup of $G$. We…

The diameter of a finite group $G$ with respect to a generating set $A$ is the smallest non-negative integer $n$ such that every element of $G$ can be written as a product of at most $n$ elements of $A \cup A^{-1}$. We denote this invariant…

In this paper we define Ordered Generating System for finite non-abelian groups, which is a generalization of the basis theorem for finite abelian groups. We prove the following: If each composition factor of a group G has Ordered…