Related papers: Constrained Hamiltonian Systems and Groebner Bases
We present several new algorithms for computing factorization invariant values over affine semigroups. In particular, we give (i) the first known algorithm to compute the delta set of any affine semigroup, (ii) an improved method of…
One of the biggest open problems in computational algebra is the design of efficient algorithms for Gr{\"o}bner basis computations that take into account the sparsity of the input polynomials. We can perform such computations in the case of…
In this paper, we develop the theoretical foundations of discrete Dirac mechanics, that is, discrete mechanics of degenerate Lagrangian/Hamiltonian systems with constraints. We first construct discrete analogues of Tulczyjew's triple and…
We introduce the theory of monoidal Groebner bases, a concept which generalizes the familiar notion in a polynomial ring and allows for a description of Groebner bases of ideals that are stable under the action of a monoid. The main…
We apply the Darboux integrability method to determine first integrals and Hamiltonian formulations of three dimensional polynomial systems; namely the reduced three-wave interaction problem, the Rabinovich system, the Hindmarsh-Rose model,…
Many applications modeled by polynomial systems have positive dimensional solution components (e.g., the path synthesis problems for four-bar mechanisms) that are challenging to compute numerically by homotopy continuation methods. A…
An improved characteristic set algorithm for solving Boolean polynomial systems is proposed. This algorithm is based on the idea of converting all the polynomials into monic ones by zero decomposition, and using additions to obtain…
We study the discretization of (almost-)Dirac structures using the notion of retraction and discretization maps on manifolds. Additionally, we apply the proposed discretization techniques to obtain numerical integrators for port-Hamiltonian…
Multi-homogeneous polynomial systems arise in many applications. We provide bit complexity estimates for solving them which, up to a few extra other factors, are quadratic in the number of solutions and linear in the height of the input…
In this paper, we propose a second-order energy-conserving approximation procedure for Hamiltonian systems with holonomic constraints. The derivation of the procedure relies on the use of the so-called line integral framework. We provide…
We discuss a general procedure for arriving at the Hamilton-Jacobi equation of second-class constrained systems, and illustrate it in terms of a number of examples by explicitely obtaining the respective Hamilton principal function, and…
In this work, we show that for linearly constrained optimization problems the primal-dual hybrid gradient algorithm, analyzed by Chambolle and Pock [3], can be written as an entirely primal algorithm. This allows us to prove convergence of…
In this work, a conformable singular system with second-class constraints is discussed. The conformable Poisson bracket (CDB) of two functions is defined. and, the Dirac theory is developed to be applicable to conformable singular systems.…
We show that after mapping each element of a set of second class constraints to the surface of the other ones, half of them form a subset of abelian first class constraints. The explicit form of the map is obtained considering the most…
We present algorithms to solve coupled systems of linear differential equations, arising in the calculation of massive Feynman diagrams with local operator insertions at 3-loop order, which do {\it not} request special choices of bases.…
The extensive analysis of the dynamics of relativistic spinning particles is presented. Using the coadjoint orbits method the Hamiltonian dynamics is explicitly described. The main technical tool is the factorization of general Lorentz…
This paper describes an algorithm which computes the characteristic polynomial of a matrix over a field within the same asymptotic complexity, up to constant factors, as the multiplication of two square matrices. Previously, this was only…
A characteristic pair is a pair (G,C) of polynomial sets in which G is a reduced lexicographic Groebner basis, C is the minimal triangular set contained in G, and C is normal. In this paper, we show that any finite polynomial set P can be…
We express discrete Painlev\'e equations as discrete Hamiltonian systems. The discrete Hamiltonian systems here mean the canonical transformations defined by generating functions. Our construction relies on the classification of the…
Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard…