ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let B0B_0 be the principal block, let Λλ\Lambda_\lambda and Γˉλ\bar{\Gamma}_\lambda be the poset and graph subsets defined by the algorithm, and let d(μ,λ)d(\mu,\lambda) be the grading distance. The notation [L(λ):Δ(μ)](v)[L(\lambda):\Delta(\mu)](v) denotes the graded decomposition number. Inverse decomposition-matrix conjecture. The algorithm constructs the inverse of the vv-decomposition matrix of B0B_0:

[L(λ):Δ(μ)](v)=(−1)d(μ,λ)vd(μ,λ)[L(\lambda):\Delta(\mu)](v)=(-1)^{d(\mu,\lambda)}v^{d(\mu,\lambda)}

if μ∈Γˉλ\mu\in\bar{\Gamma}_\lambda, and it is 00 otherwise. This is conjectured for the standards in the minimal BGG resolution Δ∙→L(λ)→0\Delta_\bullet\to L(\lambda)\to0 produced by the algorithm.

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.