Polynomial systems supported on circuits and dessins d'enfants
From MaRDI portal
Publication:5297563
DOI10.1112/JLMS/JDL013zbMATH Open1119.12002arXivmath/0509219OpenAlexW2074835688MaRDI QIDQ5297563FDOQ5297563
Authors: Frédéric Bihan 
Publication date: 12 July 2007
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Abstract: We study polynomial systems whose equations have as common support a set C of n+2 points in Z^n called a circuit. We find a bound on the number of real solutions to such systems which depends on n, the dimension of the affine span of the minimal affinely dependent subset of C, and the "rank modulo 2" of C. We prove that this bound is sharp by drawing so-called dessins d'enfant on the Riemann sphere. We also obtain that the maximal number of solutions with positive coordinates to systems supported on circuits in Z^n is n+1, which is very small comparatively to the bound given by the Khovanskii fewnomial theorem.
Full work available at URL: https://arxiv.org/abs/math/0509219
Recommendations
- Maximally positive polynomial systems supported on circuits
- Characterization of circuits supporting polynomial systems with the maximal number of positive solutions
- Polynomial systems with few real zeroes
- New fewnomial upper bounds from Gale dual polynomial systems
- Descartes' rule of signs for polynomial systems supported on circuits
Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Real algebraic sets (14P05) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)
Cites Work
- Counting real connected components of trinomial curve intersections and \(m\)-nomial hypersurfaces
- Riemann existence theorem and construction of real algebraic curves.
- Real plane algebraic curves with asymptotically maximal number of even ovals
- Lower bounds for real solutions to sparse polynomial systems
- TOPOLOGICAL CLASSIFICATION OF GENERIC REAL RATIONAL FUNCTIONS
- Polynomial systems with few real zeroes
- Title not available (Why is that?)
Cited In (17)
- On the number of real zeros of random fewnomials
- Polynomial systems with few real zeroes
- Anti-Vandermonde systems and plane trees
- Amoebas of genus at most one
- Bounds on the number of solutions of polynomial systems and the Betti numbers of real piecewise algebraic hypersurfaces
- Coamoebas of polynomials supported on circuits
- Constructing polynomial systems with many positive solutions using tropical geometry
- Characterization of circuits supporting polynomial systems with the maximal number of positive solutions
- Fewnomial bounds for completely mixed polynomial systems
- Gale duality for complete intersections
- Maximally positive polynomial systems supported on circuits
- Title not available (Why is that?)
- Geometry of the signed support of a multivariate polynomial and Descartes' rule of signs
- A sharp bound on the number of real intersection points of a sparse plane curve with a line
- A Polyhedral Method for Sparse Systems with Many Positive Solutions
- Topological types of real regular Jacobian elliptic surfaces
- Systems of polynomials with at least one positive real zero
This page was built for publication: Polynomial systems supported on circuits and dessins d'enfants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5297563)
