相关论文: On groups with square-free gcd of character degree…

Let $G$ be a finite Chevalley group. We are concerned with computing the values of the unipotent characters of $G$ by making use of Lusztig's theory of character sheaves. In this framework, one has to find the transformation between several…

If $n>4$ and $c(\theta)$ denotes the set of irreducible constituents of a character $\theta$, then $c(\chi^k)={\rm Irr}(S_n)$ for all nonlinear $\chi\in {\rm Irr}(S_n)$ if and only if $k\geq n-1$.

Let $q$ be a prime power, and $d$ a positive integer. We study the proportion of irreducible characters of $\mathrm{GL}(n,q)$ whose values evaluated on a fixed matrix $g$ are divisible by $d$. As $n$ approaches infinity, this proportion…

Let $G$ be a graph with maximum degree $\Delta$ and without isolated vertices. An edge colouring $c$ of $G$ is conflict-free if the closed neighbourhood of every edge includes a uniquely coloured element. The least number of colours…

We obtain a necessary condition for the character degree graph of a solvable group G to be Eulerian.

In this paper we prove that decomposable forms, or homogeneous polynomials $F(x_1, \cdots, x_n)$ with integer coefficients which split completely into linear factors over $\mathbb{C}$, take on infinitely many square-free values subject to…

Let $\F_q$ be a field of characteristic $p$ with $q$ elements. It is known that the degrees of the irreducible characters of the Sylow $p$-subgroup of $GL_n(\F_q)$ are powers of $q$ by Issacs. On the other hand Sangroniz showed that this is…

The prime-coprime graph $\Theta(G)$ of a finite group $G$ is the simple graph with vertex set $G$, where two distinct elements are adjacent whenever the greatest common divisor of their orders is either $1$ or a prime. We characterize all…

A finite or infinite word is called a $G$-word for a labelled graph $G$ on the vertex set $A_n = \{0,1,..., n-1\}$ if $w = i_1i_2...i_k \in A_n^*$, where each factor $i_ji_{j+1}$ is an edge of $E$, i.e, $w$ represents a walk in $G$. We show…

Let G be a finite abelian group and F a field such that char(F) does not divide |G|. Denote by FG the group algebra of G over F. A (semisimple) abelian code is an ideal of FG. Two codes I and J of FG are G-equivalent if there exists an…

Let $U(q)$ be a Sylow $p$-subgroup of the Chevalley groups $D_4(q)$ where $q$ is a power of a prime $p$. We describe a construction of all complex irreducible characters of $U(q)$ and obtain a classification of these irreducible characters…

Let $p$ be a prime divisor of the order of a finite group $G$. Then $G$ has at least $2 \sqrt{p-1}$ complex irreducible characters of degrees prime to $p$. In case $p$ is a prime with $\sqrt{p-1}$ an integer this bound is sharp for…

The problem of finding the largest finite group with a certain class number (number of conjugacy classes), $k(G)$, has been investigated by a number of researchers since the early 1900's and has been solved by computer for $k(G) \leq 9$.…

For a graph $G$, $\chi(G)$ will denote its chromatic number, and $\omega(G)$ its clique number. A graph $G$ is said to be perfectly divisible if for all induced subgraphs $H$ of $G$, $V(H)$ can be partitioned into two sets $A$, $B$ such…

We parametrize the set of irreducible characters of the Sylow $p$-subgroups of the Chevalley groups $\mathrm{D}_6(q)$ and $\mathrm{E}_6(q)$, for an arbitrary power $q$ of any prime $p$. In particular, we establish that the parametrization…

We prove that for any finite group G, the sum across non-identity elements of the squared absolute value of any generalized character of G which does not vanish on all non-identity elements of G is at least |G|/d -1, where d is the maximal…

In this paper, we introduce the generic circular triangle-free graph $\mathbb C_3$ and propose a finite axiomatization of its first order theory. In particular, our main results show that a countable graph $G$ embeds into $\mathbb C_3$ if…

We are interested in determining the bound of the average of the degrees of the irreducible characters whose degrees are not divisible by some prime $p$ that guarantees a finite group $G$ of odd order is $p$-nilpotent. We find a bound that…

For a finite group $G$, the vertices of the prime graph $\Gamma(G)$ are the primes that divide $|G|$, and two vertices $p$ and $q$ are connected by an edge if and only if there is an element of order $pq$ in $G$. Prime graphs of solvable…

We show that finite quasisimple groups of Lie type in characteristic $p$ with an irreducible representation of prime degree $r$ over a finite field of characteristic $p$ have orders bounded above by a function of $r$, independent of $p$. We…