Related papers: Counting Centralizers of a Finite Group with an Ap…
Let S be a finite graph and G be the corresponding free partially commutative group. In this paper we study subgroups generated by vertices of the graph S, which we call canonical parabolic subgroups. A natural extension of the definition…
To classify the finite dimensional pointed Hopf algebras with $G= {\rm McL}$ we obtain the representatives of conjugacy classes of $G$ and all character tables of centralizers of these representatives by means of software {\rm GAP}.
Let $G$ be a finite $p$-group such that $x\Z(G) \subseteq x^G$ for all $x \in G- \Z(G)$, where $x^G$ denotes the conjugacy class of $x$ in $G$. Then $|G|$ divides $|\Aut(G)|$, where $\Aut(G)$ is the group of all automorphisms of $G$.
A p-group G is p-central if the central quotient has exponent p. We prove that for a subset of finite p-central p-groups, the order of the group G divides the order of Aut(G).
For any group G, let C(G) denote the set of centralizers of G. We say that a group G has n centralizers (G is a Cn-group) if |C(G)| = n. In this note, we prove that every finite Cn-group with n ? 21 is soluble and this estimate is sharp.…
The prime graph (or Gruenberg-Kegel graph) of a finite group $G$ is a familiar graph. In this paper first, we investigate the structure of the finite groups with a non-complete prime graph. Then we prove that every alternating group…
We study the Newton stratification of the adjoint quotient of a connected split reductive group G with simply connected derived group over the field F of formal Laurent series in one variable over the field of complex numbers. Our main…
A group $G$ is said to have restricted centralizers if for every $x\in G$ the centralizer $C_G(x)$ either is finite or has finite index in $G$. Shalev showed that a profinite group with restricted centralizers is virtually abelian. Here we…
This paper has two main parts. In the first part we develop an elementary coordinatization for any nilpotent group $G$ taking exponents in a binomial principal ideal domain (PID) $A$. In case that the additive group $A^+$ of $A$ is finitely…
We introduce a class of permutation centralizer algebras which underly the combinatorics of multi-matrix gauge invariant observables. One family of such non-commutative algebras is parametrised by two integers. Its Wedderburn-Artin…
Let $\Gamma$ be a graph with the adjacency matrix $A$. The energy of $\Gamma$ is the sum of the absolute values of the eigenvalues of $A$. In this article we compute the energies of the commuting graphs of some finite groups and discuss…
Centrality describes the importance of nodes in a graph and is modeled by various measures. Its global analogue, called centralization, is a general formula for calculating a graph-level centrality score based on the node-level centrality…
Given a group $G$, we write $g^G$ for the conjugacy class of $G$ containing the element $g$. A theorem of B. H. Neumann states that if $G$ is a group in which all conjugacy classes are finite with bounded size, then the commutator subgroup…
In this paper we compute common neighbourhood (abbreviated as CN) spectrum and energy of commuting conjugacy class graph of several families of finite non-abelian groups. As a consequence of our results we show that the commuting conjugacy…
Let G be a group. Two elements x and y in G are said to be in the same z-class if their centralizers in G are conjugate within G. In this paper, we prove that the number of z-classes in the group of upper triangular matrices is infinite…
The power graph of a group $G$ is the graph whose vertex set is $G$ and two distinct vertices are adjacent if one is a power of the other. This paper investigates the minimal separating sets of power graphs of finite groups. For power…
Given a finite group $G$, denote by $\Gamma(G)$ the simple undirected graph whose vertices are the distinct sizes of noncentral conjugacy classes of $G$, and set two vertices of $\Gamma(G)$ to be adjacent if and only if they are not coprime…
The solubility graph $\Gamma_S(G)$ associated with a finite group $G$ is a simple graph whose vertices are the elements of $G$, and there is an edge between two distinct vertices if and only if they generate a soluble subgroup. In this…
Let $G$ be a classical group defined over a finite field. We consider the following fundamental problems concerning conjugacy in $G$: 1. List a representative for each conjugacy class of $G$. 2. Given $x \in G$, describe the centralizer of…
In this paper, we initiate the study of spectrum of the commuting graphs of finite non-abelian groups. We first compute the spectrum of this graph for several classes of finite groups, in particular AC-groups. We show that the commuting…