Monomial-agnostic computation of vanishing ideals

DOI10.1016/J.JACA.2024.100022MaRDI QIDQ6671808zbMATH OpenFDO

Authors Hiroshi Kera, Yoshihiko Hasegawa

Publication date 27 January 2025

Published in Journal of Computational Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JACA.2024.100022

zbMATH Keywords

approximate basis computationmonomial-agnostic computational algebravanishing ideal

Mathematics Subject Classification ID

Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cites work

• A computational algebra approach to the reverse engineering of gene regulatory networks
• Almost vanishing polynomials for sets of limited precision points
• Approximate computation of zero-dimensional polynomial ideals
• Border basis computation with gradient-weighted normalization
• Computer algebra in systems biology
• Generalized principal component analysis
• Noise-tolerant algebraic method for reconstruction of nonlinear dynamical systems
• Simple varieties for limited precision points
• Stable border bases for ideals of points

Cited in

(1)

• Discovery of exact equations via computing the Gröbner basis

This page was built for publication: Monomial-agnostic computation of vanishing ideals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6671808)