Single-block generation conjecture for q-character polynomials
Statement
Let denote a unipotent Jordan block of size . For a partition , let be the unipotent Jordan matrix with block sizes specified by , and let be its associated statistic. Single-block generation conjecture. For every partition , there exists a polynomial of degree with coefficients in such that
Thus, the statistics associated with single Jordan blocks are conjectured to generate the entire ring of -character polynomials over ; the paper proves this for statistics associated with matrices having at most two Jordan blocks.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.