ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let rr and nn be fixed, and let u,muotinPn(r) u,mu otin P_n^{(r)} label indecomposable projective modules of Pn(r){\mathcal P}^{(r)}_n. Write μ=(μ0;μˉ)\mu=(\mu_0;\bar\mu), where μ0\mu_0 is divisible by rr and μˉ=(μ1,…,μp)\bar\mu=(\mu_1,\ldots,\mu_p). For a permutation Iˉ\bar I of μˉ\bar\mu, let τ=Std⁡(Iˉ)\tau=\operatorname{Std}(\bar I) be its standardization.

Cartan invariant conjecture. The Cartan invariant

dim(eν(r)∗Pn(r)∗eμ(r)){\rm dim}\bigl(e^{(r)}_\nu * {\mathcal P}^{(r)}_n * e^{(r)}_\mu\bigr)

is the number of permutations Iˉ\bar I of μˉ\bar\mu for which the following algorithm produces νˉ\bar\nu: compute τ=Std⁡(Iˉ)\tau=\operatorname{Std}(\bar I); replace the elements of the cycles of τ\tau by the corresponding values in Iˉ\bar I; take the sums of the values in each cycle, discarding those that are multiples of rr; and reorder the remaining sums to obtain the partition νˉ\bar\nu.

This conjecture gives a combinatorial description of the Cartan invariants of the higher order peak algebra in terms of permutations and cycle standardization. The preceding discussion identifies the relevant indecomposable projective modules and their dimensions, but the stated formula for the Cartan invariant is not established here.

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.