Constraint algorithm for k-presymplectic Hamiltonian systems. Application to singular field theories

Physics – Mathematical Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

22 pp

Scientific paper

The k-symplectic formulation of field theories is especially simple, since only tangent and cotangent bundles are needed in its description. Its defining elements show a close relationship with those in the symplectic formulation of mechanics. It will be shown that this relationship also stands in the presymplectic case. In a natural way, one can mimick the presymplectic constraint algorithm to obtain a constraint algorithm that can be applied to $k$-presymplectic field theory, and more particularly to the Lagrangian and Hamiltonian formulations of field theories defined by a singular Lagrangian, as well as to the unified Lagrangian-Hamiltonian formalism (Skinner--Rusk formalism) for k-presymplectic field theory. Two examples of application of the algorithm are also analyzed.

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

Constraint algorithm for k-presymplectic Hamiltonian systems. Application to singular field theories 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 Constraint algorithm for k-presymplectic Hamiltonian systems. Application to singular field theories, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constraint algorithm for k-presymplectic Hamiltonian systems. Application to singular field theories will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-187389

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