Abstract
Little is known about upper complexity bounds for the normal form algorithms which transform a given polynomial ideal basis into a Gröbner basis. In this paper, we exhibit an optimal, exponential space algorithm for generating the reduced Gröbner basis of binomial ideals. This result is then applied to derive space optimal decision procedures for the finite enumeration and subword problems for commutative semigroups.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bayer, D.: The division algorithm and the Hilbert scheme. Ph.d. thesis, Harvard University, Cambridge, MA (1982)
Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenrings nach einem nulldimensionalen Polynomideal. Ph.d. thesis, Department of Mathematics, University of Innsbruck (1965)
Dickson, L. E.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. Amer. J. Math. 35 (1913) 413–422
Dubé, T. W.: The structure of polynomial ideals and Gröbner bases. SIAM J. Comput. 19 (1990) 750–773
Eisenbud D., Sturmfels B.: Binomial Ideals. Preprint (1994)
Hermann, G.: Die Frage der endlich vielen Schritte in der Theorie der Polynomideale. Math. Ann. 95 (1926) 736–788
Hironaka, H.: Resolution of singularities of an algebraic variety over a field of characteristic zero: I. Ann. of Math. 79(1) (1964) 109–203
Huynh, D. T.: A superexponential lower bound for Gröbner bases and Church-Rosser commutative Thue systems. Inf. Control 68(1-3) (1986) 196–206
Karp, R., Miller R.: Parallel program schemata. J. Comput. Syst. Sci. 3 (1969) 147–195
Koppenhagen, U., Mayr, E.W.: An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals. Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC '96, ACM Press (1996)
Mayr, E. W., Meyer, A.: The complexity of the finite containment problem for Petri nets. J. ACM 28(3) (1981) 561–576
Mayr E. W., Meyer A.: The complexity of the word problems for commutative semigroups and polynomial ideals. Adv. Math. 46(3) (1982) 305–329
Möller, H.M., Mora F.: Upper and lower bounds for the degree of Gröbner bases. Proceedings of the 3rd Internat. Symp. on Symbolic and Algebraic Computation, EUROSAM 84, Springer Verlag, LNCS 174 (1984) 172–183
Robbiano, L.: Term orderings on the polynomial ring. Proceedings of the 10th European Conference on Computer Algebra, EUROCAL '85, Vol. 2: Research contributions, Springer Verlag, LNCS 204 (1985) 513–517
V. Weispfenning, V.: Admissible orders and linear forms. ACM SIGSAM Bulletin 21(2) (1987) 16–18
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Koppenhagen, U., Mayr, E.W. (1996). Optimal gröbner base algorithms for binomial ideals. In: Meyer, F., Monien, B. (eds) Automata, Languages and Programming. ICALP 1996. Lecture Notes in Computer Science, vol 1099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61440-0_132
Download citation
DOI: https://doi.org/10.1007/3-540-61440-0_132
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61440-1
Online ISBN: 978-3-540-68580-7
eBook Packages: Springer Book Archive