×

Extended \(N=2\) supersymmetric matrix \((1,s)\)-KdV hierarchies. (English) Zbl 0984.37080

Summary: We propose the Lax operators for \(N=2\) supersymmetric matrix generalization of the bosonic \((1,s)\)-KdV hierarchies. The simplest examples – the \(N=2\) supersymmetric \(a=4\) KdV and \(a={5}/{2}\) Boussinesq hierarchies – are discussed in detail.

MSC:

37K10 Completely integrable infinite-dimensional Hamiltonian and Lagrangian systems, integration methods, integrability tests, integrable hierarchies (KdV, KP, Toda, etc.)
35Q53 KdV equations (Korteweg-de Vries equations)

References:

[1] Labelle, P.; Mathieu, P., J. Math. Phys., 32, 923 (1991) · Zbl 0736.35100
[2] Popowicz, Z., Phys. Lett. B, 319, 478 (1993)
[3] Yung, C. M.; Warner, R. C., J. Math. Phys., 34, 4050 (1993) · Zbl 0789.17020
[4] Bonora, L.; Krivonos, S.; Sorin, A., Nucl. Phys. B, 477, 835 (1996) · Zbl 0925.81302
[5] Delduc, F.; Gallot, L., Commun. Math. Phys., 190, 395 (1997) · Zbl 0908.35116
[6] Bonora, L.; Krivonos, S.; Sorin, A., Lett. Math. Phys., 45, 63 (1998) · Zbl 0913.35124
[7] Bonora, L.; Liu, Q. P.; Xiong, C. S., Commun. Math. Phys., 175, 177 (1996) · Zbl 0848.35127
[8] V. Gribanov, S. Krivonos, A. Sorin, The Lax-pair representation for the \(Na = 52\); V. Gribanov, S. Krivonos, A. Sorin, The Lax-pair representation for the \(Na = 52\)
[9] A. Sorin, The discrete symmetries of the \(N\); A. Sorin, The discrete symmetries of the \(N\) · Zbl 0913.35124
[10] Krivonos, S.; Sorin, A.; Toppan, F., Phys. Lett. A, 206, 146 (1995) · Zbl 1020.37533
[11] F. Delduc, L. Gallot, private communication.; F. Delduc, L. Gallot, private communication.
[12] Krivonos, S.; Sorin, A., Phys. Lett. B, 357, 94 (1995)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.