Towards an algorithmisation of the Dirac constraint formalism

Simple item page
dc.creatorGerdt, V.
dc.creatorKhvedelidze, A.
dc.creatorPalii, Yu.
dc.date2006-11-09
dc.date.accessioned2026-07-07T07:32:20Z
dc.date.available2026-07-07T07:32:20Z
dc.descriptionCentral issues of the Dirac constraint formalism are discussed in relation to the algorithmic methods of commutative algebra based on the Groebner basis techniques. For a wide class of finite dimensional polynomial degenerate Lagrangian systems, we describe an algorithmic scheme of computation of the complete set of constraints, their separation into subsets of first and second class constraints as well as the construction of a generator of local symmetry transformations. The proposed scheme is exemplified by considering the so-called light-cone Yang-Mills mechanics with an SU(2) gauge structure group.
dc.description15 pages, Proceedings of GIFT 2006, Cocroft Institute, Daresbury (UK), November 1-3, 2006
dc.identifierhttps://arxiv.org/abs/math-ph/0611021
dc.identifierhttp://arxiv.org/abs/math-ph/0611021
dc.identifierGlobal Integrability of Field Theories / Proceedings of GIFT 2006. J.Calmet, W.M.Seiler, R.W.Tucker (Eds.), Cocroft Institute, Daresbury (UK), 2006, pp. 135-154
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/119079
dc.subjectMathematical Physics
dc.subject13P10; 37J30; 70H45; 70G65
dc.titleTowards an algorithmisation of the Dirac constraint formalism
dc.typetext

Files

Collections

arXiv