A new framework for computing Gröbner bases

DOI10.1090/mcom/2969zbMath1331.13018OpenAlexW1563257127MaRDI QIDQ3450045

Frank Volny IV, Shuhong Gao, Mingsheng Wang

Publication date: 2 November 2015

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/mcom/2969

zbMATH Keywords

Gröbner basessyzygiesF5 algorithmBuchberger algorithm

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Parallel algorithms in computer science (68W10)

Related Items

Solving multivariate polynomial matrix Diophantine equations with Gröbner basis method ⋮ An improvement for GVW ⋮ Signature Gröbner bases, bases of syzygies and cofactor reconstruction in the free algebra ⋮ The LaSalle's invariant sets for a class of Lotka-Volterra prey-predator chain systems ⋮ A signature-based algorithm for computing Gröbner-Shirshov bases in skew solvable polynomial rings. ⋮ Computing comprehensive Gröbner systems: a comparison of two methods ⋮ A new proof for the correctness of the F5 algorithm ⋮ Invariant \(\mathrm G^2\mathrm V\) algorithm for computing SAGBI-Gröbner bases ⋮ Computing coupled border bases ⋮ Signature Gröbner bases in free algebras over rings ⋮ A signature-based algorithm for computing the nondegenerate locus of a polynomial system ⋮ Axioms for a theory of signature bases ⋮ A new algorithm for computing staggered linear bases ⋮ Counting roots for polynomials modulo prime powers ⋮ A survey on signature-based algorithms for computing Gröbner bases ⋮ Characteristic decomposition: from regular sets to normal sets ⋮ Speeding up the GVW algorithm via a substituting method ⋮ Computing strong regular characteristic pairs with Gröbner bases ⋮ Finding Fuzzy Inverse Matrix Using Wu’s Method ⋮ On the construction of staggered linear bases ⋮ Solving the 100 swiss francs problem ⋮ An improvement over the GVW algorithm for inhomogeneous polynomial systems ⋮ Decomposition of polynomial sets into characteristic pairs ⋮ An involutive GVW algorithm and the computation of Pommaret bases ⋮ Relative Gröbner and involutive bases for ideals in quotient rings ⋮ Improved Computation of Involutive Bases ⋮ Randomized polynomial-time root counting in prime power rings ⋮ A signature-based algorithm for computing Gröbner bases over principal ideal domains

Uses Software

• F5C

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extended \(F_5\) criteria
• F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases
• Post-quantum cryptography. Second international workshop, PQCrypto 2008, Cincinnati, OH, USA, October 17--19, 2008. Proceedings
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• The F5 criterion revised
• Gröbner bases of ideals defined by functionals with an application to ideals of projective points
• A new incremental algorithm for computing Groebner bases
• The termination of the F5 algorithm revisited
• Signature rewriting in gröbner basis computation
• Asymmetric Cryptography with a Hidden Monomial
• A signature-based algorithm for computing Gröbner bases in solvable polynomial algebras
• Signature-based algorithms to compute Gröbner bases
• A generalized criterion for signature related Gröbner basis algorithms
• Advances in Cryptology - CRYPTO 2003