Related papers: Permutability degrees of finite groups

The commuting graph ${\Gamma(G)}$ of a group $G$ is the simple undirected graph with group elements as a vertex set and two elements $x$ and $y$ are adjacent if and only if $xy=yx$ in $G$. By eliminating the identity element of $G$ and all…

A subgroup Q is commensurated in a group G if each G conjugate of Q intersects Q in a group that has finite index in both Q and the conjugate. So commensurated subgroups are similar to normal subgroups. Semistability and simple connectivity…

Let $ G $ be a cyclic group, in this paper, we study the Herbrand quotient and $ 1-$th cohomology group on finitely generated $ G-$modules in some cases. When $ G $ is of order $ 2, $ the order of the cohomology group is explicitly related…

A permutoid is a set of partial permutations that contains the identity and is such that partial compositions, when defined, have at most one extension in the set. In 2004 Peter Cameron conjectured that there can exist no algorithm that…

In this paper we study the ratio between the number of $p$-elements and the order of a Sylow $p$-subgroup of a finite group $G$. As well known, this ratio is a positive integer and we conjecture that, for every group $G$, it is at least the…

Suppose that $G$ is a finite, transitive, solvable permutation group acting on a set $S$ with $n$ elements. Let $G_0$ be the stabilizer of a point $\alpha \in \Omega$. Define the rank of a permutation group, denoted $r(G),$ as the number of…

The Divisibility Graph of a finite group $G$ has vertex set the set of conjugacy class lengths of non-central elements in $G$ and two vertices are connected by an edge if one divides the other. We determine the connected components of the…

Let $G$ be a finite group and let $\tilde{G}$ be a Schur cover of $G$. The deep commuting graph $\Delta_D(G)$ of $G$ is a simple graph with vertex set $G$, where two distinct vertices are adjacent if their pre-images commute in $\tilde{G}$.…

Let G be a finite group. Denoting by cd(G) the set of degrees of the irreducible complex characters of G, we consider the character degree graph of G: this is the (simple undirected) graph whose vertices are the prime divisors of the…

In this paper we introduce and study the poset of equivalence classes of subgroups of a finite group $G$, induced by the isomorphism relation. This contains the well-known lattice of solitary subgroups of $G$. We prove that in several…

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…

Let $G$ be a finite group, and let ${\rm{cd}}(G)$ denote the set of degrees of the irreducible complex characters of $G$. Define then the character degree graph $\Delta(G)$ as the (simple undirected) graph whose vertices are the prime…

Double semigroups have two associative operations $\circ, \bullet$ related by the interchange relation: $( a \bullet b ) \circ ( c \bullet d ) \equiv ( a \circ c ) \bullet ( b \circ d )$. Kock \cite{Kock2007} (2007) discovered a…

Let $R$ be a finite ring. The commuting probability of $R$ is the probability that any two randomly chosen elements of $R$ commute. In this paper, we obtain some bounds for commuting probability of $R$.

Let $G$ be a finite group. The group pseudo-algebra of $G$ is defined as the multi-set $C(G)=\{(d,m_G(d))\mid d\in{\rm Cod}(G)\},$ where $m_G(d)$ is the number of irreducible characters of with codegree $d\in {\rm Cod}(G)$. We show that…

We show that the set of all commuting probabilities in finite rings is a subset of the set of all commuting probabilities in finite nilpotent groups of class $\le2$. We believe that these two sets are equal; we prove they are equal, when…

Let $G$ be a finite group. For a fixed element $g$ in $G$ and a given subgroup $H$ of $G$, the relative $g$-noncommuting graph of $G$ is a simple undirected graph whose vertex set is $G$ and two vertices $x$ and $y$ are adjacent if $x \in…

The minimal faithful permutation degree of a finite group G is the least non-negative integer n such that G embeds in the symmetric group Sym(n). Work of Johnson and Wright established conditions for when the minimal degree of a direct…

The line of investigation of the present paper goes back to a classical work of W. H. Gustafson of the 1973, in which it is described the probability that two randomly chosen group elements commute. In the same work, he gave some bounds for…

In this paper we show that there is an infinite number of finite groups with two relative subgroup commutativity degrees. Also, we indicate a sufficient condition such that a finite group has at least three relative subgroup commutativity…