On the Classifications of Scalar Evolution Equations with Non-constant Separant

Abstract

The "separant" of the evolution equation ut=F, where F is some differentiable function of the derivatives of u up to order m is the partial derivative ∂ F/∂ um where um=∂m u/∂ xm. We apply the formal symmetry method proposed in [MSS (1991)] to the classification of scalar evolution equations of orders m 15, with non-trivial (-1)=[∂ F/∂ um]-1/m and rho(1). We obtain the "top level" parts of these equations and their "top dependencies" with respect to the "level grading" defined in [Mizrahi, Bilge (2013)]. We show that if rho(-1) depends on u,u1,…,ub, where b is the base level, then, these equations are level homogeneous polynomials in ub+i,… ,um, i 1 and the coefficient functions are determined up to their dependencies on u,u1,…,ub-1. We prove that if (3) is non-trivial, then (-1)=(α ub2+β ub+γ)1/2, with b 3 while if (3) is trivial, then rho(-1)=(λ ub+μ)1/3, where b 5 and alpha, beta, gamma, lambda and mu are functions of u,…,ub-1. We show that these equations form commuting flows and we construct their recursion operators that are respectively of orders 2 and 6 for non-trivial and trivial rho(3) respectively. Omitting lower order dependencies, we show that equations with non-trivial rho(3) and b=3 are symmetries of the "essentially non-linear third order equation". For trivial rho(3), the equations with b=5 are symmetries of a non-quasilinear fifth order equation obtained in [Bilge,(2005)] while for b=3,4 they are symmetries of quasilinear fifth order equations and we outline the transformations to polynomial equations where u has zero scaling weight, suggesting that the hierarchies that we obtain could be transformable to known equations possibly by introducing non-locality.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…