Janet-Like Gröbner Bases
We define a new type of Gröbner bases called Janet-like, since their properties are similar to those for Janet bases. In particular, Janet-like bases also admit an explicit formula for the Hilbert function of polynomial ideals. Cardinality of a Janet-like basis never exceeds that of a Janet basis, but in many cases it is substantially less. Especially, Janet-like bases are much more compact than their Janet counterparts when reduced Gröbner bases have “sparce” leading monomials sets, e.g., for toric ideals. We present an algorithm for constructing Janet-like bases that is a slight modification of our Janet division algorithm. The former algorithm, by the reason of checking not more but often less number of nonmultiplicative prolongations, is more efficient than the latter one.
KeywordsPolynomial Ideal Hilbert Function Hilbert Polynomial Reducible Modulo Toric Ideal
Unable to display preview. Download preview PDF.
- 4.Buchberger, B.: Gröbner Bases: an Algorithmic Method in Polynomial Ideal Theory. In: Bose, N.K. (ed.) Recent Trends in Multidimensional System Theory, Reidel, Dordrecht, pp. 184–232 (1985)Google Scholar
- 6.Seiler, W.M.: Involution - The formal theory of differential equations and its applications in computer algebra and numerical analysis, Habilitation thesis, Dept. of Mathematics, University of Mannheim (2002)Google Scholar
- 8.Pottier, L.: Computation of toric Gröbner bases, Gröbner bases of lattices and integer point sof polytopes, http://www-sop.inria.fr/safir/SAM/Bastat/doc/doc.html
- 9.Gerdt, V.P., Blinkov, Y.A.: Janet Bases of Toric Ideals. In: Kredel, H., Seiler, W.K. (eds.) Proceedings of the 8th Rhine Workshop on Computer Algebra, pp. 125–135. University of Mannheim (2002), http://arXiv.org/math.AC/0501180
- 11.Hemmecke, R.: Private communicationGoogle Scholar