Related papers: On the multiplicities of the character codegrees

Let $G$ be a finite group, $p$ a prime, and $IBr_p(G)$ the set of irreducible $p$-Brauer characters of $G$. Let $\bar e_p(G)$ be the largest integer such that $p^{\bar e_p(G)}$ divides $\chi(1)$ for some $\chi \in IBr_p(G)$. We show that…

Let $F(G)$ and $b(G)$ respectively denote the Fitting subgroup and the largest degree of an irreducible complex character of a finite group $G$. A well-known conjecture of D. Gluck claims that if $G$ is solvable then $|G:F(G)|\leq…

The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…

Given a finite group $G$, we study the monomial algebra $R_G$, generated by the monomial characters of $G$. In particular, we note that the integral closure of $R_G$ is contained in the algebra generated by those characters $\chi$ for which…

Given two 3-uniform hypergraphs F and G, we say that G has an F-covering if we can cover V(G) by copies of F. The minimum codegree of G is the largest integer d such that every pair of vertices from V(G) is contained in at least d triples…

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…

If $G$ is a group and $S$ a generating set, $G$ canonically embeds into the automorphism group of its Cayley graph and it is natural to try to minimize, over all generating sets, the index of this inclusion. This infimum is called the…

A code $C \subseteq \{0, 1, 2\}^n$ of length $n$ is called trifferent if for any three distinct elements of $C$ there exists a coordinate in which they all differ. By $T(n)$ we denote the maximum cardinality of trifferent codes with length.…

We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding of this group in the inverse limit of the (free) fundamental…

We classify, in terms of the structure of the finite group G, all group algebras KG for which all right ideals are right annihilators of principal left ideals. This means in the language of coding theory that we classify code-checkable…

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 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…

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…

Let $q$ be a power of a prime $p$, $G$ be a finite abelian group, where $p$ does not divide $|G|$,and let $n$ be a positive integer. In this paper we find a formula for the number of irreducible representations of $G$ of a given dimension…

A conjugacy class $C$ of a finite group $G$ is a sign conjugacy class if every irreducible character of $G$ takes value 0, 1 or -1 on $C$. In this paper we classify the sign conjugacy classes of alternating groups.

Let $U_n$ denote the group of upper $n \times n$ unitriangular matrices over a fixed finite field $\mathbb{F}$ of order $q$. That is, $U_n$ consists of upper triangular $n \times n$ matrices having every diagonal entry equal to $1$. It is…

A finite group is said to be $n$-cyclic if it contains $n$ cyclic subgroups. For a finite group $G$, the ratio of the number of cyclic subgroups to the number of subgroups is known as the cyclicity degree of the group $G$ and is denoted by…

Let G be a finite group and 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 whose socle is a sporadic simple group H0 such that cd(G) =…

Given a sequence ${\bf g}: g_0,\ldots, g_{m}$, in a finite group $G$ with $g_0=1_G$, let ${\bf \bar g}: \bar g_0,\ldots, \bar g_{m}$, be the sequence defined by $\bar g_0=1_G$ and $\bar g_i=g_{i-1}^{-1}g_i$ for $1\leq i \leq m$. We say that…

Let $G$ be a finite group, and let $\mathrm{Irr}(G)$ denote the set of irreducible complex characters of $G$. An element $x$ of $G$ is said to be vanishing, if for some $\chi$ in $\mathrm{Irr}(G)$, we have $\chi(x)=0$. Also the element $x$…