Related papers: Algorithmically distinguishing irreducible charact…

A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…

Given a finite group $G$ and an irreducible complex character $\chi$ of $G$, the codegree of $\chi$ is defined as the integer ${\rm cod}(\chi)=|G:\ker\chi|/\chi(1)$. It was conjectured by G. Qian in [13] that, for every element $g$ of $G$,…

The branching theorem expresses irreducible character values for the symmetric group $S_n$ in terms of those for $S_{n-1}$, but it gives the values only at elements of $S_n$ having a fixed point. We extend the theorem by providing a…

If $G$ is a finite classical group, linear or unitary in any characteristic, and orthogonal in odd characteristic, we give an approximate formula for $\chi(g)$ in which the error term is much smaller than the estimate, when $g\in G$ is an…

We generalize Regev's result on a virtual character of $S_n$. Suppose that $\lambda$ and $\mu$ are integer partitions of $n$. For the associated irreducible character $\chi^\lambda$ of $S_n$, when $\chi^\lambda(\mu)\neq0$ we find another…

Let $G$ be a finite $p$-group and $\chi,\psi$ be irreducible characters of $G$. We study the character $\chi\psi$ when $\chi\psi$ has at most $p-1$ distinct irreducible constituents.

We prove that deciding the vanishing of the character of the symmetric group is $C_=P$-complete. We use this hardness result to prove that the the square of the character is not contained in $\#P$, unless the polynomial hierarchy collapses…

We introduce two vertex operators to realize skew odd orthogonal characters $so_{\lambda/\mu}(x^{\pm})$ and derive the Cauchy identity for the skew characters via Toeplitz-Hankel-type determinant similar to the Schur functions. The method…

In \cite{[CZ]}, Cohen and Zemel showed that for a partition $\lambda \vdash k$, the dimension of the irreducible representation of $S_{n}$ corresponding to the partition $(n-k,\lambda) \vdash n$ is a polynomial of degree $k$ in $n$, whose…

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

The multiplicities a_{lambda,mu} of simple modules L(mu) in the composition series of Kac modules V(lambda) for the Lie superalgebra gl(m/n) were described by Serganova, leading to her solution of the character problem for gl(m/n). In…

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.

Constructing $r$-th nonresidue over a finite field is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree $r^e$ (where $r$ is a prime) over a given finite field $\mathbb{F}_q$ of…

We consider whether given a simple, finite description of a group in the form of an algorithm, it is possible to algorithmically determine if the corresponding group has some specified property or not. When there is such an algorithm, we…

For every irreducible complex representation~$\pi_\lambda$ of the symmetric group~$\S_n$, we construct, in a canonical way, a so-called intrinsic hyperplane arrangement~$\A_{\lambda}$ in the space of~$\pi_\lambda$. This arrangement is a…

In the Element Distinctness problem, one is given an array $a_1,\dots, a_n$ of integers from $[poly(n)]$ and is tasked to decide if $\{a_i\}$ are mutually distinct. Beame, Clifford and Machmouchi (FOCS 2013) gave a low-space algorithm for…

Let $G$ be a finite group of odd order. We show that if $\chi$ is an irreducible primitive character of $G$ then for all primes $p$ dividing the order of $G$ there is a conjugacy class such that the $p-$part of $\chi(1)$ divides the size of…

Let n be a positive integer and let Sigma_n be the symmetric group of degree n. Let S^lambda be the Specht module for Sigma_n corresponding to a partition lambda of n, defined over a field F of odd characteristic. We find the indecomposable…

For an irreducible character $\chi$ of a finite group $G$, the codegree of $\chi$ is defined as $|G:\ker(\chi)|/\chi(1)$. In this paper, we determine finite nonsolvable groups with exactly three nonlinear irreducible character codegrees,…

If a group $G$ is $\pi$-separable, where $\pi$ is a set of primes, the set of irreducible characters $\operatorname{B}_{\pi}(G) \cup \operatorname{B}_{\pi'}(G)$ can be defined. In this paper, we prove that there are variants of some…