SAGBI and SAGBI-Gröbner bases over principal ideal domains

DOI10.1006/jsco.1998.0243zbMath0930.13021OpenAlexW2075381343MaRDI QIDQ1284220

William W. Adams, Serkan Hoşten, Philippe Loustaunau, J. Lyn Miller

Publication date: 1 December 1999

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/ce6b5a97fbcd8c8970bccd59a3c4ffe4724a9723

zbMATH Keywords

integer programmingGröbner basesSAGBI basesSAGBI-Gröbner basesBuchberger algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (5)

Invariant \(\mathrm G^2\mathrm V\) algorithm for computing SAGBI-Gröbner bases ⋮ Applications of SAGBI-bases in dynamics ⋮ Antichains of monomial ideals are finite ⋮ Using symmetries in the eigenvalue method for polynomial systems ⋮ The vertex ideal of a lattice.

This page was built for publication: SAGBI and SAGBI-Gröbner bases over principal ideal domains