Fewnomial bounds for completely mixed polynomial systems
Frederic Bihan, Frank Sottile

TL;DR
This paper establishes a new, tighter bound on the number of real solutions for a specific class of polynomial systems with distinct monomials across polynomials, improving upon existing fewnomial bounds by leveraging the structure of the system.
Contribution
It introduces a novel bound for the number of real solutions in completely mixed polynomial systems, considering the unique monomial structure to improve accuracy.
Findings
New bound for real solutions in completely mixed systems
Bound is tighter than general fewnomial bounds when structure is considered
Provides insights into the solution structure of such polynomial systems
Abstract
We give a bound for the number of real solutions to systems of n polynomials in n variables, where the monomials appearing in different polynomials are distinct. This bound is smaller than the fewnomial bound if this structure of the polynomials is not taken into account.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Coding theory and cryptography · Commutative Algebra and Its Applications
