Related papers: Prime simplicial complexes of finite groups

For each prime p, we exhibit pairs of p-groups all of whose integral cohomology groups are isomorphic. The method used involves very little calculation. The groups are exhibited as kernels of homomorphisms from a compact Lie group G to…

Simplicial arrangements are classical objects in discrete geometry. Their classification remains an open problem but there is a list conjectured to be complete at least for rank three. A further important class in the theory of hyperplane…

In a finite group $ G $, $ \psi(G) $ denotes the sum of element orders of $ G $. A finite group $ G $ is said to be a $\mathscr{B}_{\psi}$-group if $ \psi(H) < |G| $ for any proper subgroup $ H $ of $ G $. In \cite{Lazorec} Lazorec asked:…

The critical group of a finite graph is an abelian group defined by the Smith normal form of the Laplacian. We determine the the critical groups of the Peisert graphs, a certain family of strongly regular graphs similar to, but different…

Let $G$ be a finite group and, for a prime $p$, let $S$ be a Sylow $p$-subgroup of $G$. A character $\chi$ of $G$ is called $\Syl_p$-regular if the restriction of $\chi$ to $S$ is the character of the regular representation of $S$. If, in…

The prime coprime graph $\Theta(G)$ of a finite group $G$ is the graph whose vertex set is $G$ and any two distinct vertices are adjacent if the greatest common divisor of their orders is either $1$ or a prime. In this paper, we investigate…

The degree pattern of a finite group is the degree sequence of its prime graph in ascending order of vertices. We say that the problem of OD-characterization is solved for a finite group if we determine the number of pairwise nonisomorphic…

Given a finite group $G$, the \emph{Prime Order Element (POE) Graph} $\Gamma(G)$ consists of the group elements as the vertices, and two vertices $x$ and $y$ are adjacent if and only if $o(xy)$ is prime. This paper presents a thorough…

A $p$-subgroup $H$ of a finite group $G$ is said to satisfy partial $S$-$\Pi$-property in $G$ if $G$ has a chief series $\Gamma_{G}: 1=G_{0}<G_{1}<\cdots<G_{n}=G$ such that for every $G$-chief factor $G_{i}/G_{i-1}$ $(1\leqslant i\leqslant…

Minimal prime graphs (MPGs) are a special class of prime graphs (also known as Gruenberg-Kegel graphs) associated with finite solvable groups. A graph is an MPG if it has at least two vertices, is connected, its complement is triangle-free…

The prime graph of a finite group $G$, which is denoted by ${\rm GK}(G)$, is a simple graph whose vertex set is comprised of the prime divisors of $|G|$ and two distinct prime divisors $p$ and $q$ are joined by an edge if and only if there…

The genus spectrum of a finite group $G$ is the set of all $g$ such that $G$ acts faithfully on a compact Riemann surface of genus $g$. It is an open problem to find a general description of the genus spectrum of the groups in interesting…

Let C be an integral fusion category. We study some graphs, called the prime graph and the common divisor graph, related to the Frobenius-Perron dimensions of simple objects in the category C, that extend the corresponding graphs associated…

Let $G$ be a finite group. The solubility graph associated with the finite group $G$, denoted by $\Gamma_{\cal S}(G)$, is a simple graph whose vertices are the non-trivial elements of $G$, and there is an edge between two distinct elements…

In this article we generalize a classical result by Passman on primeness of unital strongly group graded rings to the class of nearly epsilon-strongly group graded rings which are not necessarily unital. Using this result, we obtain (i) a…

A finite group $G$ is called Cayley integral if all undirected Cayley graphs over $G$ are integral, i.e., all eigenvalues of the graphs are integers. The Cayley integral groups have been determined by Kloster and Sander in the abelian case,…

Let $\pi$ be a set of primes such that $|\pi|\geqslant 2$ and $\pi$ differs from the set of all primes. Denote by $r$ the smallest prime which does not belong to $\pi$ and set $m=r$ if $r=2,3$ and $m=r-1$ if $r\geqslant 5$. We study the…

We determine for which known finite simple groups $G$ and which primes $p$ the $p$-fusion system of $G$ is simple. This means first collecting together the results that were already known (and correcting two errors made in an earlier study…

Let $G$ be a finite group. The bipartite divisor graph for the set of irreducible complex character degrees is the undirected graph with vertex set consisting of the prime numbers dividing some character degree and of the non-identity…

Let $G$ be a finite group, $S\subseteq G\setminus\{1\}$ be a set such that if $a\in S$, then $a^{-1}\in S$, where $1$ denotes the identity element of $G$. The undirected Cayley graph $Cay(G,S)$ of $G$ over the set $S$ is the graph whose…