Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

It's known that finding a Gröbner basis of a polynomial ideal has a worst-case space complexity of $O(2^{2^{c\cdot n}})$, where c is constant and n is the number of variables $k[x_1,\ldots,x_n]$.

However, in practice it seems that most ideals have a simple Gröbner basis.

Can anyone give some concrete examples of small generators whose ideal has a large Gröbner basis? How would I go about searching for such examples (besides a brute-force approach of trying random ideals)?

share|improve this question
    
Point of interest: As far as I've heard, the bad examples people used to show the worst-case complexity are not very geometrical in nature. –  Andrew Dec 9 '12 at 1:37

1 Answer 1

up vote 1 down vote accepted

I just found the following example, from this paper:

GroebnerBasis[{x^5 + y^5 + z^5 - 1, x^3 + y^3 + z^2 - 1}, {x, y, z}] (* Is long *)

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.