Develops a recursive finite-window audit chain framework with anti-phantom certificates and propagation theorems for Navier-Stokes generated packages.
Yu, Finite-Window Computational Anti-Phantom Theorems for Scale-Critical Navier– Stokes Defects, arXiv preprint arXiv:2606.15456 [math.AP], 2026
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
math.AP 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
Proves a finite-chain CKN-bad scale counting theorem for 3D Navier-Stokes via standard PDE closure with one-component compactness and an amended canonical detector realization.
Audit of Navier-Stokes obstruction calculus shows existing decompositions locate CKN badness transport but lack coercive estimates, proving a resolution lemma and identifying the need for a filtered stretching-diffusion estimate with subgrid terms.
citing papers explorer
-
Finite-Window Recursive Audit Chains for Navier-Stokes Generated Packages
Develops a recursive finite-window audit chain framework with anti-phantom certificates and propagation theorems for Navier-Stokes generated packages.
-
Finite-Chain CKN-Bad Scale Counting for Navier-Stokes: Standard PDE Closure and Canonical Detector Realization
Proves a finite-chain CKN-bad scale counting theorem for 3D Navier-Stokes via standard PDE closure with one-component compactness and an amended canonical detector realization.
-
A Structural Audit of Navier-Stokes Obstruction Calculus
Audit of Navier-Stokes obstruction calculus shows existing decompositions locate CKN badness transport but lack coercive estimates, proving a resolution lemma and identifying the need for a filtered stretching-diffusion estimate with subgrid terms.