Related papers: Constrained Hamiltonian Systems and Groebner Bases
Let $\K$ be a field of characteristic zero and $\Kbar$ be an algebraic closure of $\K$. Consider a sequence of polynomials$G=(g\_1,\dots,g\_s)$ in $\K[X\_1,\dots,X\_n]$, a polynomial matrix $\F=[f\_{i,j}] \in \K[X\_1,\dots,X\_n]^{p \times…
Using Dirac's approach to constrained dynamics, the Hamiltonian formulation of regular higher order Lagrangians is developed. The conventional description of such systems due to Ostrogradsky is recovered. However, unlike the latter, the…
The systematic method for the conversion of first class constraints to the equivalent set of Abelian one based on the Dirac equivalence transformation is developed. The representation for the corresponding matrix performing this…
There has been increasing interest in methodologies that incorporate physics priors into neural network architectures to enhance their modeling capabilities. A family of these methodologies that has gained traction are Hamiltonian neural…
We discuss a general prototypical constrained Hamiltonian system with a broad application in quantum field theory and similar contexts where dynamics is defined through a functional action obeying a stationarity principle. The prototypical…
Motivated by the Hamilton$-$Jacobi approach of fields with constraints, we analyse the classical structure of three different constrained field systems: (i) the scalar field coupled to two flavors of fermions through Yukawa couplings (ii)…
We propose a variant formulation of Hamiltonian systems by the use of variables including redundant degrees of freedom. We show that Hamiltonian systems can be described by extended dynamics whose master equation is the Nambu equation or…
The nonholonomic constrained system with second-class constraints is investigated using the Hamilton-Jacobi (HJ) quantization scheme to yield the complete equations of motion of the system. Although the integrability conditions in the HJ…
We consider the problem of computing critical points of the restriction of a polynomial map to an algebraic variety. This is of first importance since the global minimum of such a map is reached at a critical point. Thus, these points…
Long-term stability studies of nonlinear Hamiltonian systems require symplectic integration algorithms which are both fast and accurate. In this paper, we study a symplectic integration method wherein the symplectic map representing the…
We describe an algorithm for determining the algebraic subgroup of GL(n,C) that is defined as the closure of the group generated by a finite number of elements of GL(n,C). The algorithm avoids the use of Groebner bases and can be used on…
A (deterministic) polynomial-time algorithm is proposed for approximating the ground state of (general) one-dimensional gapped Hamiltonians. Let $\epsilon,n,\eta$ be the energy gap, the system size, and the desired precision, respectively.…
This is the continuation of Montes' paper "On the canonical discussion of polynomial systems with parameters". In this paper we define the Minimal Canonical Comprehensive Groebner System (MCCGS) of a parametric ideal and fix under which…
An approach to compatibility analysis of systems of discrete relations is proposed. Unlike the Groebner basis technique, the proposed scheme is not based on the polynomial ring structure. It uses more primitive set-theoretic and topological…
The recently modified Faddeev-Jackiw formalism for systems having one chain of four levels of only second-class constraints is applied to the non-trivial a=1 bosonized chiral Schwinger model in (1+1) dimensions as well as to one mechanical…
Although conservative Hamiltonian systems with constraints can be formulated in terms of Dirac structures, a more general framework is necessary to cover also dissipative systems such as gradient and metriplectic systems with constraints.…
Constrained Hamiltonian systems are investigated by using the Hamilton-Jacobi method. Integration of a set of equations of motion and the action function is discussed. It is shown that we have two types of integrable systems: a) ${\it…
In this paper, for a variety of nonholonomic (reducible) Hamiltonian systems, we first give to various distributional Hamiltonian systems, by analyzing carefully the dynamics and structures of the nonholonomic Hamiltonian systems. Secondly,…
Cylindrical Algebraic Decomposition (CAD) is a key tool in computational algebraic geometry, particularly for quantifier elimination over real-closed fields. However, it can be expensive, with worst case complexity doubly exponential in the…
In this paper, a polynomial-time algorithm is given to compute the generalized Hermite normal form for a matrix F over Z[x], or equivalently, the reduced Groebner basis of the Z[x]-module generated by the column vectors of F. The algorithm…