Gro¨bner bases: a computational approach to commutative algebra
Gro¨bner bases: a computational approach to commutative algebra
Involutive bases of polynomial ideals
Mathematics and Computers in Simulation - Special issue: Simplification of systems of algebraic and differential equations with applications
A new efficient algorithm for computing Gröbner bases without reduction to zero (F5)
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Hi-index | 0.00 |
The algorithmic methods of commutative algebra based on the Gröbner bases technique are briefly sketched out in the context of an application to the constrained finite dimensional polynomial Hamiltonian systems. The effectiveness of the proposed algorithms and their implementation in Mathematica is demonstrated for the light-cone version of the SU(3) Yang-Mills mechanics. The special homogeneous Gröbner basis is constructed that allow us to find and classify the complete set of constraints the model possesses.