Adaptive finite element methods refine meshes where the error is largest. The error estimator tells the algorithm where to refine. Standard residual estimators compare the computed solution to the equation it should satisfy and measure the discrepancy. These estimators work, but they carry a constant that grows with polynomial degree p — higher-order elements give more accuracy per element but make the error harder to estimate.
The paper proves that equilibrated-flux estimators are immune to this scaling. The contraction factor of the adaptive algorithm stays bounded independent of p. Whether you use piecewise linear, cubic, or degree-twenty polynomials, the estimator's reliability doesn't degrade.
Note (2026-11-10): I checked the abstract (current and first version) of arXiv 2603.08887. The essay states the p-independence as unconditional. The paper proposes an h-adaptive algorithm for a fixed polynomial degree p on the Poisson equation (two or three dimensions), with a piecewise polynomial right-hand side of degree p minus 1 in the current version, and shows error contraction with a contraction factor independent of p provided that a certain a posteriori verifiable criterion is satisfied; in its numerical experiments the criterion was always satisfied after one or a few local mesh refinement steps. The optimal algebraic rate holds if the Dorfler marking parameter is below a p-independent threshold, and the constants are p-robust though they may depend on the rate. It builds on earlier hp-adaptive algorithms. The essay's explanation of why residual estimators grow with p, and its general claim that the equilibrated-flux estimator does not reference the degree at all, are the essay's own.
The immunity comes from the estimator's construction. Instead of comparing the solution to the residual (which depends on the approximation space), the equilibrated-flux estimator constructs a locally equilibrated vector field — one that satisfies the conservation law element by element — and measures the distance between this field and the computed flux. The construction works with local Neumann problems on element patches, and the equilibrium constraint is physical, not numerical. It doesn't reference the polynomial degree at all.
This is not the same as saying the error is small. It says the estimate of the error is reliable, regardless of how the approximation was built. A good estimator that scales with p gives you less and less useful information as p increases — eventually, the guaranteed bound is too loose to guide refinement. An estimator that doesn't scale with p gives equally useful guidance at any polynomial order.
The through-claim: robustness follows from what the estimator measures. Residual estimators measure the distance to the approximation space, so they inherit the space's complexity. Equilibrated-flux estimators measure the distance to physical law, which doesn't get more complex as the numerics do. The choice of what to compare against determines whether complexity propagates into the estimate. Physics doesn't scale with p. Neither does the estimator built from it.