Affiliation:
1. University of Delaware, Newark, Delaware
Abstract
The problem of finding a modular algorithm for constructing Gröbner-bases is of interest to many computer algebraists. In particular, given a prime p and a set of (multivariate) polynomials with integer coefficients, it has been queried if the number of basis polynomials in a minimal normed Gröbner-basis for the polynomial ideal generated mod p has to be less than or equal to the corresponding number for the polynomial ideal generated over the rationals. In this paper we answer this question and related questions concerning the modular approach to Gröbner-bases, illustrating with several interesting examples, and we propose a criterion for determining "luckiness" of primes in the binomial case.
Publisher
Association for Computing Machinery (ACM)
Reference6 articles.
1. On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
2. A theoretical basis for the reduction of polynomials to canonical forms
3. Some properties of Gröbner-bases for polynomial ideals
4. B. Buchberger "H-bases and Gröbner-bases for polynomial ideals" Tech. Report Nr. CAMP 81-2.0 Inst. für Mathematik Univ. Linz (1981). B. Buchberger "H-bases and Gröbner-bases for polynomial ideals" Tech. Report Nr. CAMP 81-2.0 Inst. für Mathematik Univ. Linz (1981).
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Newton iteration for lexicographic Gröbner bases in two variables;Journal of Algebra;2024-09
2. Computing Generic Fibers of Polynomial Ideals with FGLM and Hensel Lifting;Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation;2024-07-16
3. p-adic algorithm for bivariate Gröbner bases;Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation;2023-07-24
4. Modular Techniques for Noncommutative Gröbner Bases;Mathematics in Computer Science;2019-11-21
5. Detailed Solutions to the Exercises;Constructive Commutative Algebra;2015