Polynomial-budget normalization of arbitrary Pfaffian presentations

Construct, or determine whether there exists, a normalization for every raw Pfaffian presentation that yields the anchored unit-range anti-concentration guarantees with polynomially bounded parameter budgets.

Background

The paper’s anchored normalization assumes a bounded Pfaffian chain and an explicit constant anchor function. Under those assumptions it derives finite projective-speed and root-hitting bounds, including a polynomial specialization.

The authors distinguish this restricted result from the unresolved general normalization problem for arbitrary raw Pfaffian presentations.

References

Whether every raw Pfaffian presentation admits this normalization with polynomial parameter budgets remains open.

VALG: An Agentic System for ML Theory Research  (2608.13060 - Zhang et al., 13 Aug 2026) in Section 4, Subproblem 2: Pfaffian Boundaries, Discussion