On the complexity of computing syzygies
Journal of Symbolic Computation
Upper and Lower Bounds for the Degree of Groebner Bases
EUROSAM '84 Proceedings of the International Symposium on Symbolic and Algebraic Computation
Some Effectivity Problems in Polynomial Ideal Theory
EUROSAM '84 Proceedings of the International Symposium on Symbolic and Algebraic Computation
A software tool for the investigation of plane loci
Mathematics and Computers in Simulation
Randomized Zero Testing of Radical Expressions and Elementary Geometry Theorem Proving
ADG '00 Revised Papers from the Third International Workshop on Automated Deduction in Geometry
Polynomial approximations of the relational semantics of imperative programs
Science of Computer Programming
Degree bounds for Gröbner bases of low-dimensional polynomial ideals
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Dimension-dependent bounds for Gröbner bases of polynomial ideals
Journal of Symbolic Computation
Hi-index | 0.00 |
For n =1, d = 2, we describe a commutative Thue system that has ~2n variables and O(n) rules, each rule of size d + O(1) and that counts to d^2^n in a certain technical sense. This gives a more ''efficient'' alternative to a well-known construction of Mayr and Meyer. Using this construction, we sharpen the known double-exponential lower bounds for the maximum degrees D(n, d), I(n, d), S(n, d) associated (respectively) with Grobner bases, ideal membership problem and the syzygy basis problem: D(n,d)=S(n,d)=d^2^^^m,I(n,d)=d^2^^^m, where m~n/2, and n, d sufficiently large. For comparison, it was known that D(n, d) @? d^2^n and I(n, d) @? (2d)^2^n.