Deterministically Computing Reduction Numbers of Polynomial Ideals

DOI10.1007/978-3-319-10515-4_14zbMath1416.68220arXiv1404.1721OpenAlexW1680957602MaRDI QIDQ2879324

Amir Hashemi, Michael Schweinfurter, Werner M. Seiler

Publication date: 8 September 2014

Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.1721

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (3)

Deterministic genericity for polynomial ideals ⋮ Deterministic.mpl ⋮ BigRedNum.mpl

Uses Software

• Unnamed Item

This page was built for publication: Deterministically Computing Reduction Numbers of Polynomial Ideals