2000 character limit reached
Integrability test for evolutionary lattice equations of higher order
Published 25 Aug 2014 in nlin.SI | (1408.5726v1)
Abstract: A generalized summation by parts algorithm is presented for solving of difference equations of the form $Tm(y)-a[u]y=b[u]$ where $T$ denotes the shift $u_j\to u_{j+1}$. Solvability of such type of equations with respect to coefficients of formal symmetry (or formal recursion operator) provides a convenient integrability test for evolutionary differential-difference equations $u_{,t}=f(u_{-m},\dots,u_m)$. The algorithm is implemented in {\em Mathematica}.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.