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

DOI10.1007/S00454-017-9897-4zbMATH Open1397.13033arXiv1603.01813OpenAlexW2962990937MaRDI QIDQ2408211FDOQ2408211

Authors: Boulos El Hilany 

Publication date: 10 October 2017

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Abstract: A polynomial system with $n$ equations in $n$ variables supported on a set $mathcalWsubsetmathbb{R}^n$ of $n+2$ points has at most $n+1$ non-degenerate positive solutions. Moreover, if this bound is reached, then $mathcalW$ is minimally affinely dependent, in other words, it is a circuit in $mathbb{R}^n$. For any positive integer number $n$, we determine all circuits $mathcalWsubsetmathbb{R}^n$ which can support a polynomial system with $n+1$ non-degenerate positive solutions. Restrictions on such circuits $mathcalW$ are obtained using Grothendieck's real dessins d'enfant, while polynomial systems with $n+1$ non-degenerate positive solutions are constructed using Viro's combinatorial patchworking.

Full work available at URL: https://arxiv.org/abs/1603.01813

Recommendations

• Maximally positive polynomial systems supported on circuits
• scientific article; zbMATH DE number 1052837
• A Positivstellensatz for sums of nonnegative circuit polynomials
• Polynomial systems supported on circuits and dessins d'enfants
• Nonnegative Polynomials and Circuit Polynomials
• On coefficients of circuit polynomials and characteristic polynomials
• Certifying polynomials for AC^0(parity) circuits, with applications
• On the number of solutions of polynomial systems
• Counting positive solutions for polynomial systems with real coefficients
• scientific article; zbMATH DE number 1151814

zbMATH Keywords

polynomial systemscircuitsdessins d'enfantcombinatorial patchworkingtheory of fewnomials

Mathematics Subject Classification ID

Topology of real algebraic varieties (14P25) Solving polynomial systems; resultants (13P15) Dessins d'enfants theory (14H57)

Cites Work

• Title not available (Why is that?)
• Counting real connected components of trinomial curve intersections and \(m\)-nomial hypersurfaces
• Fewnomial systems with many roots, and an Adelic Tau Conjecture
• New fewnomial upper bounds from Gale dual polynomial systems
• Descartes' rule of signs for polynomial systems supported on circuits
• Gale duality for complete intersections
• Riemann existence theorem and construction of real algebraic curves.
• Title not available (Why is that?)
• Real plane algebraic curves with asymptotically maximal number of even ovals
• Polynomial systems supported on circuits and dessins d'enfants
• Polynomial systems with few real zeroes
• 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

Cited In (6)

• Certifying polynomials for AC^0(parity) circuits, with applications
• Optimal Descartes' rule of signs for systems supported on circuits
• Polynomial systems with few real zeroes
• Title not available (Why is that?)
• Maximally positive polynomial systems supported on circuits
• Polynomial systems supported on circuits and dessins d'enfants

This page was built for publication: Characterization of circuits supporting polynomial systems with the maximal number of positive solutions

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