Related papers: Combinatorial methods of character enumeration for…

We describe a cluster algebra algorithm for calculating q-characters of Kirillov-Reshetikhin modules for any untwisted quantum affine algebra. This yields a geometric q-character formula for tensor products of Kirillov-Reshetikhin modules.…

The convolution of indicators of two conjugacy classes on the symmetric group S_q is usually a complicated linear combination of indicators of many conjugacy classes. Similarly, a product of the moments of the Jucys--Murphy element involves…

We study the number of prime polynomials of degree $n$ over $\mathbb{F}_q$ in which the $i^{th}$ coefficient is either preassigned to be $a_i \in \mathbb{F}_q$ or outside a small set $S_i \subset \mathbb{F}_q$. This serves as a function…

In 2012, for any integer $n \ge 2$, Kedlaya constructed an infinite class of monic irreducible polynomials of degree $n$ with integer coefficients having squarefree discriminants. Such polynomials are necessarily monogenic. Further, by…

The present work stemmed from the study of the problem of harmonic analysis on the infinite-dimensional unitary group U(\infty). That problem consisted in the decomposition of a certain 4-parameter family of unitary representations, which…

We show that, for all positive integers $n_1, \ldots, n_m$, $n_{m+1}=n_1$, and any non-negative integers $j$ and $r$ with $j\leqslant m$, the expression $$ \frac{1}{[n_1]}{n_1+n_{m}\brack n_1}^{-1}…

We give an $AB$-factorization of the supercharacter table of the group of $n\times n$ unipotent upper triangular matrices over $\FF_q$, where $A$ is a lower-triangular matrix with entries in $\ZZ[q]$ and $B$ is a unipotent upper-triangular…

We consider the quantum complexity of estimating matrix elements of unitary irreducible representations of groups. For several finite groups including the symmetric group, quantum Fourier transforms yield efficient solutions to this…

In 2013, Pak and Panova proved the strict unimodality property of $q$-binomial coefficients $\binom{\ell+m}{m}_q$ (as polynomials in $q$) based on the combinatorics of Young tableaux and the semigroup property of Kronecker coefficients.…

Let $D_n(x;a)$ and $E_n(x;a)\in\mathbb F_q[x]$ be Dickson polynomials of first and second kind respectively, where $\mathbb F_q$ is a finite field with $q$ elements. In this article we show explicitly the irreducible factors these…

We investigate the computational complexity of deciding whether a given univariate integer polynomial p(x) has a factor q(x) satisfying specific additional constraints. When the only constraint imposed on q(x) is to have a degree smaller…

We study the representations of the quantum Galilei group by a suitable generalization of the Kirillov method on spaces of non commutative functions. On these spaces we determine a quasi-invariant measure with respect to the action of the…

For a fixed polynomial $\Delta$, we study the number of polynomials $f$ of degree $n$ over $\mathbb F_q$ such that $f$ and $f+\Delta$ are both irreducible, an $\mathbb F_q[T]$-analogue of the twin primes problem. In the large-$q$ limit, we…

We compute the l-modular decomposition matrices of the simple Ree groups 2F4(q^2), where q^2=2^{2n+1} and n is a positive integer, for all primes l > 3 up to some entries in the unipotent characters. Using these matrices we determine the…

We present a strong upper bound on the number k(B) of irreducible characters of a p-block B of a finite group G in terms of local invariants. More precisely, the bound depends on a chosen major B-subsection (u,b), its normalizer N_G(\langle…

The generalized Kazhdan-Lusztig polynomials for the finite dimensional irreducible representations of the general linear superalgebra are computed explicitly. Using the result we establish a one to one correspondence between the set of…

We show how the character tables of the groups $E_6(q)_{\text{ad}}$ and ${^2\!E}_6(q)_{\text{ad}}$ can be constructed, where $q$ is a power of~$2$. (Partial results are also obtained for any $q$ not divisible by~$3$.) This is based on…

Together with David Schlang we computed the discriminants of the invariant Hermitian forms for all indicator $o$ even degree absolutely irreducible characters of the ATLAS groups supplementing the tables of orthogonal determinants computed…

We demonstrate, using character sum arguments, the existence of primitive polynomials of degree n over a finite field GF(q) with the coefficients for x^(n-1), x^(n-2), and x^(n-3) prescribed, so long as char(GF(q)) is at least 5 and n is at…

In this paper we give a detailed analysis of deterministic and randomized algorithms that enumerate any number of irreducible polynomials of degree $n$ over a finite field and their roots in the extension field in quasilinear where $N=n^2$…