Rahman polynomials

Abstract

Two very closely related Rahman polynomials are constructed explicitly as the left eigenvectors of certain multi-dimensional discrete time Markov chain operators Kn(i)( x, y;N), i=1,2. They are convolutions of an n+1-nomial distribution Wn( x;N) and an n-tuple of binomial distributions ΠiW1(xi;N). The one for the original Rahman polynomials is Kn(1)( x, y;N) =Σ zWn( x- z;N-Σizi) ΠiW1(zi;yi). The closely related one is \ Kn(2)( x, y;N) =Σ zWn( x- z;N-Σiyi) ΠiW1(zi;yi). The original Markov chain was introduced and discussed by Hoare, Rahman and Gr\"unbaum as a multivariable version of the known soluble single variable one. The new one is a generalisation of that of Odake and myself. The anticipated solubility of the model gave Rahman polynomials the prospect of the first multivariate hypergeometric function of Aomoto-Gelfand type connected with solvable dynamics. The promise is now realised. The n2 system parameters \ui\,j\ of the Rahman polynomials are completely determined. These ui\,j's are irrational functions of the original system parameters, the probabilities of the multinomial and binomial distributions.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…