Computing border bases without using a term ordering

DOI10.1007/s13366-011-0070-6zbMath1266.13019arXiv1104.2724OpenAlexW2963164593MaRDI QIDQ1943354

Stefan Kaspar

Publication date: 19 March 2013

Published in: Beiträge zur Algebra und Geometrie (Search for Journal in Brave)

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

zbMATH Keywords

symbolic computationborder basisterm orderingmarked polynomials

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)

الگوریتمی برای محاسبه ی ایده آل های مرتب نقاط و کاربردهای آن در مدل های زیست شناسی ⋮ Computing coupled border bases ⋮ A signature based border basis algorithm ⋮ Computing all border bases for ideals of points ⋮ A Polyhedral Characterization of Border Bases

Uses Software

• CoCoA
• ApCoCoA

Cites Work

• Approximate computation of zero-dimensional polynomial ideals
• Computing border bases
• Characterizations of border bases
• Generalized normal forms and polynomial system solving
• A Polyhedral Characterization of Border Bases
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing border bases without using a term ordering