Related papers: Character codegrees of maximal class p-groups

We establish new bounds on character values and character ratios for finite groups $G$ of Lie type, which are considerably stronger than previously known bounds, and which are best possible in many cases. These bounds have the form…

Let g be the Lie superalgebra p(3) of rank 2 over an algebraically closed field K of characteristic p > 3. We classify all irreducible modules of g, and give the character formulae for irreducible modules.

Given a graphic degree sequence $D$, let $\chi(D)$ (respectively $\omega(D)$, $h(D)$, and $H(D)$) denote the maximum value of the chromatic number (respectively, the size of the largest clique, largest clique subdivision, and largest clique…

Let $q$ be a power of a prime $p$ and let $G$ be a completely reducible subgroup of $\mathrm{GL}(d,q)$. We prove that the number of composition factors of $G$ that have prime order $p$ is at most $(\varepsilon_q d-1)/(p-1)$, where…

We classify all finite groups such that all irreducible character degrees appear with multiplicity at most $2$. As a consequence, we prove that the largest group with at most $2$ irreducible characters of the same degree is the Baby…

For a graph $G$ whose degree sequence is $d_{1},..., d_{n}$, and for a positive integer $p$, let $e_{p}(G)=\sum_{i=1}^{n}d_{i}^{p}$. For a fixed graph $H$, let $t_{p}(n,H)$ denote the maximum value of $e_{p}(G)$ taken over all graphs with…

Let $q$ be an odd prime power, $n > 1$, and let $P$ denote a maximal parabolic subgroup of $GL_n(q)$ with Levi subgroup $GL_{n-1}(q) \times GL_1(q)$. We restrict the odd-degree irreducible characters of $GL_n(q)$ to $P$ to discover a…

Let $G=(V,E)$ be a graph and $p$ a positive integer. A subset $S\subseteq V$ is called a $p$-dominating set of $G$ if every vertex not in $S$ has at least $p$ neighbors in $S$. The $p$-domination number is the minimum cardinality of a…

Let \(G\) be a finite group, and let \(\Delta(G)\) denote the \emph{prime graph} built on the set of degrees of the irreducible complex characters of \(G\). It is well known that, whenever \(\Delta(G)\) is connected, the diameter of…

We describe an easy way how to find supercharacter theories for a finite group, if its character table is known. Namely, we show how an arbitrary partition of the conjugacy classes or of the irreducible characters can be refined to the…

Let $G$ be a nonabelian finite group and let $d$ be an irreducible character degree of $G$. Then there is a positive integer $e$ so that $|G| = d(d+e)$. Snyder has shown that if $e > 1$, then $|G|$ is bounded by a function of $e$. This…

We study the solvable groups $G$ that have an irreducible character $\chi\in \Irr(G)$ such that $\chi \bar{\chi}$ has at most two non-principal irreducible constituents.

The greatest power of a prime $p$ dividing the natural number $n$ will be denoted by $n_p$. Let $Ind_G(g)=|G:C_G(g)|$. Suppose that $G$ is a finite group and $p$ is a prime. We prove that if there exists an integer $\alpha>0$ such that…

We define the position of an irreducible complex character of a finite group as an alternative to the degree. We then use this to define three classes of groups: PR-groups, IPR-groups and weak IPR-groups. We show that IPR-groups and weak…

We consider the structure of finite $p$-groups $G$ having precisely three characteristic subgroups, namely $1$, $\Phi(G)$ and $G$. The structure of $G$ varies markedly depending on whether $G$ has exponent $p$ or $p^2$, and, in both cases,…

Let $p$ be a prime number and suppose that every maximal subgroup of a finite group is either $p$-nilpotent or has prime index. Such group need not be $p$-solvable, and we study its structure by proving that only one nonabelian simple group…

The characters $\chi(\pi)$ of $S_n$ that depend only on the number of cycles of $\pi$ are completely determined.

We determine an upper bound for the size of a stem $p$-group in terms of its breadth and its maximum character degree.

We prove that the maximal dimension of a $p$-central subspace of the generic symbol $p$-algebra of prime degree $p$ is $p+1$. We do it by proving the following number theoretic fact: let $\{s_1,\dots,s_{p+1}\}$ be $p+1$ distinct nonzero…

We say a graph is $(d, d, \ldots, d, 0, \ldots, 0)$-colorable with $a$ of $d$'s and $b$ of $0$'s if $V(G)$ may be partitioned into $b$ independent sets $O_1,O_2,\ldots,O_b$ and $a$ sets $D_1, D_2,\ldots, D_a$ whose induced graphs have…