Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0310130

Efficiently Computing Minimal Sets of Critical Pairs

M. Caboara·M. Kreuzer·L. Robbiano
View original source ↗Read source document ↗Export metadata ↓

Abstract

In the computation of a Gr"obner basis using Buchberger's algorithm, a key issue for improving the efficiency is to produce techniques for avoiding as many unnecessary critical pairs as possible. A good solution would be to avoid _all_ non-minimal critical pairs, and hence to process only a_minimal_ set of generators of the module generated by the critical syzygies. In this paper we show how to obtain that desired solution in the homogeneous case while retaining the same efficiency as with the classical implementation. As a consequence, we get a new Optimized Buchberger Algorithm.

Explore related subjects

math.AC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

M. Caboara, M. Kreuzer, L. Robbiano. 2003-10-09. Efficiently Computing Minimal Sets of Critical Pairs. https://arxiv.org/abs/math/0310130

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

KEEP EXPLORING

Related papers

arXiv2026

Mixed linkage of numerical semigroup ideals

We introduce principal and canonical linkage for relative ideals of a numerical semigroup $S$ and study their interaction modulo translation. On normalized $S$-reflexive ideals, a principal link followed by a canonical link acts by addition of the canonical ideal $K$. The resulting mixed components have paths as their underlying simple graphs, and their even liaison classes are chains under inclusion. If $r(K)$ is the positive reduction number of $K$, every even class has at most $r(K)$ elements and every mixed component has at most $2r(K)$ vertices. For components with a loop, the bound improves to $r(K)$. For semigroups of type two, we compute the even class of a given ideal from its occupied and gap blocks along arithmetic progressions and prove that the largest even class has exactly $r(K)$ elements. This equality can fail in type three. Both component bounds are sharp, and explicit families of embedding dimension three give components of unbounded size with and without loops.

math.AC↗
arXiv2026

Hilbert Series in Four Variables and Linear Factors of High Multiplicity

Explicit sequences of forms with the Hilbert series predicted by Fröberg's conjecture are difficult to construct beyond the almost complete intersection case. Over a field of characteristic zero, we prove that six forms of degree $d\ge4$ in four variables cannot have the predicted series if each is divisible by a power of a linear form with exponent at least $(15d+91)/16$. A power of the product of six quadric cones gives a nonzero element of the inverse system in a degree where the predicted series vanishes. This obstruction implies that every fixed-order Taylor truncation of the homogeneous Rogers--Szegő polynomial at $q=1$ fails to complete five powers of linear forms to the predicted series in all sufficiently large degrees. As a fixed-degree counterpart, we use exact certificates to prove the conjecture for any number of general quintics or septics; together with known results, this establishes the equal-degree conjecture in four variables for $1\le d\le9$.

math.AC↗