Involutive Division Generated by an Antigraded Monomial Ordering
From MaRDI portal
Publication:3090899
DOI10.1007/978-3-642-23568-9_13zbMath1344.68299OpenAlexW2124254010MaRDI QIDQ3090899
Yu. A. Blinkov, Vladimir P. Gerdt
Publication date: 2 September 2011
Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-23568-9_13
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (6)
Compact representation of polynomials for algorithms for computing Gröbner and involutive bases ⋮ Resolving decompositions for polynomial modules ⋮ Applications of bar code to involutive divisions and a ``greedy algorithm for complete sets ⋮ Involutive bases algorithm incorporating F\(_5\) criterion ⋮ A general framework for Noetherian well ordered polynomial reductions ⋮ Resolving Decompositions for Polynomial Modules
Uses Software
This page was built for publication: Involutive Division Generated by an Antigraded Monomial Ordering
