Algorithms to solve the (quantum) Sutherland model
From MaRDI portal
Abstract: We give a self-contained presentation and comparison of two different algorithms to explicitly solve quantum many body models of indistinguishable particles moving on a circle and interacting with two-body potentials of -type. The first algorithm is due to Sutherland and well-known; the second one is a limiting case of a novel algorithm to solve the elliptic generalization of the Sutherland model. These two algorithms are different in several details. We show that they are equivalent, i.e., they yield the same solution and are equally simple.
Recommendations
- Explicit solution of the (quantum) elliptic Calogero-Sutherland model
- Exact solutions of a new elliptic Calogero-Sutherland model
- Exact solvability of the Calogero and Sutherland models
- An explicit solution of the (quantum) elliptic Calogero-Sutherland model
- Quasi-exactly solvable generalizations of Calogero-Sutherland models
Cites work
Cited in
(8)- Series solutions of the non-stationary Heun equation
- Explicit solution of the (quantum) elliptic Calogero-Sutherland model
- Source identity and kernel functions for Inozemtsev-type systems
- Deformed Calogero-Sutherland model and fractional quantum Hall effect
- Remarkable identities related to the (quantum) elliptic Calogero-Sutherland model
- Source identities and kernel functions for deformed (quantum) Ruijsenaars models
- Source identity and kernel functions for elliptic Calogero-Sutherland type systems
- A unified construction of generalized classical polynomials associated with operators of Calogero-Sutherland type
This page was built for publication: Algorithms to solve the (quantum) Sutherland model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2775026)