Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0501345

The generic Groebner walk

K. Fukuda·A. N. Jensen·N. Lauritzen·R. Thomas
View original source ↗Read source document ↗Export metadata ↓

Abstract

The Groebner walk is an algorithm for conversion between Groebner bases for different term orders. It is based on the polyhedral geometry of the Groebner 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 Q^n. This gives rise to the generic Groebner walk involving only Groebner basis conversion over facets and computations with marked polynomials. The proposed technique is closely related to the lexicographic (symbolic) perturbation method used in optimization and computational geometry. We report on computations with toric ideals, where a version of our algorithm in certain cases computes test sets for hard integer knapsack problems significantly faster than the Buchberger algorithm.

Explore related subjects

math.ACmath.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

K. Fukuda, A. N. Jensen, N. Lauritzen, R. Thomas. 2005-10-13. The generic Groebner walk. https://arxiv.org/abs/math/0501345

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Unified Common-Root and Interpolation Bounds Based on Leading Monomial Data

For general fields the footprint bound from Gröbner basis theory estimates the number of common affine roots of any set of multivariate polynomials using information on their leading monomials. In this paper we develop an interpolation bound with a similar flavor extending a previously known result for only a single polynomial to any prescribed number of polynomials. Surprisingly, our interpolation theorem and the footprint bound can be shown to be two sides of the same coin, solving similar problems, but for dual spaces. As discussed the footprint bound compares well with the improved Alon-Füredi bound and for finite fields the presented interpolation theorem is sharp. Our work can be viewed as a comment to a question raised by Tao in [Tao, 2014]

math.AC↗
arXiv2026

Poincaré Duality and Quadratic Refinements over Laurent Rings

We develop a Poincaré duality theory for defects of nondegenerate sesquilinear pairings over Laurent polynomial rings. A key ingredient is a novel flat resolution of the character module, constructed from a triangulation of the sphere at infinity associated with a fan. The cup product on this resolution turns Poincaré duality on the sphere into canonical pairings between the resulting defect modules. In middle degrees, we construct distinguished quadratic refinements using equivariant cohomology of the sphere with the antipodal action. The effective replacement of the sphere with a projective space provides a geometric substitute for division by two. Applied to translation-invariant Pauli stabilizer codes, our results establish the nondegeneracy of higher-dimensional braiding pairings. They extend the two-dimensional T-junction formula for topological spin to higher dimensions, while giving it a geometric interpretation.

math.AC↗