On Computing Janet Bases for Degree Compatible Orderings
Vladimir P. Gerdt, Yuri A. Blinkov
Abstract
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 bases software we compare the modifications and confront them with Magma that implements Faugère's F4 algorithm.
Create a lesson
Related papers
On the weak Lefschetz property of Artinian Gorenstein algebras of codimension three in arbitrary characteristic
Omkar Javadekar
Linear Independence of Polynomial Compositions and Identifiability of Deep Neural Networks
Kathlén Kohn, Giovanni Luca Marchetti, Alex Massarenti et al.
Comparing v-numbers of symbolic and ordinary powers of squarefree monomial ideals
Trung Chau, Tài Huy Hà, A. V. Jayanthan et al.
Polynomial extensions do not preserve the strong finite type property
Viet-Hoang Tran, Phan Thanh Toan, Thieu N. Vo et al.
Reduction numbers for witnesses to the generalized Loewy length
Richard Bartels, Sarah Dajani, Gabriel Koomson
Multi-graded generic initial ideals, regularity, and the optimal colorful fractional Helly theorem for d-Leray complexes
Daniel McGinnis