ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn and pp be as in the descent algebra setting, let mathop{\Lambda}\nolimits^+_p(n) denote the indexing set of pp-regular partitions, and let Qn,pQ_{n,p} be the Ext quiver of the descent algebra Dn,F\mathscr{D}_{n,{F}}. For λ∈Λ+(n)\lambda\in\Lambda^+(n), write (λ,p)=1(\lambda,p)=1 if p∤λip\nmid\lambda_i for every i∈[1,ℓ(λ)]i\in[1,\ell(\lambda)], and write (λ,p)≠1(\lambda,p)\neq1 otherwise. Let Qn,∞Q_{n,\infty} be the corresponding characteristic-zero Ext quiver, and let ∼p\sim_p denote the equivalence relation used to identify the relevant labels. For vertices v,wv,w of a quiver QQ, let nv,wQn^Q_{v,w} be the number of arrows from vv to ww. Ext-quiver conjecture. For λ,μ∈Λp+(n)\lambda,\mu\in\Lambda^+_p(n), the following hold: if λ=μ\lambda=\mu, then nλ,λQn,p>0n^{Q_{n,p}}_{\lambda,\lambda}>0 if and only if (λ,p)≠1(\lambda,p)\neq1; if λ≠μ\lambda\neq\mu, there is an arrow λ→μ\lambda\to\mu in Qn,pQ_{n,p} if and only if there exist δ∼pλ\delta\sim_p\lambda and γ∼pμ\gamma\sim_p\mu such that there is an arrow δ→γ\delta\to\gamma in Qn,∞Q_{n,\infty}, and in this case nλ,μQn,p=1n^{Q_{n,p}}_{\lambda,\mu}=1. This conjecture predicts the complete pattern of loops and arrows in the Ext quiver of the descent algebra in characteristic pp from the characteristic-zero Ext quiver and the pp-equivalence classes.

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.