Affiliation:
1. Kobe University, Japan
Abstract
For a given finite polynomial set, finding a monomial order such that the given set is already a GrÖbner basis for the ideal generated by the given set with respect to the found monomial order is called
GrÖbner basis detection
(GBD) problem and there is also its simpler version, called
structural GrÖbner basis detection
(SGBD) problem. In this short communication, we give algorithms to solve these problems for polynomials with parameters on their coefficients.
Publisher
Association for Computing Machinery (ACM)
Subject
Microbiology (medical),Immunology,Immunology and Allergy
Reference8 articles.
1. Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
2. A Note on Dynamic Gröbner Bases Computation
3. On the Stability of Gröbner Bases Under Specializations
4. A new algorithm for computing comprehensive Gröbner systems
5. Kosaku Nagasaka . Computing a structured GrÖbner basis approximately . In ISSAC 2011---Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation , pages 273 -- 280 . ACM, New York , 2011 . Kosaku Nagasaka. Computing a structured GrÖbner basis approximately. In ISSAC 2011---Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, pages 273--280. ACM, New York, 2011.