BUDAN-FOURIER THEOREM FOR CIRCUIT POLYNOMIAL SYSTEMS
Abstract
We prove a Budan-Fourier theorem for linear combinations of analytic functions whose successive Wronskians are positive: the number of zeros of g = s k=1 c k h k in an interval (a, b], counted with multiplicities, is bounded by the drop of the number of sign changes of the sequence of Wronskians W (h 1 , . . . , h k-1 , g) between a and b, and the difference is even. This refines the bound s -1 of Koiran, Portier and Tavenas, and we show that it applies, after a suitable renumbering, to any sequence of functions satisfying Descartes' rule of signs. We then study the functions arising from polynomial systems supported on circuits, that is, systems of n equations in n variables with n + 2 monomials. For these functions, we show that the Budan-Fourier bound never exceeds Descartes' bound, and we compute it at the endpoints of the interval of definition. As an application, we obtain a refinement of the optimal Descartes' rule of signs for circuits of Bihan, Dickenstein and Forsgård: we bound the number of positive solutions whose logarithm lies in explicit polytopes, these bounds add up to at most the bound of Bihan, Dickenstein and Forsgård, and they determine the parity of the number of positive solutions.
Related
- A functional central limit theorem for particle systems under polynomial growth conditions, with applications to statistics
- Fourier-Laplace transforms in polynomial Ornstein-Uhlenbeck volatility models
- Norm bounds on Fourier series with polynomial spectra and constrained coefficients
- Local Shellings of Broken-Circuit Complexes via Boundary States and the Chromatic Specialization of the Negami Polynomial
- The Negami Polynomial and Broken-Circuit Stanley--Reisner Rings
BibTeX
@misc{bihan2026budanfourier,
title = {{BUDAN-FOURIER THEOREM FOR CIRCUIT POLYNOMIAL SYSTEMS}},
author = {Frédéric Bihan},
howpublished = {HAL},
year = {2026},
month = oct,
url = {https://hal.science/hal-05840734v1},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - BUDAN-FOURIER THEOREM FOR CIRCUIT POLYNOMIAL SYSTEMS
AU - Frédéric Bihan
PY - 2026
DA - 2026/10/27
PB - HAL
UR - https://hal.science/hal-05840734v1
AB - We prove a Budan-Fourier theorem for linear combinations of analytic functions whose successive Wronskians are positive: the number of zeros of g = s k=1 c k h k in an interval (a, b], counted with multiplicities, is bounded by the drop of the number of sign changes of the sequence of Wronskians W (h 1 , . . . , h k-1 , g) between a and b, and the difference is even. This refines the bound s -1 of Koiran, Portier and Tavenas, and we show that it applies, after a suitable renumbering, to any sequence of functions satisfying Descartes' rule of signs. We then study the functions arising from polynomial systems supported on circuits, that is, systems of n equations in n variables with n + 2 monomials. For these functions, we show that the Budan-Fourier bound never exceeds Descartes' bound, and we compute it at the endpoints of the interval of definition. As an application, we obtain a refinement of the optimal Descartes' rule of signs for circuits of Bihan, Dickenstein and Forsgård: we bound the number of positive solutions whose logarithm lies in explicit polytopes, these bounds add up to at most the bound of Bihan, Dickenstein and Forsgård, and they determine the parity of the number of positive solutions.
ER -