{"title":"Improved fewnomial upper bounds from Wronskians and dessins d'enfant","authors":"Boulos El Hilany, Sébastien Tavenas","doi":"arxiv-2409.01651","DOIUrl":null,"url":null,"abstract":"We use Grothendieck's dessins d'enfant to show that if $P$ and $Q$ are two\nreal polynomials, any real function of the form $x^\\alpha(1-x)^{\\beta} P - Q$,\nhas at most $\\deg P +\\deg Q + 2$ roots in the interval $]0,~1[$. As a\nconsequence, we obtain an upper bound on the number of positive solutions to a\nreal polynomial system $f=g=0$ in two variables where $f$ has three monomials\nterms, and $g$ has $t$ terms. The approach we adopt for tackling this Fewnomial\nbound relies on the theory of Wronskians, which was used in Koiran et.\\ al.\\\n(J.\\ Symb.\\ Comput., 2015) for producing the first upper bound which is\npolynomial in $t$.","PeriodicalId":501036,"journal":{"name":"arXiv - MATH - Functional Analysis","volume":"62 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Functional Analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.01651","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We use Grothendieck's dessins d'enfant to show that if $P$ and $Q$ are two
real polynomials, any real function of the form $x^\alpha(1-x)^{\beta} P - Q$,
has at most $\deg P +\deg Q + 2$ roots in the interval $]0,~1[$. As a
consequence, we obtain an upper bound on the number of positive solutions to a
real polynomial system $f=g=0$ in two variables where $f$ has three monomials
terms, and $g$ has $t$ terms. The approach we adopt for tackling this Fewnomial
bound relies on the theory of Wronskians, which was used in Koiran et.\ al.\
(J.\ Symb.\ Comput., 2015) for producing the first upper bound which is
polynomial in $t$.