Brandon McCrary

Elimination of the GGHV Branch-(a,b) Normal Form at Degree Pair (72,108): A Certified Computational Audit — Layer Reduction, Top-Layer Classification, and Final Obstruction

This paper eliminates the GGHV branch-(a,b) normal form for the 2D Jacobian conjecture at degree pair (72,108). The main theorem proves that no polynomials P,Q in NewtonNF2 normal form satisfy [P,Q]=λx² with λ≠0, via a certified computational audit: (I) Newton polygon layer reduc...

The (72,108) Candidate for the Planar Jacobian Conjecture: A Containment Note

We record what this audit establishes about GGHV's (8,28) case — the unique uneliminated existence candidate below degree 125 for the planar Jacobian Conjecture, with (deg P, deg Q) = (72,108) — after a source-level audit against arXiv:2204.14178 withdrew the Newton-polygon data,...

Hyper-Literal Reverse Engineering v5: A Formal Methodological Alternative to the Traditional Scientific Method

We give a complete, citable specification of Hyper-Literal Reverse Engineering version 5 (HLRE v5), a formal methodological alternative to the traditional scientific method, designed for investigations in which the researchers — human or artificial — face flexible search spaces,...

On the Boundary Rigidity of the Planar Jacobian Conjecture Below Degree 125: A Computational Audit of the GGHV (72, 108) Candidate

Second edition of a computational audit of the degree-(72,108) Newton-polygon candidate (GGHV Case (c)) for the planar Jacobian conjecture. Reports a Lean 4 machine-checked valuative-properness predicate for the identity, one elementary triangular automorphism, and arbitrary GL_2...