Abstract
Zero-dimensional valuation rings are one kind of non-Noetherian rings. This paper investigates properties of zero-dimensional valuation rings and prove that a finitely generated ideal over such a ring has a Gröbner basis. The authors present an algorithm for computing a Gröbner basis of a finitely generated ideal over it. Furthermore, an interesting example is also provided to explain the algorithm.
Similar content being viewed by others
References
Buchberger B, An algorithm for finding a basis for the redidue class ring of a zero dimensiomal polynomial, PhD thesis, Universität Innsbruck, Institut für Mathematik, 1965.
Adams W and Loustaunau P, An Introduction to Gröbner Bases, Grad. Stud. Math., vol. 3, Amer. Math. Soc., Providence, 1994.
Becker T and Weispfenning V, Gröbner Bases — A Computational Approach to Commutative Algebra, GTM 141, Springer, New York, 1993.
Buchberger B and Winkler F, Gröbner Bases and Application, London Mathematical Society Lecture Note Series, Vol. 251. Cambridge University Press, Cambridge, 1998.
Li D, Liu J, and Zheng L, On the equivalence of multivariate polynomial matrices, Multidim Syst. Sign Process., 2017, 28: 225–135.
Liu J, Li D, and Wang M, On general factorization for n-D polynomial matrices, Circuits Signal Process, 2011, 30: 553–566.
Li D, Liu J, and Zheng L, The Lin-Bose problem, IEEE Trans. Circuits Syst. II, 2014, 61: 41–43.
Wang M and Feng D, On Lin-Bose problem, Linear Algebra and Its Application, 2004, 390: 279–285.
Faugere J C, A new effcient algorithm for computing Gröbner bases (F4), Journal of Pure and Applied Algebra, 1999, 139: 61–88.
Byrne E and Fitzpatrick P, Gröbner bases over Galois rings with an application to decoding alternant codes, J. Symbolic Comput., 2001, 31: 565–584.
Norton G H and Salagean A, Strong Gröbner bases and cyclic codes over a finite-chain ring, Appl. Algebra Engrg. Comm. Comput., 2000, 10: 489–506.
Norton G H and Salagean A, Strong Gröbner bases for polynomials over a principal ideal ring, Bull. Austral. Math. Soc., 2001, 64: 505–528.
Sun Y and Wang D, The F5 algorithm in Buchberger’s style, Journal of Systems Science and Complexity, 2010, 24(6): 1218–1231.
Yengui I, Dynamical Gröbner bases, Journal of Algebra, 2006, 301: 447–458.
Lombardi H, Schuster P, and Yengui I, The Gröbner ring conjecture in one varible, Mathematische Zeitschrift, 2012, 270: 1181–1185.
Yengui I, The Gröbner ring conjecture in the lexicographic order case, Mathematische Zeitschrift, 2014, 276: 261–265.
Moncear S and Yengui I, On the leading terms ideal of polynomial ideal over a valuation ring, Journal of Algebra, 2012, 351: 382–389.
Li D, Liu J, and Zheng L, A zero-dimensional valuation ring is 1-Gröbner, Journal of Algebra, 2017, 484: 3334–343.
Yengui I, Constructive Commutative Algebra, Lecture Notes in Math., vol. 2138, 2015, https://doi.org/10.1007/978-3-319-19494-3.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was supported by the National Natural Science Foundation of China under Grant Nos. 11871207 and 11971161.
This paper was recommended for publication by Editor FENG Ruyong.
Rights and permissions
About this article
Cite this article
Li, D., Liu, J. A Gröbner Basis Algorithm for Ideals over Zero-Dimensional Valuation Rings. J Syst Sci Complex 34, 2470–2483 (2021). https://doi.org/10.1007/s11424-020-0010-3
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11424-020-0010-3