2001
DOI: 10.1016/s0034-4877(01)80061-6
|View full text |Cite
|
Sign up to set email alerts
|

On the construction of recursion operator and algebra of symmetries for field and lattice systems

Abstract: In the paper, developing the idea of V.Sokolov et all. (J.Math.Phys. 40 (1999) 6473) we construct recursion operators and hereditary algebra of symmetries for many field and lattice systems.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
29
0

Year Published

2002
2002
2021
2021

Publication Types

Select...
8
2

Relationship

1
9

Authors

Journals

citations
Cited by 17 publications
(29 citation statements)
references
References 12 publications
0
29
0
Order By: Relevance
“…Among others, the authors illustrated the method by applying it to finite-field reductions of the KP hierarchy. In [19] the method was applied to the reductions of the modified KP hierarchy as well as to the lattice systems. Our further considerations are based on the scheme from [10] and [19].…”
Section: Recursion Operatorsmentioning
confidence: 99%
“…Among others, the authors illustrated the method by applying it to finite-field reductions of the KP hierarchy. In [19] the method was applied to the reductions of the modified KP hierarchy as well as to the lattice systems. Our further considerations are based on the scheme from [10] and [19].…”
Section: Recursion Operatorsmentioning
confidence: 99%
“…If the Lax representation of an evolutionary equation is known, an amazingly simple approach to construct a recursion operator was proposed in [17] and later applied for lattice equations [7]. This idea can also be used for Lax pairs that are invariant under a reduction group [45,20,10].…”
Section: From the Lax Representation To The Recursion Operatormentioning
confidence: 99%
“…If the Lax representation of an evolutionary equation is known, an amazingly simple approach to construct a recursion operator was proposed in [25] and later applied for lattice equations [26]. This idea can be used for Lax pairs that are invariant under the reduction groups [20].…”
Section: Construction Of Recursion Operators From a Lax Representationmentioning
confidence: 99%