Elliptic Sklyanin integrable systems for arbitrary reductive groups

Mathematics – Algebraic Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Minor changes, 89 pages, Latex

Scientific paper

We present the analogue, for an arbitrary complex reductive group G, of the elliptic integrable systems of Sklyanin. The Sklyanin integrable systems were originally constructed on symplectic leaves, of a quadratic Poisson structure, on a loop group of type A. The phase space, of our integrable systems, is a group-like analogue of the Hitchin system over an elliptic curve E. We consider the moduli space of pairs (P,f), where P is a principal G-bundle on E, and f is a meromorphic section of the adjoint group bundle. We show: 1) The moduli space admits an algebraic Poisson structure. It is related to the poisson structures on loop groupoids, constructed by Etingof and Varchenko, using Felder's elliptic solutions of the Classical Dynamical Yang-Baxter Equation. 2) The symplectic leaves are finite dimensional. A symplectic leaf is determined by labeling, finitely many points of E, each by a dominant co-character of the maximal torus of G. 3) Each leaf is an algebraically completely integrable system.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Elliptic Sklyanin integrable systems for arbitrary reductive groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Elliptic Sklyanin integrable systems for arbitrary reductive groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Elliptic Sklyanin integrable systems for arbitrary reductive groups will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-335766

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.