Abstract
In this paper, effectiveness of involutive criteria in the elimination of useless prolongations when computing polynomial Janet bases, which are typical representatives of involutive bases, is discussed. One of the results of this study is that the role of the criteria in an involutive algorithm is not as important as in the Buchberger algorithm. It is shown also that these criteria affect the growth of intermediate coefficients.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Buchberger, B., Algorithm for Finding a Basis for the Residue Class Ring of Zero-Dimensional Polynomial Ideal, PhD Dissertation, Innsbruck: Univ. of Innsbruck, Inst. for Mathematics, 1965 (in German).
Buchberger, B., Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory, Recent Trends in Multidimensional System Theory, Bose, N.K., Ed., Dordrecht: Reidel, 1985, pp. 184–232.
Gerdt, V.P. and Blinkov, Yu.A., Involutive Bases of Polynomial Ideals, Math. Comput. Simulation, 1998, vol. 45, pp. 519–542.
Gerdt, V.P. and Blinkov, A.Yu., Involutive Divisions of Monomials, Programmirovanie, 1998, vol. 24, no. 6, pp. 22–24 [Programming Comput. Software (Engl. Transl.), vol. 24, no. 6, pp. 283–285].
Apel, J., Theory of Involutive Divisions and an Application to Hilbert Function Computations, J. Symbolic Computation, 1998, vol. 25, pp. 683–704.
Gerdt, V.P., Blinkov, Yu.A., and Yanovich, D.A., Construction of Janet Bases: I. Monomial Bases and II. Polynomial Bases, Proc. of the Conf. “Computer Algebra in Scientific Computing” (CASC’01), Ganzha, V.G., Mayr, E.W., and Vorozhtsov, E.V., Eds., Berlin: Springer, 2001, pp. 249–263.
Apel, J. and Hemmecke, R., Detecting Unnecessary Reductions in an Involutive Basis Computation, RISC Linz Report Series 02-22, 2002.
http://www-sop.inria.fr/saga/POL; http://www2.math.uic.edu/:_jan.
Gerdt, V.P., Involutive Algorithms for Computing Gröbner Bases, Computational Commutative and Non-commutative Algebraic Geometry, Cojocaru, S., Pfister, G., and Ufnarovski, V., Eds., Amsterdam: IOS, 2005, pp. 199–225.
Gerdt, V.P. and Yanovich, D.A., Parallelism in Computing Janet Bases, Proc. of the Workshop on Under-and Overdetermined Systems of Algebraic or Differential Equations, Calmet, J., Hausdorf, M., and Seiler, W.M., Eds., Karlsruhe: Institute of Algorithms and Cognitive Systems, Univ. of Karlsruhe, 2002, pp. 47–56.
Author information
Authors and Affiliations
Additional information
Original Russian Text © V.P. Gerdt, D.A. Yanovich, 2006, published in Programmirovanie, 2006, Vol. 32, No. 3.
Rights and permissions
About this article
Cite this article
Gerdt, V.P., Yanovich, D.A. Effectiveness of involutive criteria in computation of polynomial Janet bases. Program Comput Soft 32, 134–138 (2006). https://doi.org/10.1134/S0361768806030030
Received:
Issue Date:
DOI: https://doi.org/10.1134/S0361768806030030