Involutive division generated by an antigraded monomial ordering

DOI10.1007/978-3-642-23568-9_13MaRDI QIDQ3090899zbMATH OpenOpenAlexFDO

Authors Yu. A. Blinkov, Vladimir 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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Recommendations

• Involutive divisions and monomial orderings
• Involutive divisions and monomial orderings. II
• On Connection Between Constructive Involutive Divisions and Monomial Orderings
• Involutive division techniques: some generalizations and optimizations
• Involutive divisions: Slice and pair properties

Cited in

(11)

• Resolving decompositions for polynomial modules
• Involutive divisions and monomial orderings. II
• Compact representation of polynomials for algorithms for computing Gröbner and involutive bases
• Computer Algebra in Scientific Computing
• Bar code and Janet-like division
• Involutive divisions and monomial orderings
• Involutive bases algorithm incorporating F\(_5\) criterion
• On Connection Between Constructive Involutive Divisions and Monomial Orderings
• Applications of bar code to involutive divisions and a ``greedy algorithm for complete sets
• Resolving decompositions for polynomial modules
• A general framework for Noetherian well ordered polynomial reductions

Describes a project that uses

Uses Software

• Ginv

This page was built for publication: Involutive division generated by an antigraded monomial ordering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3090899)