2000
DOI: 10.1016/s0375-9601(00)00226-7
|View full text |Cite
|
Sign up to set email alerts
|

The finite difference algorithm for higher order supersymmetry

Abstract: The higher order supersymmetric partners of the Schroedinger's Hamiltonians can be explicitly constructed by iterating a simple finite difference equation corresponding to the Baecklund transformation. The method can completely replace the Crum determinants. Its limiting, differential case offers some new operational advantages.Comment: LaTeX, 12 pages, 3 figures. To appear in Phys. Lett.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
135
0

Year Published

2001
2001
2020
2020

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 104 publications
(135 citation statements)
references
References 36 publications
0
135
0
Order By: Relevance
“…This idea has been kept also in subsequent works [5,19], and in all of these articles the algorithm has been shown to be of use for obtaining new exactly solvable Hamiltonians. Moreover, the proof of Theorem 4.1 given recently by Mielnik, Nieto and Rosas-Ortiz, alternative to that which has been given here, still relies on the idea of iteration of the intertwining technique, see [28,Sec. 2] for details.…”
Section: Finite Difference Algorithm and Intertwined Hamiltonians Fromentioning
confidence: 93%
See 2 more Smart Citations
“…This idea has been kept also in subsequent works [5,19], and in all of these articles the algorithm has been shown to be of use for obtaining new exactly solvable Hamiltonians. Moreover, the proof of Theorem 4.1 given recently by Mielnik, Nieto and Rosas-Ortiz, alternative to that which has been given here, still relies on the idea of iteration of the intertwining technique, see [28,Sec. 2] for details.…”
Section: Finite Difference Algorithm and Intertwined Hamiltonians Fromentioning
confidence: 93%
“…Theorem 4.1 (Finite difference Bäcklund algorithm [4,28,34,35]). Let w k (x), w l (x) be two solutions of the Riccati equations…”
Section: Transformation Group On the Set Of Riccati Equationsmentioning
confidence: 99%
See 1 more Smart Citation
“…2 (x) we have An important result that will be proven next is that the solution of the Riccati equation (2.11b) for α 2 can be algebraically determined using the solutions of the initial Riccati equation (2.5b) for the factorization energies 1 and 2 [16][17][18][19][20]. To do that, first let us take the two solutions of the initial Riccati equation…”
Section: Higher-order Susy Qmmentioning
confidence: 99%
“…These equations immediately lead to the higher-order SUSY QM [16][17][18][19][20][21][22][23][24][25][26][27][28][29]. In this treatment, the standard SUSY algebra with two generators…”
Section: Higher-order Susy Qmmentioning
confidence: 99%