Maximally positive polynomial systems supported on circuits

DOI10.1016/j.jsc.2014.09.003zbMath1308.14062OpenAlexW1975514320MaRDI QIDQ480671

Frédéric Bihan

Publication date: 9 December 2014

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2014.09.003

zbMATH Keywords

positive solutionspolynomial systemscircuitsfewnomialsreal dessins d'enfant

Mathematics Subject Classification ID

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Enumerative problems (combinatorial problems) in algebraic geometry (14N10) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Real algebraic and real-analytic geometry (14P99) Gale and other diagrams (52B35) Dessins d'enfants theory (14H57)

Related Items (1)

Characterization of circuits supporting polynomial systems with the maximal number of positive solutions

Cites Work

• Unnamed Item
• Real plane algebraic curves with asymptotically maximal number of even ovals
• Gale duality for complete intersections
• 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
• TOPOLOGICAL CLASSIFICATION OF GENERIC REAL RATIONAL FUNCTIONS
• Polynomial systems supported on circuits and dessins d'enfants

This page was built for publication: Maximally positive polynomial systems supported on circuits