Algorithms to solve the Sutherland model

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 $1/{\sin }^2$-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.

15 pages, LaTex

Cited by in corpus (13)

• A unified construction of generalised classical polynomials associated with operators of Calogero-Sutherland type
• Explicit solution of the (quantum) elliptic Calogero-Sutherland model
• Remarkable identities related to the (quantum) elliptic Calogero-Sutherland model
• Source identity and kernel functions for elliptic Calogero-Sutherland type systems
• Deformed Calogero-Sutherland model and fractional Quantum Hall effect
• Source identity and kernel functions for Inozemtsev-type systems
• A basis for the polynomial eigenfunctions of deformed Calogero-Moser-Sutherland operators
• Source identities and kernel functions for deformed (quantum) Ruijsenaars models
• Explicit formulas for the eigenfunctions of the N-body Calogero model
• Singular Eigenfunctions of Calogero-Sutherland Type Systems and How to Transform Them into Regular Ones
• A method to derive explicit formulas for an elliptic generalization of the Jack polynomials
• An Explicit Formula for Symmetric Polynomials Related to the Eigenfunctions of Calogero-Sutherland Models
• Series Solutions of the Non-Stationary Heun Equation