Statement of the Alexandru Conjecture
Pierre-Yves Gaillard
Abstract
The Vogan Conjectures (sometimes called Kazhdan-Lusztig Conjectures) say that a certain algorithm works both on the category of BGG modules and on the category of Harish-Chandra modules. The Alexandru Conjecture tries to uncover the general property common to these two categories which makes Vogan's algorithm work.
Create a lesson
Related papers
Universally extendible characters
Benjamin Sambale
Gaudin from Cherednik
Matthew McMillan
Uniqueness of twisted linear periods over Archimedean division algebras
Yufeng Li, Junyan Xiao
Symplectic extension graphs and Ribet's lemma
Aniruddha Sudarshan
Index for a mutation loop
Tsukasa Ishibashi, Yuji Terashima
Minimal presentations of finite-dimensional representations of pseudocompact algebras
Christof Geiss, Carolin Hartung, Daniel Labardini-Fragoso et al.