On Computing Janet Bases for Degree Compatible Orderings

Simple item page
dc.creatorGerdt, Vladimir P.
dc.creatorBlinkov, Yuri A.
dc.date2006-03-07
dc.date2006-04-10
dc.date.accessioned2026-07-07T07:06:36Z
dc.date.available2026-07-07T07:06:36Z
dc.descriptionWe consider three modifications of our involutive algorithm for computing Janet bases. These modifications are related to degree compatible monomial orders and specify selection strategies for non-multiplicative prolongations. By using the standard data base of polynomial benchmarks for \Gr bases software we compare the modifications and confront them with Magma that implements Faugère's $F_4$ algorithm.
dc.description11 pages, Proceedings of the 10th Rhine Workshop on Computer Algebra (March 16-17, 2006, Basel, Switzerland), J.Draisma and H.Kraft (Eds.), University of Basel, 2006, pp.107--117
dc.identifierhttps://arxiv.org/abs/math/0603161
dc.identifierhttp://arxiv.org/abs/math/0603161
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/110088
dc.subjectCommutative Algebra
dc.subjectRings and Algebras
dc.subject13P10; 68W30
dc.titleOn Computing Janet Bases for Degree Compatible Orderings
dc.typetext

Files

Collections

arXiv