paper

Parameterwise Sharpness of Khovanskii's Bezout-type Bound for Pfaffian Functions

arXiv:2606.24373

Abstract

Khovanskii's theorem gives a Bezout-type upper bound for the number of isolated real solutions of a system of Pfaffian equations in variables in terms of three complexity parameters: the chain-degree , the degrees of the Pfaffian functions, and the order of the underlying Pfaffian chain. Despite its fundamental role in Pfaffian geometry and o-minimality, little is known about the sharpness of this bound. We investigate the theorem from a parameter-by-parameter perspective. We show that its dependence on the chain-degree is asymptotically sharp by constructing, for every , a Pfaffian function of format with at least nondegenerate real zeros. We also show that its dependence on the degrees is asymptotically sharp: for fixed and , we construct Pfaffian systems having $Ω_{n,s}(β^{n+s})$ regular common zeros, matching the order of growth predicted by Khovanskii's theorem as .

v1: 22 pages, 1 figure v2: Tightened exposition, and small change to title

Parameterwise Sharpness of Khovanskii's Bezout-type Bound for Pfaffian Functions · wovepaper