Related papers: McKay graphs for alternating and classical groups

Babai's conjecture states that, for any finite simple non-abelian group $G$, the diameter of $G$ is bounded by $(\log|G|)^{C}$ for some absolute constant $C$. We prove that, for any untwisted classical group $G$ of rank $r$ defined over a…

Let $G$ be a finite group and let $\mathcal{M}$ be a set of maximal subgroups of $G$. We say that $\mathcal{M}$ is irredundant if the intersection of the subgroups in $\mathcal{M}$ is not equal to the intersection of any proper subset. The…

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…

A connected undirected graph is called \emph{geodetic} if for every pair of vertices there is a unique shortest path connecting them. It has been conjectured that for finite groups, the only geodetic Cayley graphs are odd cycles and…

We present new infinite families of expander graphs of vertex degree 4, which is the minimal possible degree for Cayley graph expanders. Our first family defines a tower of coverings (with covering indices equals 2) and our second family is…

Let $\Gamma$ be the fundamental group of a finite connected graph $\mathcal G$. Let $\mathfrak M$ be an abelian group. A {\it distribution} on the boundary $\partial\Delta$ of the universal covering tree $\Delta$ is an $\mathfrak M$-valued…

According to McKay (1980) the irreducible characters of finite subgroups of SU(2) are in a natural 1-1 correspondence with the extended Coxeter-Dynkin graphs of type ADE. We show that the character values themselves can be given by an…

The intersection graph $\Delta_G$ of a finite group $G$ is a simple graph with vertices the non-trivial proper subgroups of $G$, and an edge between two vertices if their corresponding subgroups intersect non-trivially. These graphs were…

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…

A Mumford group is a discontinuous subgroup $\Gamma$ of PGL(2,K), where K denotes a non archimedean valued field, such that the quotient by $\Gamma$ is a curve of genus 0. As abstract group $\Gamma$ is an amalgam of a finite tree of finite…

This paper computes the irreducible characters of the alternating Hecke algebras, which are deformations of the group algebras of the alternating groups. More precisely, we compute the values of the irreducible characters of the semisimple…

Let $G$ be a (finite or infinite) group such that $G/Z(G)$ is not simple. The non-commuting, non-generating graph $\Xi(G)$ of $G$ has vertex set $G \setminus Z(G)$, with vertices $x$ and $y$ adjacent whenever $[x,y] \ne 1$ and $\langle x, y…

We establish for the matrix group $G=\mathrm{SL}_{n}\left(\mathbb{F}_{p}\right)$ that there exist absolute constants $c\in\left(0,1\right)$ and $C>0$ such that any symmetric generating set $A$, with $\left|A\right|\geq\left|G\right|^{1-c}$…

In this paper we consider finite groups G satisfying the following condition: G has two columns in its character table which differ by exactly one entry. It turns out that such groups exist and they are exactly the finite groups with a…

Let $F$ and $G$ be simple finite undirected graphs. A graph $G$ is called $F$-irregular if any two of its distinct vertices belong to different numbers of copies of $F$ in $G$. According to the strong conjecture about $F$-irregular graphs…

For a finite group $G$, we define the inclusion graph of subgroups of $G$, denoted by $\mathcal I(G)$, is a graph having all the proper subgroups of $G$ as its vertices and two distinct vertices $H$ and $K$ in $\mathcal I(G)$ are adjacent…

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…

The aim of the article is to show that there are many finite extensions of arithmetic groups which are not residually finite. Suppose $G$ is a simple algebraic group over the rational numbers satisfying both strong approximation, and the…

Given a strict partial order $\Delta$ on a set $\Lambda$ and an arbitrary ring $R$ with $1\neq 0$, the corresponding McLain group $M(\Delta)$ has been studied in depth. We construct a larger family of McLain groups $G(\Delta)$, where…

We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…