Computing border bases

DOI10.1016/j.jpaa.2005.07.006zbMath1097.13036OpenAlexW2116004197MaRDI QIDQ819794

Achim Kehrein, Martin Kreuzer

Publication date: 29 March 2006

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpaa.2005.07.006

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (23)

Unnamed Item ⋮ Deformations of border bases ⋮ Border bases for lattice ideals ⋮ الگوریتمی برای محاسبه ی ایده آل های مرتب نقاط و کاربردهای آن در مدل های زیست شناسی ⋮ Noise-tolerant algebraic method for reconstruction of nonlinear dynamical systems ⋮ Computing border bases using mutant strategies ⋮ Border bases and kernels of homomorphisms and of derivations ⋮ Computing coupled border bases ⋮ A signature based border basis algorithm ⋮ Gröbner strata in the Hilbert scheme of points ⋮ Artificial discontinuities of single-parametric Gröbner bases ⋮ Computing border bases without using a term ordering ⋮ Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz ⋮ Computing all border bases for ideals of points ⋮ Pivoting in extended rings for computing approximate Gröbner bases ⋮ Complexity of Gröbner basis detection and border basis detection ⋮ From Oil Fields to Hilbert Schemes ⋮ Gröbner bases for syzygy modules of border bases ⋮ A Polyhedral Characterization of Border Bases ⋮ Term Cancellations in Computing Floating-Point Gröbner Bases ⋮ Algebraic Attacks Galore! ⋮ Approximate computation of zero-dimensional polynomial ideals ⋮ Computing H-bases via minimal bases for syzygy modules

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Applied algebra, algebraic algorithms and error-correcting codes. 10th international symposium, AAECC-10, San Juan de Puerto Rico, Puerto Rico, May 10-14, 1993. Proceedings
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Characterizations of border bases
• Numerical Polynomial Algebra

This page was built for publication: Computing border bases