Characterization of circuits supporting polynomial systems with the maximal number of positive solutions
From MaRDI portal
Publication:2408211
DOI10.1007/s00454-017-9897-4zbMath1397.13033arXiv1603.01813OpenAlexW2962990937MaRDI QIDQ2408211
Publication date: 10 October 2017
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.01813
Topology of real algebraic varieties (14P25) Solving polynomial systems; resultants (13P15) Dessins d'enfants theory (14H57)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximally positive polynomial systems supported on circuits
- A sharp bound on the number of real intersection points of a sparse plane curve with a line
- Real plane algebraic curves with asymptotically maximal number of even ovals
- Gale duality for complete intersections
- Counting real connected components of trinomial curve intersections and \(m\)-nomial hypersurfaces
- Riemann existence theorem and construction of real algebraic curves.
- Polynomial systems with few real zeroes
- Fewnomial systems with many roots, and an Adelic Tau Conjecture
- Descartes’ Rule of Signs for Polynomial Systems Supported on Circuits
- Polynomial systems supported on circuits and dessins d'enfants