Computing all border bases for ideals of points

DOI10.1142/S0219498819501020zbMath1498.13069arXiv1707.02076OpenAlexW2963265787MaRDI QIDQ5383882

Martin Kreuzer, Samira Pourkhajouei, Amir Hashemi

Publication date: 20 June 2019

Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)

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

zbMATH Keywords

border basisvanishing idealideal of pointsbuchberger-Möller algorithmquasi border basis

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) Projective techniques in algebraic geometry (14N05)

Related Items (1)

ClassicBorderBases.mpl

Uses Software

• ApCoCoA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate computation of zero-dimensional polynomial ideals
• Computing border bases
• Stable border bases for ideals of points
• Computing border bases without using a term ordering
• Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
• Subideal border bases
• From Oil Fields to Hilbert Schemes
• Numerical Polynomial Algebra
• Border basis representation of a general quotient algebra
• Generalized normal forms and polynomial system solving
• A Polyhedral Characterization of Border Bases
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

This page was built for publication: Computing all border bases for ideals of points