Related papers: On perfect order subsets in finite groups

An element e of an ordered semigroup $(S,\cdot,\leq)$ is called an ordered idempotent if $e\leq e^2$. We call an ordered semigroup $S$ idempotent ordered semigroup if every element of $S$ is an ordered idempotent. Every idempotent semigroup…

Let $G$ be a group. A subset $D$ of $G$ is a determining set of $G$, if every automorphism of $G$ is uniquely determined by its action on $D$. The determining number of $G$, denoted by $\alpha(G)$, is the cardinality of a smallest…

A finite group $G$ is called monomial if every irreducible character of $G$ is induced from a linear character of some subgroup of $G$. One of the main questions regarding monomial groups is whether or not a normal subgroup $N$ of a…

We study the groups $G$ with the curious property that there exists an element $k\in G$ and a function $f\colon G\to G$ such that $f(xk)=xf(x)$ holds for all $x\in G$. This property arose from the study of near-rings and input-output…

A finite group of order divisible by 3 in which centralizers of 3-elements are 3-subgroups will be called a C{\theta}{\theta}-group. The prime graph (or Gruenberg-Kegel graph) of a finite group G is denoted by {\Gamma}(G) (or GK(G)) and its…

We consider a finite group $G$ with a normal subgroup $N$ so that all elements of $G \setminus N$ have prime power order. We prove that if there is a prime $p$ so that all the elements in $G \setminus N$ have $p$-power order, then either…

Let $\Gamma$ be an undirected and simple graph. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components each containing a cycle. If $\Gamma$ has a…

Denote the sum of element orders in a finite group $G$ by $\psi(G)$ and let $C_n$ denote the cyclic group of order $n$. Suppose that $G$ is a non-cyclic finite group of order $n$ and $q$ is the least prime divisor of $n$. We proved that…

Denote by $G$ a finite group and let $\psi(G)$ denote the sum of element orders in $G$. In 2009, H.Amiri, S.M.Jafarian Amiri and I.M.Isaacs proved that if $|G|=n$ and $G$ is non-cyclic, then $\psi(G)<\psi(C_n)$, where $C_n$ denotes the…

If X is a non-empty subset of a finite group G, we denote by o(x) the order of x in G. Then we put The number o(X) is called the average order of X. Zapirain in 2011 , posed the following question: Let G be a finite (p-) group and N a…

A finite ranked poset is called a symmetric chain order if it can be written as a disjoint union of rank-symmetric, saturated chains. If $P$ is any symmetric chain order, we prove that $P^n/\mathbb{Z}_n$ is also a symmetric chain order,…

A subgroup $H$ of a finite group $G$ is said to be an $\mathscr{H}C$-subgroup of $G$ if there exists a normal subgroup $T$ of $G$ such that $G=HT$ and $H^g \cap N_T(H)\leq H$ for all $g\in G$. In this paper, we investigate the structure of…

A group $G$ is integrable if it is isomorphic to the derived subgroup of a group $H$; that is, if $H'\simeq G$, and in this case $H$ is an integral of $G$. If $G$ is a subgroup of $U$, we say that $G$ is integrable within $U$ if $G=H'$ for…

Considering a finite group $G$, for any element $x\in G$, the solvabilizer of $x$ in $G$ is defined as $Sol_G(x)=\{y \in G : \langle x, y \rangle \text{ is solvable}\}$. In this paper, we introduce $Solv(G)$ as the number of distinct…

In this note we provide some counterexamples for the conjectures of finite simple groups, one of the conjectures said "all finite simple groups $G$ can be determined using their orders $|G|$ and the number of elements of order $p$, where…

Let $o(G)$ be the average order of a finite group $G$. We show that if $o(G)<c$, where $c\in \lbrace \frac{13}{6}, \frac{11}{4}\rbrace$, then $G$ is an elementary abelian 2-group or a solvable group, respectively. Also, we prove that the…

All possible products of all elements of an odd order finite group are considered. A set of all such products is called as a K-set. A hypothesis of K-set coincidence of any group of an odd order with its commutant is proposed and the…

Let R be a commutative ring with unity, M a module over R and let S be a G-set for a finite group G. We define a set MS to be the set of elements expressed as the formal finite sum of the form similar to the elements of group ring RG. The…

Suppose $C(G)$ denotes the set of all cyclic subgroups of a finite group $G$, and $\mathcal{O}_{2}(G)$ denotes the number of elements of order $2$ in $G$. In [Marius T., Finite groups with a certain number of cyclic subgroups. The American…

The spectrum $\omega(G)$ of a finite group $G$ is the set of orders of elements of $G$. We present a polynomial-time algorithm that, given a finite set $\mathcal M$ of positive integers, outputs either an empty set or a finite simple group…