Related papers: Constrained Hamiltonian Systems and Groebner Bases

We study the constrained Ostrogradski-Hamilton framework for the equations of motion provided by mechanical systems described by second-order derivative actions with a linear dependence in the accelerations. We stress out the peculiar…

Dynamical systems, described by Lagrangians with first- and second-class constraints, are investigated. In the Dirac approach to the generalized Hamiltonian formalism, the classification and separation of the first- and second-class…

In this work, we investigate a Lagrangian model describing a particle constrained to move along non-degenerate conic sections, parameterized by the orbital eccentricity \( e \). In the non-relativistic regime, we apply the Dirac--Bergmann…

Fermions are coupled to the Einstein-Cartan system in the canonical formulation, including the cosmological, the Barbero-Immirzi, and the non-minimal coupling constants. The resulting ten first-class constraints generate gauge…

We present our public-domain software for the following tasks in sparse (or toric) elimination theory, given a well-constrained polynomial system. First, C code for computing the mixed volume of the system. Second, Maple code for defining…

Let T(x) in k[x] be a monic non-constant polynomial and write R=k[x] / (T) the quotient ring. Consider two bivariate polynomials a(x, y), b(x, y) in R[y]. In a first part, T = p^e is assumed to be the power of an irreducible polynomial p. A…

We investigate finite-dimensional constrained structured optimization problems, featuring composite objective functions and set-membership constraints. Offering an expressive yet simple language, this problem class provides a modeling…

In a classical Hamiltonian theory with second class constraints the phase space functions on the constraint surface are observables. We give general formulas for extended observables, which are expressions representing the observables in…

This article makes the key observation that when using cylindrical algebraic decomposition (CAD) to solve a problem with respect to a set of polynomials, it is not always the signs of those polynomials that are of paramount importance but…

The image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric…

This paper focuses on the study of a mathematical program with equilibrium constraints, where the objective and the constraint functions are all polynomials. We present a method for finding its global minimizers and global minimum using a…

First-order probabilistic models combine representational power of first-order logic with graphical models. There is an ongoing effort to design lifted inference algorithms for first-order probabilistic models. We analyze lifted inference…

We provide two families of algorithms to compute characteristic polynomials of endomorphisms and norms of isogenies of Drinfeld modules. Our algorithms work for Drinfeld modules of any rank, defined over any base curve. When the base curve…

Here the polynomial interpolation approach is used to introduce the main results on multivariate normal algebraic systems. Next we bring a construction which shows that any standard algebraic system, with finite set of solutions, can be…

In Hamiltonian time-dependent mechanics, the Poisson bracket does not define dynamic equations, that implies the corresponding peculiarities of describing time-dependent holonomic constraints. As in conservative mechanics, one can consider…

We apply the Dirac procedure for constrained systems to the Arnowitt-Deser-Misner formalism linearized around the Friedmann-Lemaitre universe. We explain and employ some basic concepts such as Dirac observables, Dirac brackets, gauge-fixing…

We study Hamiltonian form of unfree gauge symmetry where the gauge parameters have to obey differential equations. We consider the general case such that the Dirac-Bergmann algorithm does not necessarily terminate at secondary constraints,…

We give a criterion for a collection of polynomials to be a universal Gr\"{o}bner basis for an ideal in terms of the multidegree of the closure of the corresponding affine variety in $(\mathbb{P}^1)^N$. This criterion can be used to give…

We consider a class of two dimensional dilatonic models, and revisit them from the perspective of a new set of "polar type" variables. These are motivated by recently defined variables within the spherically symmetric sector of 4D general…

We extend a previously successful discussion of the constrained Schr\"{o}dinger system through the Dirac--Bergmann algorithm to the case of the Dirac field. In order to follow the analogy, first we discuss the classical Dirac field as a…