Related papers: On seaweed subalgebras and meander graphs in type …
By using a free monoid of operators on the set of compositions (resp. pairs of compositions), we establish in this paper a bijective correspondence between Frobenius standard parabolic (resp. seaweed) subalgebras and certain elements of…
Seaweed (biparabolic) subalgebras form a large and structurally rich class of subalgebras of simple Lie algebras. We determine their adjoint cohomology. If $\mathfrak{s}$ is an indecomposable seaweed subalgebra of a complex simple Lie…
A Lie algebra is Frobenius if it admits a linear functional F such that the Kirillov form F([x,y]) is non-degenerate. If g is the m-th maximal parabolic subalgebra P(n,m) of sl(n) this occurs precisely when (n,m) = 1. We define a "cyclic"…
A ($2k+1$)$-$dimensional contact Lie algebra is one which admits a one-form $\varphi$ such that $\varphi \wedge (d\varphi)^k\ne0$. Such algebras have index one, but this is not generally a sufficient condition. Here we show that index-one…
Let $\g$ be a simple Lie algebra of type A or C. We show that the coadjoint representation of any seaweed subalgebra of $\g$ has some properties similar to that of the adjoint representation of a reductive Lie algebra. Namely, a) the field…
We extend the set of known infinite families of Frobenius seaweed Lie subalgebras of $\mathfrak{sl}_{n}$ to include a family which is the first non-trivial general family containing algebras whose associated meanders have an arbitrarily…
In this article, we give a simple explicit construction of an affine slice for the coadjoint action of a certain class of biparabolic (also called seaweed) subalgebras of a semisimple Lie algebra over an algebraically closed field of…
Seaweed Lie algebras are a natural generalisation of parabolic subalgebras of reductive Lie algebras. The well-known Richardson Theorem says that the adjoint action of a parabolic group has a dense open orbit in the nilpotent radical of its…
An ultragraph gives rise to a labelled graph with some particular properties. In this paper we describe the algebras associated to such labelled graphs as groupoid algebras. More precisely, we show that the known groupoid algebra…
Let $\mathfrak q=Lie Q$ be an algebraic Lie algebra of index 1, i.e., a generic $Q$-orbit on $\mathfrak q^*$ has codimension 1. We show that the following conditions are equivalent: $\mathfrak q$ is contact; a generic $Q$-orbit on…
In 2018 Coll, Mayers, and Mayers conjectured that the $q$-series $( q, -q^3; q^4 )_\infty^{-1}$ is the generating function for a certain parity statistic related to the index of seaweed algebras. We prove this conjecture. Thanks to earlier…
Using the index theory of seaweed algebras, we explore various new integer partition statistics. We find relations to some well-known varieties of integer partitions as well as a surprising periodicity result.
Let $\mathfrak p$ be a proper parabolic subalgebra of a simple Lie algebra $\mathfrak g$. Writing $\mathfrak p=\mathfrak r\oplus \mathfrak m$, with $\mathfrak r$ being the Levi factor of $\mathfrak p$ and $\mathfrak m$ the nilpotent radical…
We study Lie algebroids from the point of view noncommutative geometry. More specifically, using ideas from deformation quantization, we use the PBW-theorem for Lie algebroids to construct a Fedosov-type resolution for the associated…
We prove a spectral theorem for bimodules in the context of graph C*-algebras. A bimodule over a suitable abelian algebra is determined by its spectrum (i.e., its groupoid partial order) iff it is generated by the Cuntz-Krieger partial…
We present a method for associating labeled directed graphs to finite-dimensional Lie algebras, thereby enabling rapid identification of key structural algebraic features. To formalize this approach, we introduce the concept of…
A graph $G$ is universal for a class of graphs $\mathcal{C}$, if, up to isomorphism, $G$ contains every graph in $\mathcal{C}$ as a subgraph. In 1978, Chung and Graham asked for the minimal number $s(n)$ of edges in a graph with $n$…
This paper proposes a new, visual method to study numerical semigroups and the Frobenius problem. The method is based on building a so-called reduction graph, whose nodes usually correspond to monogenic semigroups, and whose edges can have…
Graphs and various graph-like combinatorial structures, such as preorders and hypergraphs, are ubiquitous in programming. This paper focuses on representing graphs in a purely functional programming language like Haskell. There are several…
We show that some classical results on expander graphs imply growth results on normal subsets in finite simple groups. As one application, it is shown that given a nontrivial normal subset $ A $ of a finite simple group $ G $ of Lie type of…