14 research outputs found

    Generalized scaling reductions and Painlevé hierarchies

    Get PDF
    We give an alternative derivation of two Painlevé hierarchies. This is done by constructing generalized scaling reductions of the Korteweg-de Vries and dispersive water wave hierarchies. We also construct a generalized scaling reduction of Burgers hierarchy. © 2013 Elsevier Inc. All rights reserved

    A note on the Painleve analysis of a (2+1) dimensional Camassa-Holm equation

    Full text link
    We investigate the Painleve analysis for a (2+1) dimensional Camassa-Holm equation. Our results show that it admits only weak Painleve expansions. This then confirms the limitations of the Painleve test as a test for complete integrability when applied to non-semilinear partial differential equations.Comment: Chaos, Solitons and Fractals (Accepted for publication

    Bäcklund transformations for higher order Painlevé equations

    Get PDF
    We present a new generalized algorithm which allows the construction of Bäcklund transformations (BTs) for higher order ordinary differential equations (ODEs). This algorithm is based on the idea of seeking transformations that preserve the Painlevé property, and is applied here to ODEs of various orders in order to recover, amongst others, their auto-BTs. Of the ODEs considered here, one is seen to be of particular interest because it allows us to show that auto-BTs can be obtained in various ways, i.e. not only by using the severest of the possible restrictions of our algorithm.We present a new generalized algorithm which allows the construction of Bäcklund transformations (BTs) for higher order ordinary differential equations (ODEs). This algorithm is based on the idea of seeking transformations that preserve the Painlevé property, and is applied here to ODEs of various orders in order to recover, amongst others, their auto-BTs. Of the ODEs considered here, one is seen to be of particular interest because it allows us to show that auto-BTs can be obtained in various ways, i.e. not only by using the severest of the possible restrictions of our algorithm
    corecore