Document Type
Article
Publication Date
2010
Department
Mathematics
Abstract
This paper introduces a new algorithm for computing Gröbner bases. To avoid as much ambiguity as possible, this algorithm combines the F4 algorithm and basic algorithm of involutive bases and it replaces the symbolic precomputation of S-polynomials and ordinary division in F4 by a new symbolic precomputation of non-multiplicative prolongations and involutive division. This innovation makes the sparse matrix of F4 in a deterministic way. As an example the Cyclic-4 problem is presented.
Recommended Citation
Yu, Miao, "An F4-Style Involutive Basis Algorithm" (2010). Mathematics Student Presentations. 2.
https://aquila.usm.edu/math_student_presentations/2
Comments
This paper was awarded first prize in the graduate paper competition at the 2010 meeting of the Louisiana/Mississippi Section of the Mathematical Association of America.