Optimal Descartes' rule of signs for systems supported on circuits
From MaRDI portal
Publication:832477
DOI10.1007/s00208-021-02216-4zbMath1487.14129arXiv2010.09165OpenAlexW3169600249MaRDI QIDQ832477
Frédéric Bihan, Jens Forsgård, Alicia Dickenstein
Publication date: 25 March 2022
Published in: Mathematische Annalen (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.09165
Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Real algebraic sets (14P05) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Computational real algebraic geometry (14Q30)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Newton polytope of the resultant
- The Cayley trick, lifting subdivisions and the Bohne-Dress theorem on zonotopal tilings
- Interpolation and approximation by polynomials
- Lower bounds for positive roots and regions of multistationarity in chemical reaction networks
- Multivariate Descartes' rule
- Characterization of circuits supporting polynomial systems with the maximal number of positive solutions
- Descartes’ Rule of Signs for Polynomial Systems Supported on Circuits
This page was built for publication: Optimal Descartes' rule of signs for systems supported on circuits