Searcharxiv⌕ 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

$F$-injectivity does not imply $F$-fullness in normal domains

We construct examples of Noetherian three-dimensional local geometrically normal domains of prime characteristic which are $F$-injective but not $F$-full. Along the way, we find examples of two-dimensional local geometrically normal domains which are $F$-injective but not $F$-anti-nilpotent. A crucial theme of our constructions is the behavior of $F$-injectivity along a purely inseparable finite base change.

math.AC↗
arXiv2026

A new proof of characteristic-free Knörrer periodicity

Let $R = S/(f)$ be a complete local hypersurface ring and let $A = S[\![u,v]\!]/(f+uv)$. Pfister and Popescu showed that the stable categories of maximal Cohen-Macaulay modules over $R$ and over $A$ are equivalent, with no assumption on the characteristic. We give a short proof. If $(Φ,Ψ)$ is a matrix factorization of $h$ and $\partial$ is a derivation, then $(\partialΨ,\partialΦ)$ is a null-homotopy for multiplication by $\partial h$. Since $u$ and $v$ are partial derivatives of $f+uv$, they act as zero on the stable category of $A$, so the Koszul complex on $u$ and $v$ splits in the singularity category, and this gives density. For the double branched cover $S[\![z]\!]/(f+z^2)$ the same argument yields $2z$: it recovers Knörrer's lemma up to free summands on the double branched cover when $2$ is a unit, and we show by an example that this lemma, and periodicity for the iterated double branched cover $S[\![z,w]\!]/(f+z^2+w^2)$, fail in characteristic two. We also compute the second syzygy over $A$ of a maximal Cohen-Macaulay $R$-module by an explicit resolution, and show that the change of basis used there cannot be given by a universal matrix formula.

math.AC↗
arXiv2026

Intersection multiplicity of a sparse curve and a trinomial curve

Let f $\in$ C[x, y] be a trinomial and let g $\in$ C[x, y] be a sparse polynomial with N monomials (N $\ge$ 1). We address the problem of bounding the local intersection multiplicity of the bivariate polynomial system f = g = 0 at an isolated root q $\in$ (C * )^ 2 only in terms of N . Our main result establishes that the local multiplicity of the system at any isolated solution q $\in$ (C * ) ^2 is at most (N -1)(N +2)/ 2 , independently of the degrees of f and g. Furthermore, we know that this bound is sharp for N = 3.

math.AC↗