The EML Operator and the Complexity Structure of the Riemann Explicit Formula

We study the expression complexity of the Riemann explicit formula from the perspective of grammar-based symbolic regression. Starting from the EML operator eml(a,b) = exp(a) − log(b), we show that this operator fails to produce oscillatory terms and therefore cannot encode the explicit-formula structure. We then derive a replacement operator eml_zeta(g, t) = (cos(γt) + 2γ sin(γt)) / (¼ + γ²) directly from the decomposition of x^ρ/ρ on the critical line Re(ρ) = ½. This operator encodes the const