ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Fq\mathbb{F}_q be a finite field with q>1q>1 elements, and let Nn,e(q)N_{n,e}(q) denote the number of irreducible characters of UTn(q)\mathrm{UT}_n(q) of degree qeq^e. For a positive integer ee and 1≤i≤2e1\leq i\leq 2e, define

ce,i=12+∣12+e−i∣.c_{e,i}=\frac{1}{2}+\left|\frac{1}{2}+e-i\right|.

Theorem 1 states that for e∈{1,…,8}e\in\{1,\dots,8\}, all integers n>2en>2e, and prime powers q>1q>1,

Nn,e(q)=qn−e−2∑i=12ece,i!e!fe,i(n−2e−1)(q−1)i,N_{n,e}(q)=q^{n-e-2}\sum_{i=1}^{2e}\frac{c_{e,i}!}{e!}f_{e,i}(n-2e-1)(q-1)^i,

where each fe,i(x)f_{e,i}(x) is a polynomial with nonnegative integer coefficients and ce,i!e!fe,i(x)\frac{c_{e,i}!}{e!}f_{e,i}(x) is a nonnegative integer for every nonnegative integer xx. Extended formula conjecture. The displayed theorem holds for every positive integer ee. The formula is verified in the paper only for e≤8e\leq 8; extending it to all positive ee is presented as a conjecture motivated by the observed polynomial pattern.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.