cp's OEIS Frontend

The index of a Lie algebra, g, is an invariant of the Lie algebra defined by min(dim(Ker(B_f)) where the min is taken over all linear functionals f on g and B_f denotes the bilinear form f([,]) were [,] denotes the bracket multiplication on g.

For seaweed subalgebras of sl(n), which are Lie subalgebras of sl(n) whose matrix representations are parametrized by an ordered pair of compositions of n, the index can be determined from a corresponding graph called a meander.

a(n)>0 for n>2. To see this: if n=k+1 take the partition (k,1).

The index of a Lie algebra, g, is an invariant of the Lie algebra defined by min(dim(Ker(B_f)) where the min is taken over all linear functionals f on g and B_f denotes the bilinear form f([,]) were [,] denotes the bracket multiplication on g.

For seaweed subalgebras of sl(n), which are Lie subalgebras of sl(n) whose matrix representations are parametrized by an ordered pair of compositions of n, the index can be determined from a corresponding graph called a meander.

a(n) > 0 for n = 3, 4 and n > 5. To see this: for n odd if n=3 take the partition (1,1,1), if n > 5 take the partition (2,...,2,1,1,1,1,1); for n > 2 congruent to 2 (mod 6), say n=6k+2, take the partition (2k,1,...,1) with 4k+2 1's; for n > 0 congruent to 4 (mod 6), say n=6k+4, take the partition (2k+1, 1,...,1) with 4k+3 1's; for n > 0 congruent to 0 (mod 6), say n=6k, take the partition (2k, 2k, 2k-1, 1).

The index of a Lie algebra, g, is an invariant of the Lie algebra defined by min(dim(Ker(B_f)) where the min is taken over all linear functionals f on g and B_f denotes the bilinear form f([,]) were [,] denotes the bracket multiplication on g.

For seaweed subalgebras of sl(n), which are Lie subalgebras of sl(n) whose matrix representations are parametrized by an ordered pair of compositions of n, the index can be determined from a corresponding graph called a meander.

a(n)>0 for n=4 and n>5. To see this: for n>0 congruent to 0 (mod 4), say 4k+4, take the partition of the form (2k+3,2k+1); for n congruent to 2 (mod 4) if n=6 take (4,4,1), if n=10 take (5,3,2), if n>10, say n=4k+10, take the partition (2k+7,2k-1,1,1,1,1); for n>1 congruent to 1 (mod 6), say n=6k+1, take the partition (2k+3,2k-1,2k-1); for n>5 congruent to 5 (mod 6), say n=6k+5, take the partition (2k+3,2k+3,2k-1); for n>3 congruent to 3 (mod 6), say n=6k-3, take the partition (2k+1,2,...,2) with 2k-2 2's.