A Symbolic Algorithm for Computing Recursion Operators of Nonlinear PDEs
D.E. Baldwin, W. Hereman

TL;DR
This paper introduces a symbolic, algorithmic method implemented in Mathematica for computing recursion operators of nonlinear PDEs, aiding in the analysis of their integrability and symmetry structures.
Contribution
The paper presents a new symbolic algorithm and Mathematica package for efficiently computing polynomial recursion operators of (1+1)-dimensional nonlinear PDEs.
Findings
Successfully computed recursion operators for several well-known PDEs.
The method verifies the complete integrability of polynomial PDEs.
Provides a practical tool for researchers in mathematical physics and soliton theory.
Abstract
A recursion operator is an integro-differential operator which maps a generalized symmetry of a nonlinear PDE to a new symmetry. Therefore, the existence of a recursion operator guarantees that the PDE has infinitely many higher-order symmetries, which is a key feature of complete integrability. Completely integrable nonlinear PDEs have a bi-Hamiltonian structure and a Lax pair; they can also be solved with the inverse scattering transform and admit soliton solutions of any order. A straightforward method for the symbolic computation of polynomial recursion operators of nonlinear PDEs in (1+1) dimensions is presented. Based on conserved densities and generalized symmetries, a candidate recursion operator is built from a linear combination of scaling invariant terms with undetermined coefficients. The candidate recursion operator is substituted into its defining equation and the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
