Abstract:
Selfadjoint operators on the graph-trees are constructed by means of the difference equations connecting nearest neighbors in the lattice of multiple orthogonal polynomials. This construction generalizes the Jacobi matrices of the recurrence relations for orthogonal polynomials.
Keywords:difference operators on graphs; multiple orthogonal polynomials; discrete integrable systems; spectral and scattering problem.