On Recursion Operator of the q-KP Hierarchy

被引:0
作者
Tian, Ke-Lei [1 ]
Zhu, Xiao-Ming [1 ]
He, Jing-Song [2 ]
机构
[1] Hefei Univ Technol, Sch Math, Hefei 230009, Peoples R China
[2] Ningbo Univ, Dept Math, Ningbo 315211, Zhejiang, Peoples R China
关键词
q-KP hierarchy; flow equations; recursion operator; SATO THEORY; DEFORMATION;
D O I
暂无
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
It is the aim of the present article to give a general expression of flow equations of the q-KP hierarchy. The distinct difference between the q-KP hierarchy and the KP hierarchy is due to q-binomial and the action of q-shift operator theta, which originates from the Leibnitz rule of the quantum calculus. We further show that the n-reduction leads to a recursive scheme for these flow equations. The recursion operator for the flow equations of the q-KP hierarchy under the n-reduction is also derived.
引用
收藏
页码:263 / 268
页数:6
相关论文
共 36 条
[21]   Recursion operator for the intrinsic generalized sine-Gordon equation [J].
Marvan M. ;
Pobořil M. .
Journal of Mathematical Sciences, 2008, 151 (4) :3151-3158
[22]   RECURSION OPERATOR FOR A SYSTEM WITH NON-RATIONAL LAX REPRESENTATION [J].
Zheltukhin, K. .
UFA MATHEMATICAL JOURNAL, 2016, 8 (02) :112-118
[23]   GAUGE TRANSFORMATIONS BETWEEN REDUCED q- KP AND REDUCED q- MKP HIERARCHIES [J].
Huang, Shilong ;
Li, Chuanzhong .
THEORETICAL AND MATHEMATICAL PHYSICS, 2025, 222 (01) :131-139
[24]   The q-deformed mKP hierarchy with two parameters [J].
Tian, Kelei ;
Ge, Yanyan ;
Zhu, Xiaoming .
MODERN PHYSICS LETTERS B, 2018, 32 (16)
[25]   A variety of (3+1)-dimensional KdV equations derived by using the KdV recursion operator [J].
Wazwaz, A. M. .
INDIAN JOURNAL OF PHYSICS, 2016, 90 (05) :577-582
[28]   A variety of (3+1)-dimensional KdV equations derived by using the KdV recursion operator [J].
A M Wazwaz .
Indian Journal of Physics, 2016, 90 :577-582
[30]   The P′-operator, the Q′-curvature, and the CR tractor calculus [J].
Case, Jeffrey S. ;
Gover, A. Rod .
ANNALI DELLA SCUOLA NORMALE SUPERIORE DI PISA-CLASSE DI SCIENZE, 2020, 20 (02) :565-618