pith. sign in

arxiv: 0903.1791 · v1 · pith:3JJ2L3IDnew · submitted 2009-03-10 · 🧮 math-ph · math.MP

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

classification 🧮 math-ph math.MP
keywords fieldalgorithmconstraintpresymplectictheoriesapplicationformalismformulation
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.