Khovanskii Counter

The constructive zero-count bound from MachLib.SingleExpKhovanskii says: for any ExpPoly f(x) = Σ pᵢ(x)·exp(cᵢ·x), the number of real zeros is at most length + Σ deg(pᵢ). The bound is finite — but coarse. Pick a preset and compare against the numerically-found count.

plotting (1 + x) * exp(0 - x) on x ∈ [-5, 5] · zero-crossings (orange dots) found numerically by sign-change scan on a 2400-sample grid.

Khovanskii bound
≤ 2
length = 1 · Σ deg(pᵢ) = 1
from expPoly_auto_bound_with_propagation_aux.
The critically-damped envelope. Khovanskii bound 2; actual zero on ℝ = 1, at x = −1.
numerical zero count on [-5, 5]
1
expected on ℝ: 1 — single zero at x = −1 from the linear factor; exp(−x) > 0 always.
EML cost (via 1op parser) — positive: 6n · general: 8n · naive: 4n