Advanced Search

From the text: The aim of this work is to advertise an algorithmic treatment of the computation of the cohomologies of semisimple Lie algebras. The base is Kostant’s result which describes the representation of the proper reductive subalgebra on the cohomologies space. We show how to (algorithmically) compute the highest weights of irreducible components of this representation using the Dynkin diagrams. The software package $LiE$ offers the data structures and corresponding procedures for computing...

For commuting linear operators $P_0,P_1,\cdots ,P_{\ell }$ we describe a range of conditions which are weaker than invertibility. When any of these conditions hold we may study the composition $P=P_0{P}_1\cdots P_{\ell }$ in terms of the component operators or combinations thereof. In particular the general inhomogeneous problem $Pu=f$ reduces to a system of simpler problems. These problems capture the structure of the solution and range spaces and, if the operators involved are differential, then this gives an effective way of lowering the differential...

A regular normal parabolic geometry of type $G/P$ on a manifold $M$ gives rise to sequences $D_i$ of invariant differential operators, known as the curved version of the BGG resolution. These sequences are constructed from the normal covariant derivative ${\nabla }^{\omega }$ on the corresponding tractor bundle $V$, where $\omega$ is the normal Cartan connection. The first operator $D_0$ in the sequence is overdetermined and it is well known that ${\nabla }^{\omega }$ yields the prolongation of this operator in the homogeneous case $M=G/P$. Our first main result...