On seaweed subalgebras and meander graphs in type C
Abstract
In 2000, Dergachev and Kirillov introduced subalgebras of "seaweed type" in gl(n) and computed their index using certain graphs. In this article, those graphs are called type-A meander graphs. Then the subalgebras of seaweed type, or just "seaweeds", have been defined by Panyushev (2001) for arbitrary simple Lie algebras. Namely, if p1, p2⊂ g are parabolic subalgebras such that p1+ p2= g, then q= p1 p2 is a seaweed in g. A general algebraic formula for the index of seaweeds has been proposed by Tauvel and Yu (2004) and then proved by Joseph (2006). If p1 and p2 are "adapted" to a fixed triangular decomposition of g, then q is said to be standard. The number of standard seaweeds is finite. In this paper, elaborating on the "graphical" approach of Dergachev and Kirillov, we introduce the type-C meander graphs, i.e., the graphs associated with the standard seaweeds of sp(2n), and give a formula for the index in terms of these graphs. We also note that the very same graphs can be used in case of the odd orthogonal Lie algebras. We also provide several applications of our formula to the Frobenius seaweeds in sp(2n). In particular, using a natural partition of the set Fn of standard Frobenius seaweeds, we prove that \# Fn strictly increases for the passage from n to n+1. The similar monotonicity question is open for the standard Frobenius seaweeds in sl(n), even for the passage from n to n+2.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.