Related papers: Constrained Hamiltonian Systems and Groebner Bases

Central 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…

In this paper we consider systems of partial (multidimensional) linear difference equations. Specifically, such systems arise in scientific computing under discretization of linear partial differential equations and in computational high…

The Hamiltonian description for a wide class of mechanical systems, having local symmetry transformations depending on time derivatives of the gauge parameters of arbitrary order, is constructed. The Poisson brackets of the Hamiltonian and…

The Dirac-Bergmann algorithm is a recipe for converting a theory with a singular Lagrangian into a constrained Hamiltonian system. Constrained Hamiltonian systems include gauge theories -- general relativity, electromagnetism, Yang Mills,…

Dirac algorithm allows to construct Hamiltonian systems for singular systems, and so contributing to its successful quantization. A drawback of this method is that the resulting quantized theory does not have manifest Lorentz invariance.…

First-class constraints constitute a potential obstacle to the computation of a Poisson bracket in Dirac's theory of constrained Hamiltonian systems. Using the pseudoinverse instead of the inverse of the matrix defined by the Poisson…

The Dirac-Bergmann algorithm for the Hamiltonian analysis of constrained systems is a nice and powerful tool, widely used for quantization and non-perturbative counting of degrees of freedom. However, certain aspects of its application to…

Cylindrical algebraic decomposition (CAD) is an important tool for working with polynomial systems, particularly quantifier elimination. However, it has complexity doubly exponential in the number of variables. The base algorithm can be…

The dynamical systems invariant under gauge transformations with higher order time derivatives of the gauge parameter are considered from the Hamiltonian point of view. We investigate the consequences of the basic requirements that the…

In the Dirac approach to the generalized Hamiltonian formalism, dynamical systems with first- and second-class constraints are investigated. The classification and separation of constraints into the first- and second-class ones are…

The method of constrained Hamiltonian systems can be used to reduce Fock modules. It is applied to the Virasoro algebra, where a possibly new realization is found.

In the study of alternative or extended theories of gravity, Dirac's Hamiltonian constraint algorithm is invaluable for enumerating the propagating modes and gauge symmetries. For gravity, this canonical approach is frequently applied as a…

We introduce the general polynomial algebras characterizing a class of higher order superintegrable systems that separate in Cartesian coordinates. The construction relies on underlying polynomial Heisenberg algebras and their defining…

In a Hamiltonian system with first class constraints observables can be defined as elements of a quotient Poisson bracket algebra. In the gauge fixing method observables form a quotient Dirac bracket algebra. We show that these two algebras…

Computing ground states of local Hamiltonians is a fundamental problem in condensed matter physics. We give the first randomized polynomial-time algorithm for finding ground states of gapped one-dimensional Hamiltonians: it outputs an…

The gauge symmetries of a general dynamical system can be systematically obtained following either a Hamiltonean or a Lagrangean approach. In the former case, these symmetries are generated, according to Dirac's conjecture, by the first…

We consider the problem of constrained motion along a conic path under a given external potential function. The model is described as a second-class system capturing the behavior of a certain class of specific quantum field theories. By…

The Hamiltonian treatment of constrained systems in $G\ddot{u}ler's$ formalism leads us to the total differential equations in many variables. These equations are integrable if the corresponding system of partial differential equations is a…

Given a parametric polynomial ideal I, the algorithm DISPGB, introduced by the author in 2002, builds up a binary tree describing a dichotomic discussion of the different reduced Groebner bases depending on the values of the parameters,…

The goal of this paper is to propose and discuss a practical way to implement the Dirac algorithm for constrained field models defined on spatial regions with boundaries. Our method is inspired in the geometric viewpoint developed by Gotay,…