Systems of PDEs Obtained from Factorization in Loop Groups

We propose a generalization of a Drinfeld–Sokolov scheme of attaching integrable systems of PDEs to affine Kac–Moody algebras. With every affine Kac–Moody algebra and a parabolic subalgebra , we associate two hierarchies of PDEs. One, called positive, is a generalization of the KdV hierarchy, the other, called negative, generalizes the Toda hierarchy. We prove a coordinatization theorem which establishes that the number of functions needed to express all PDEs of the the total hierarchy equals the rank of . The choice of functions, however, is shown to depend in a noncanonical way on . We employ a version of the Birkhoff decomposition and a 2-loop formulation which allows us to incorporate geometrically meaningful solutions to those hierarchies. We illustrate our formalism for positive hierarchies with a generalization of the Boussinesq system and for the negative hierarchies with the stationary Bogoyavlenskii equation.     

Flat orbits and kernels of irreducible representations of the group algebra of a completely solvable Lie group

We show that the kernel of an irreducible unitary representation π of the group algebra L¹(G) of a completely solvable Lie group G is given by the functions, whose abelian Fourier transform vanish on the Kirillov orbit Oπ of π if and only if this orbit Oπ is flat. This is a generalization of a result obtained before for nilpotent Lie groups.     

On the Implementation of Lie Group Methods on the Stiefel Manifold

There are several applications in which one needs to integrate a system of ODEs whose solution is an n×p matrix with orthonormal columns. In recent papers algorithms of arithmetic complexity order np ² have been proposed. The class of Lie group integrators may seem like a worth while alternative for this class of problems, but it has not been clear how to implement such methods with O(np ²) complexity. In this paper we show how Lie group methods can be implemented in a computationally competitive way, by exploiting that analytic functions of n×n matrices of rank 2p can be computed with O(np ²) complexity.