Maximally positive polynomial systems supported on circuits

DOI10.1016/J.JSC.2014.09.003zbMATH Open1308.14062OpenAlexW1975514320MaRDI QIDQ480671FDOQ480671

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) Real algebraic and real-analytic geometry (14P99) Gale and other diagrams (52B35) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Dessins d'enfants theory (14H57)

Cites Work

• Fewnomial systems with many roots, and an Adelic Tau Conjecture
• Gale duality for complete intersections
• Riemann existence theorem and construction of real algebraic curves.
• Real plane algebraic curves with asymptotically maximal number of even ovals
• Polynomial systems supported on circuits and dessins d'enfants
• TOPOLOGICAL CLASSIFICATION OF GENERIC REAL RATIONAL FUNCTIONS
• Polynomial systems with few real zeroes
• Title not available (Why is that?)

Cited In (3)

• Certifying polynomials for AC^0(parity) circuits, with applications
• Nonnegative Polynomials and Circuit Polynomials
• Characterization of circuits supporting polynomial systems with the maximal number of positive solutions

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

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