paper

On seaweed subalgebras and meander graphs in type D

arXiv:1702.07879 · doi:10.1016/j.jpaa.2017.12.015

Abstract

In 2000, Dergachev and Kirillov introduced subalgebras of "seaweed type" in and computed their index using certain graphs, which we call type- meander graphs. Then the subalgebras of seaweed type, or just "seaweeds", have been defined by Panyushev (2001) for arbitrary reductive Lie algebras. Recently, a meander graph approach to computing the index in types and has been developed by the authors. In this article, we consider the most difficult and interesting case of type . Some new phenomena occurring here are related to the fact that the Dynkin diagram has a branching node.

23 pages

References in corpus (2)

Cited by in corpus (3)