2006/03/07 by Vladimir P. Gerdt, Gerdt, Vladimir P., Yuri A. Blinkov +2
Computer Science · Mathematics · #13P10 #68W30 #Algebraic Geometry and Number Theory #Commutative Algebra (math.AC) #Commutative Algebra and Its Applications #FOS: Mathematics #Polynomial and algebraic computation #Rings and Algebras (math.RA) #math.AC #math.RA #msc:13P10 #msc:68W30
paper · pdf · doi:10.48550/arxiv.math/0603161
11 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
openalex publication_date 2006/03/07 · arxiv created 2006/04/10 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We 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 F4 algorithm.