Binomiality testing and computing sparse polynomials via witness sets
From MaRDI portal
Publication:2155632
DOI10.1007/s10013-021-00543-2zbMath1498.14152OpenAlexW4212874813WikidataQ115996813 ScholiaQ115996813MaRDI QIDQ2155632
Jonathan D. Hauenstein, Chris Peterson, Samantha N. Sherman, Laura Felicia Matusevich
Publication date: 15 July 2022
Published in: Vietnam Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10013-021-00543-2
Symbolic computation and algebraic computation (68W30) Geometric aspects of numerical algebraic geometry (14Q65) Numerical algebraic geometry (65H14) Foundations of tropical geometry and relations with algebra (14T10)
Related Items
No short polynomials vanish on bounded rank matrices, Computing the binomial part of a polynomial ideal
Cites Work
- Unnamed Item
- Unnamed Item
- Isosingular sets and deflation
- Chemical reaction systems with toric steady states
- Newton polytopes and witness sets
- Numerically deciding the arithmetically Cohen-Macaulayness of a projective scheme
- Detecting binomiality
- Binomial ideals
- When is a polynomial ideal binomial after an ambient automorphism?
- A linear algebra approach for detecting binomiality of steady state ideals of reversible chemical reaction networks
- Numerical software to compute Newton polytopes and tropical membership
- Finding binomials in polynomial ideals
- Newton's method with deflation for isolated singularities of polynomial systems
- Introduction to Toric Varieties. (AM-131)
- Analysis of PSLQ, an integer relation finding algorithm
- On Rational Number Reconstruction and Approximation
- Acceleration of Euclidean Algorithm and Rational Number Reconstruction
- Numerical Computation of the Hilbert Function and Regularity of a Zero Dimensional Scheme
- Computing the multiplicity structure in solving polynomial systems
- Half-GCD and fast rational recovery
- Recovering Exact Results from Inexact Numerical Data in Algebraic Geometry
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
