Reduced Gröbner bases and Macaulay-Buchberger Basis Theorem over Noetherian rings
نویسندگان
چکیده
In this paper, we extend the characterization of Z[x]/〈f〉, where f ∈ Z[x] to be a free Z-module to multivariate polynomial rings over any commutative Noetherian ring, A. The characterization allows us to extend the Gröbner basis method of computing a k-vector space basis of residue class polynomial rings over a field k (Macaulay-Buchberger Basis Theorem) to rings, i.e. A[x1, . . . , xn]/a, where a ⊆ A[x1, . . . , xn] is an ideal. We give some insights into the characterization for two special cases, when A = Z and A = k[θ1, . . . , θm]. As an application of this characterization, we show that the concept of border bases can be extended to rings when the corresponding residue class ring is a finitely generated, free A-module.
منابع مشابه
Macaulay-Buchberger Basis Theorem for Residue Class Polynomial Rings with Torsion and Border Bases over Rings
In this paper we generalize the Macaulay-Buchberger basis theorem to the case, where the residue class polynomial ring over a Noetherian ring is not necessarily a free module. Recently, this theorem has been extended from polynomial rings over fields to rings, when residue class polynomial ring is free in (Francis & Dukkipati, 2014). As an application of this generalization we develop a theory ...
متن کاملAlgorithmic Properties of Polynomial Rings
In this paper we investigate how algorithms for computing heights, radicals, unmixed and primary decompositions of ideals can be lifted from a Noetherian commutative ring R to polynomial rings over R. It is a standard problem in mathematics to study which properties of a mathematical structure are preserved in derived structures. A typical result of this kind is the Hilbert Basis Theorem which ...
متن کاملLinear Algebraic Approach to H-basis Computation
Macaulay introduced the notion of H-bases [2]. His original motivation was the transformation of systems of polynomial equations into simpler ones. The power of this concept was not really understood presumably because of the lack of facilities for symbolic computations. Later Buchberger invented Gröbner bases for computing multiplication tables for factor rings [1]. When Computer Algebra Syste...
متن کاملGröbner Bases in Orders of Algebraic Number Fields
In the 1960s Bruno Buchberger presented his first critical-pair-completion algorithm, now called Buchberger’s algorithm. Since then Gröbner bases have become a powerful tool in computational algebra and algebraic geometry. What is not as well known is that Buchberger (1985, 1987) has also shown a way of computing Gröbner bases in the integers. This is not as trivial as it may seem. In the polyn...
متن کاملOn Monic Gröbner Bases in Free Algebras over Rings Stemming from Bergman’s Diamond Lemma
Let R be an arbitrary commutative ring and R〈X〉 = R〈X1, ..., Xn〉 the free algebra of n generators over R. Note that Bergman’s diamond lemma characterizes the resolvability of ambiguities of monic relations of the form Wσ − fσ with fσ a linear combination of monomials ≺ Wσ, where ≺ is a semigroup partial ordering on 〈X〉; and that in the algorithmic language of Gröbner basis theory over a ground ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Comput.
دوره 65 شماره
صفحات -
تاریخ انتشار 2014