University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Discrete Painlev equations for recurrence coefficients of orthogonal polynomials

Discrete Painlev equations for recurrence coefficients of orthogonal polynomials

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani.

Discrete Integrable Systems

All classical orthogonal polynomials in the Askey table (and its q-extension) are orthogonal with respect to a weight w that satisfies a first order differential, (divided) difference or q-difference equation with polynomial coefficients of degree one and less than or equal to two respectively (Pearson equation). Their recurrence coefficients coefficients can be found using this Pearson equation by solving a first order difference equation. Semi-classical weights satisfy a Pearson equation with polynomial coefficients of higher degree. The recurrence coefficients then satisfy higher order difference equations. Many examples have been worked out and we will present some of the semi-classical weights that give rise to discrete Painlev equations for the recurrence coefficients of the orthogonal polynomials. This is joint work with my student Lies Boelen.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity