Involutive Divisions in Mathematica: Implementation and Some Applications
نویسندگان
چکیده
In this paper we consider diierent involutive divisions and describe their implementation in Mathematica together with algorithms for the construction of involutive bases for monomial ideals. As a straightforward application, we consider computation of the Hilbert function and the Hilbert polynomial for a monomial ideal, or for a polynomial one represented by its Grr obner basis. This allows one, in particular, to determine the index of regularity of the ideal.
منابع مشابه
Involutive Division Technique: Some Generalizations and Optimizations
In this paper, in addition to the earlier introduced involutive divisions, we consider a new class of divisions induced by admissible monomial orderings. We prove that these divisions are noetherian and constructive. Thereby each of them allows one to compute an involutive Gröbner basis of a polynomial ideal by sequentially examining multiplicative reductions of nonmultiplicative prolongations....
متن کاملInvolutive Directions and New Involutive Divisions
In this paper, we propose the concept of involutive direction ss a vector representation for the concept of involutive division proposed by Gerdt and hi co-workers. With this representation, most of the properties of involutive divisions such as Noetherity, Artinity, and constructivity, can be greatly simplified. A new algorithm to compute the involutive completion is also given. Based on the v...
متن کاملInvolutive Bases of Polynomial Ideals
In this paper we consider an algorithmic technique more general than that proposed by Zharkov and Blinkov for the involutive analysis of polynomial ideals. It is based on a new concept of involutive monomial division which is defined for a monomial set. Such a division provides for each monomial the self-consistent separation of the whole set of variables into two disjoint subsets. They are cal...
متن کاملOn Noncommutative Involutive Divisions
Buchberger’s algorithm for computing a Gröbner basis solves the ideal membership problem over commutative polynomial rings. In the early 1990’s, an alternative to this algorithm was found, namely the involutive basis algorithm, which provides a Gröbner basis with extra combinatorial properties. Buchberger’s work was generalised to noncommutative polynomial rings by Bergman and Mora during the 1...
متن کاملTense like equality algebras
In this paper, first we define the notion of involutive operator on bounded involutive equality algebras and by using it, we introduce a new class of equality algebras that we called it a tense like equality algebra. Then we investigate some properties of tense like equality algebra. For two involutive bounded equality algebras and an equality homomorphism between them, we prove that the tense ...
متن کامل