Codimension-one connectedness conjecture for associated graphs
Codimension-one connectedness conjecture for associated graphs
Let be an irreducible Harish-Chandra -module, and let
be the irreducible decomposition of its associated variety. The graph has these irreducible components as vertices, with edges inherited from the orbit graph: two vertices are joined when the intersection of their closures contains a nilpotent -orbit of codimension one. Codimension-one connectedness conjecture. The graph is connected. Equivalently, for every pair , there is a sequence
such that, for , contains a nilpotent -orbit of codimension one. The conjecture concerns the codimension-one connectedness of irreducible components of associated varieties of Harish-Chandra modules. Vogan's theorem shows that the boundary of each component has codimension one when the associated variety is reducible, but the boundary may have components that do not connect distinct -orbits. The general connectedness assertion remains open, and the source allows to be disconnected.
Sources & referencesView supporting material
Primary source
Kyo Nishiyama, Peter Trapa and Akihito Wachi, “Codimension one connectedness of the graph of associated varieties”, arXiv:1403.7982 (2014).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.