Related papers: Finite groups with coprime non-linear codegrees

Given a finite group $G$, we denote by $L(G)$ the subgroup lattice of $G$ and by ${\rm Isolated}(G)$ the set of isolated subgroups of $G$. In this note, we describe finite groups $G$ such that $|{\rm Isolated}(G)|=|L(G)|-k$, where…

Let $p$ be a prime. We classify the finite groups having exactly two irreducible $p$-Brauer characters of degree larger than one. The case, where the finite groups have orders not divisible by $p$, was done by P. P\'alfy in 1981.

A finite group $G$ is $normally ~monomial$ if all its irreducible characters are induced from linear characters of normal subgroups of $G$. In this paper, we determine all possible irreducible character degree sets of normally monomial…

Let $G$ be a finite group and ${\rm cd}(G)$ denote the set of complex irreducible character degrees of $G$. In this paper, we prove that if $G$ is a finite group and $H$ is an almost simple group with socle $H_{0}= \, ^{2}{\rm G}_{2}(q)$,…

In this note, we prove that for every integer $d\geq 2$ which is not a prime power, there exists a finite solvable group $G$ such that $d\mid |G|$, $\pi(G)=\pi(d)$ and $G$ has no subgroup of order $d$. We also introduce the CLT-degree of a…

Let ${\rm GK}(G)$ be the prime graph associated with a finite group $G$ and $D(G)$ be the degree pattern of $G$. A finite group $G$ is said to be $k$-fold OD-characterizable if there exist exactly $k$ non-isomorphic groups $H$ such that…

We describe an algorithm for computing Schur indices of irreducible characters of a finite group $G$, based on computations within $G$ and its subgroups and with their character tables. The algorithm has been implemented within \Magma\ and…

Suppose $C(G)$ denotes the set of all cyclic subgroups of a finite group $G$, and $\mathcal{O}_{2}(G)$ denotes the number of elements of order $2$ in $G$. In [Marius T., Finite groups with a certain number of cyclic subgroups. The American…

For a group $G$ and a character $\chi$ of $G$, let $c(\chi)$ denote the set of all irreducible characters of $G$, occurring in $\chi$. We prove that whenever $q\geq 8$, all non-trivial irreducible character $\chi$ of $\mathrm{PSL}_2(q)$…

Let $G$ be a finite group. The co-prime order graph of $G$ is the graph whose vertex set is $G$, and two distinct vertices $x,y$ are adjacent if gcd$(o(x),o(y))$ is either $1$ or a prime, where $o(x)$ and $o(y)$ are the orders of $x$ and…

Let G be a finite group and let Irr(G) be the set of all irreducible complex characters of G. Let cd(G) be the set of all character degrees of G and denote by \rho(G) the set of primes which divide some character degrees of G. The prime…

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 $p$-group, where $p$ is an odd prime number, $H$ be a subgroup of $G$ and $\theta\in \Irr(H)$ be an irreducible character of $H$. Assume also that $|G:H|=p^2$. Then the character $\theta^G$ of $ G$ induced by $\theta$ is…

In this work, we classify all finite groups such that for every field extension F of \mathbb{Q}, F is the field of values of at most 3 irreducible characters.

For a finite group $G$, let $\Delta(G)$ denote the character graph built on the set of degrees of the irreducible complex characters of $G$. In this paper, we determine the structure of all finite groups $G$ with $K_4$-free character graph…

We classify all finite groups $G$ which possesses an element $x\in G$ such that every irreducible character of $G$ takes a root of unity value at $x$.

Let $G$ be a finite group. Denoting by ${\rm{cd}}(G)$ the set of the degrees of the irreducible complex characters of $G$, we consider the {\it character degree graph} of $G$: this is the (simple, undirected) graph whose vertices are the…

Let $G$ be a finite group. The group pseudo-algebra of $G$ is defined as the multi-set $C(G)=\{(d,m_G(d))\mid d\in{\rm Cod}(G)\},$ where $m_G(d)$ is the number of irreducible characters of with codegree $d\in {\rm Cod}(G)$. We show that…

We present an explicit formula for subregular characters (i.e, irreducible finite-dimensional complex characters of submaximal degree) of the unitriangular group over a finite field of sufficiently large characteristic.

We obtain the codegree of a certain primitive character for a finite solvable group, and thereby give a negative answer to a question proposed by Moret\'o in \cite{Moreto}.