ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let =(mi,j)\bm=(m_{i,j}) define M_\bm, let v_\bm be its distinguished cyclic vector, and let fαf_\alpha denote the commuting generators indexed by positive roots. Define S_\bm\subseteq{\mathbb Z}_{\ge0}^{n(n-1)/2} to consist of collections \bs=(sα)α>0\bs=(s_\alpha)_{\alpha>0} such that, for every Dyck path \bp\bp starting at αi\alpha_i and ending at αj\alpha_j,

∑β∈\bpsβ≤∑i≤k≤l≤jmk,l.\sum_{\beta\in\bp}s_\beta\le \sum_{i\le k\le l\le j}m_{k,l}.

Monomial basis conjecture. The elements

\{f^\bs v_\bm\mid \bs\in S_\bm\}

form a basis of M_\bm. This conjecture proposes an extension of the monomial basis known in the diagonal-support case to arbitrary multiplicity data \bm. It would give an explicit combinatorial basis for M_\bm and connect its dimension and structure with Dyck-path inequalities.

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.