The generic Gröbner walk

Anders Nedergaard Jensen, Niels Lauritzen, Komei Fukuda, Rekha Thomas

    Research output: Working paper/Preprint Working paperResearch


    The Gröbner walk is an algorithm for conversion between Gröbner bases for different term orders. It is based on the polyhedral geometry of the Gröbner fan and involves tracking a line between cones representing the initial and target term order. An important parameter is explicit numerical perturbation of this line. This usually involves both time and space demanding arithmetic of integers much larger than the input numbers. In this paper we show how the explicit line may be replaced by a formal line using Robbiano's characterization of group orders on . This gives rise to the generic Gröbner walk involving only Gröbner basis conversion over facets and computations with marked polynomials. The infinite precision integer arithmetic is replaced by term order comparisons between (small) integral vectors. This makes it possible to compute with infinitesimal numbers and perturbations in a consistent way without introducing unnecessary long integers. The proposed technique is closely related to the lexicographic (symbolic) perturbation method used in optimization and computational geometry.
    Original languageEnglish
    Publication statusPublished - 2005


    Dive into the research topics of 'The generic Gröbner walk'. Together they form a unique fingerprint.

    Cite this