|
Improved Computation of Involutive Bases
|
| Co-author(s): Bentolhoda Binaei and Amir Hashemi |
| Reference: Computer Algebra in Scientific Computing - CASC 2016,
V.P. Gerdt, W. Koepf, W.M. Seiler, E.V. Vorozhtsov (eds.), Springer-Verlag,
Berlin 2016, Lecture Notes in Computer Science 9890, pp 58-72 |
| Description: In this paper we show how two classical ideas for the acceleration of
Gröbner bases computations can be adapted to the determination of
Pommaret bases. The first idea is due Moeller, Mora and Traverso and
exploits the knowledge of syzygies. The second idea uses the Hilbert
function. Both ideas are very useful in the context of Pommaret bases, as
here it is generally necessary to compute repeatedly Janet bases for
essentially the same ideal expressed in different coordinates. |
PDF File:  (204 kB)
|
|
Home,
Last update:
Sat Oct 1 15:35:48 2016
|