Kosaku Nagasaka
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.
- Peter Gritzmann and Bernd Sturmfels. Minkowski addition of polytopes: computational complexity and applications to GrÖbner bases. SIAM J. Discrete Math., 6(2):246--269, 1993.Google Scholar
Digital Library
- Amir Hashemi and Delaram Talaashrafi. A note on dynamic GrÖbner bases computation. In Computer algebra in scientific computing, volume 9890 of Lecture Notes in Comput. Sci., pages 276--288. Springer, Cham, 2016.Google ScholarCross Ref
- Michael Kalkbrener. On the stability of GrÖbner bases under specializations. J. Symbolic Comput., 24(1):51--58, 1997.Google ScholarDigital Library
- Deepak Kapur, Yao Sun, and Dingkang Wang. A new algorithm for computing comprehensive GrÖbner systems. In ISSAC 2010---Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, pages 29--36. ACM, New York, 2010.Google ScholarDigital Library
- 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.Google Scholar
- Lorenzo Robbiano. Term orderings on the polynomial ring. In EUROCAL '85, Vol. 2 (Linz, 1985), volume 204 of Lecture Notes in Comput. Sci., pages 513--517. Springer, Berlin, 1985.Google ScholarCross Ref
- Bernd Sturmfels and Markus Wiegelmann. Structural GrÖbner basis detection. Appl. Algebra Engrg. Comm. Comput., 8(4):257--263, 1997.Google ScholarCross Ref
- Volker Weispfenning. Comprehensive GrÖbner bases. J. Symbolic Comput., 14(1):1--29, 1992.Google ScholarDigital Library
Index Terms
- Conditional GrÖbner Basis: GrÖbner Basis Detection with Parameters
Recommendations
Complexity of Gröbner basis detection and border basis detection
Grobner basis detection (GBD) is defined as follows: given a set of polynomials, decide whether there exists-and if ''yes'' find-a term order such that the set of polynomials is a Grobner basis. This problem was proposed by Gritzmann and Sturmfels (1993)...
Gröbner Basis Cryptosystems
In the first sections we extend and generalize Gröbner basis theory to submodules of free right modules over monoid rings. Over free monoids, we adapt the known theory for right ideals and prove versions of Macaulay's basis theorem, the Buchberger ...
Janet-like gröbner bases
CASC'05: Proceedings of the 8th international conference on Computer Algebra in Scientific ComputingWe define a new type of Gröbner bases called Janet-like, since their properties are similar to those for Janet bases. In particular, Janet-like bases also admit an explicit formula for the Hilbert function of polynomial ideals. Cardinality of a Janet-...
Comments