Related papers: Orientable regular maps with Euler characteristic …

We give explicit computations of the $\Gamma$-Euler characteristic of several families of orbit space definable translation groupoids. These include the translation groupoids associated to finite-dimensional linear representations of the…

Let $G$ be a finite simple group of Lie type and let $P$ be a Sylow $2$-subgroup of $G$. In this paper, we prove that for any nontrivial element $x \in G$, there exists $g \in G$ such that $G = \langle P, x^g \rangle$. By combining this…

We determine the extent to which the collection of $\Gamma$-Euler-Satake characteristics classify closed 2-orbifolds. In particular, we show that the closed, connected, effective, orientable 2-orbifolds are classified by the collection of…

The congruence subgroups $\Gamma_1(m,p)$ that we consider here are subgroups of $GL_m(\Z)$ that fix the vector $(0,\dots,0,1) \mod p$, where $p\geq 5$ is a prime. We present a method and many computations of homological Euler…

Given a group $G$, an {\em $m$-Cayley digraph $\G$ over $G$} is a digraph that has a group of automorphisms isomorphic to $G$ acting semiregularly on the vertex set with $m$ orbits. We say that $G$ admits an {\em oriented $m$-semiregular…

If $f(p, n)$ is the number of pairwise nonisomorphic groups of order $p^n$, and $g(p,n)$ is the number of groups of order $p^n$ whose automorphism group is a $p$-group, then, for $n \leq 7$, we prove that the ratio $g(p,n)/f (p,n)$ is…

In this paper, generalized Cayley graphs are studied. It is proved that every generalized Cayley graph of order 2p is a Cayley graph, where p is a prime. Special attention is given to generalized Cayley graphs on Abelian groups. It is…

Let $G$ be a finite group, and $\alpha$ a nontrivial character of $G$. The McKay graph ${\mathcal M}(G,\alpha)$ has the irreducible characters of $G$ as vertices, with an edge from $\chi_1$ to $\chi_2$ if $\chi_2$ is a constituent of…

Let $P$ be a principal indecomposable module of a finite group $G$ in characteristic $2$ and let $\varphi$ be the Brauer character of the corresponding simple $G$-module. We show that $P$ affords a non-degenerate $G$-invariant quadratic…

The Gruenberg-Kegel graph $\Gamma(G)$ associated with a finite group $G$ has as vertices the prime divisors of $|G|$, with an edge from $p$ to $q$ if and only if $G$ contains an element of order $pq$. This graph has been the subject of much…

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 $G$ be a group. The \emph{power graph} of $G$ is a graph with the vertex set $G$, having an edge between two elements whenever one is a power of the other. We characterize nilpotent groups whose power graphs have finite independence…

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…

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…

Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set…

It has been proved in \cite{ge} for every $p$-group of order $p^n$, $|\mathcal{M}(G)|=p^{\f{1}{2}n(n-1)-t(G)}$, where $t(G)\geq 0$. In \cite{be, el, zh}, the structure of $G$ has been characterized for $t(G)=0,1,2,3$ by several authors.…

We determine all factorisations $X=AB$, where $X$ is a finite almost simple group and $A,B$ are core-free subgroups such that $A\cap B$ is cyclic or dihedral. As a main application, we classify the graphs $\Gamma$ admitting an almost simple…

Euler graphs are characterized by the simple criterion that degree of each node is even. By restricting on the cycle types yet additional intrinsic properties of Euler graphs are unveiled. For example, regularity higher than degree two is…

The prime graph of a finite group $G$ is the labelled graph $\Gamma(G)$ with vertices the prime divisors of $|G|$ and edges the pairs $\{p,q\}$ for which $G$ contains an element of order $pq$. A group $G$ is recognisable by its prime graph…

We prove that the sign of the Euler characteristic of arithmetic groups with CSP is determined by the profinite completion. In contrast, we construct examples showing that this is not true for the Euler characteristic itself and that the…