The paper introduces the calculation of a greatest common divisor of two univariate polynomials. Euclid’s algorithm can be easily simulated by the reduction of the Sylvester matrix to an upper triangular form. This is performed by using - transformation and -factorization methods. Both procedures are described and numerically compared. Computations are performed in the floating point environment.
Border bases are an alternative to Gröbner bases. The former have several more desirable properties. In this paper some constructions and operations on border bases are presented. Namely; the case of a restriction of an ideal to a polynomial ring (in a smaller number of variables), the case of the intersection of two ideals, and the case of the kernel of a homomorphism of polynomial rings. These constructions are applied to the ideal of relations and to factorizable derivations.
The Castelnuovo-Mumford regularity reg(M) is one of the most important invariants of a finitely generated graded module M over a polynomial ring R. For instance, it measures the amount of computational resources that working with M requires. In general one knows that the regularity of a module can be doubly exponential in the degrees of the minimal generators and in the number of the variables. On the other hand, in many situations one has or one conjectures a much better behavior. One may ask,...
We study when the modifications of the Cohen-Macaulay vertex cover ideal of a graph are Cohen-Macaulay.
We investigate the relationship between the Gröbner-Shirshov bases in free associative algebras, free left modules and “double-free” left modules (that is, free modules over a free algebra). We first give Chibrikov’s Composition-Diamond lemma for modules and then we show that Kang-Lee’s Composition-Diamond lemma follows from it. We give the Gröbner-Shirshov bases for the following modules: the highest weight module over a Lie algebra , the Verma module over a Kac-Moody algebra, the Verma module...
Gröbner bases for modules are used to calculate a generalized linear immersion for a plant whose solutions to its regulation equations are polynomials or pseudo-polynomials. After calculating the generalized linear immersion, we build the controller which gives the robust regulation.