The Hilbert Zonotope and a Polynomial Time Algorithm for Universal Grobner Bases

Simple item page
dc.creatorBabson, Eric
dc.creatorOnn, Shmuel
dc.creatorThomas, Rekha
dc.date2002-07-16
dc.date.accessioned2026-07-07T07:53:03Z
dc.date.available2026-07-07T07:53:03Z
dc.descriptionWe provide a polynomial time algorithm for computing the universal Gröbner basis of any polynomial ideal having a finite set of common zeros in fixed number of variables. One ingredient of our algorithm is an effective construction of the state polyhedron of any member of the Hilbert scheme Hilb^d_n of n-long d-variate ideals, enabled by introducing the Hilbert zonotope H^d_n and showing that it simultaneously refines all state polyhedra of ideals on Hilb^d_n.
dc.identifierhttps://arxiv.org/abs/math/0207135
dc.identifierhttp://arxiv.org/abs/math/0207135
dc.identifierAdvances in Applied Mathematics, 30:529--544, 2003
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/126105
dc.subjectCombinatorics
dc.subjectSymbolic Computation
dc.subjectAlgebraic Geometry
dc.titleThe Hilbert Zonotope and a Polynomial Time Algorithm for Universal Grobner Bases
dc.typetext

Files

Collections

arXiv