Reducing the size and number of linear programs in a dynamic Gröbner basis algorithm

DOI10.1007/s00200-014-0216-5zbMath1328.13038arXiv1209.2379OpenAlexW2001476969MaRDI QIDQ744015

John Perry, Massimo Caboara

Publication date: 2 October 2014

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.2379

zbMATH Keywords

Gröbner basesterm orderingboundary vectorsdynamic Buchberger algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Linear programming (90C05) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items

A comparison of unrestricted dynamic Gröbner basis algorithms ⋮ A dynamic F4 algorithm to compute Gröbner bases ⋮ A Note on Dynamic Gröbner Bases Computation

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing inhomogeneous Gröbner bases
• The Gröbner fan of an ideal
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Ideal-specific elimination orders form a star-shaped region
• A new class of term orders for elimination
• Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
• Signature-based algorithms to compute Gröbner bases