Related papers: Orthogonal Polynomials and Lattice Path Interpreta…
New sequences of orthogonal polynomials with ultra-exponential weight functions are discovered. In particular, it gives an explicit solution to the Ditkin-Prudnikov problem (1966). The 3-term recurrence relations, explicit representations,…
We study some distributive lattices arising in the combinatorics of lattice paths. In particular, for the Dyck, Motzkin and Schroder lattices we describe the spectrum and we determine explicitly the Euler characteristic in terms of natural…
Orthogonal polynomials and multiple orthogonal polynomials are interesting special functions because there is a beautiful theory for them, with many examples and useful applications in mathematical physics, numerical analysis, statistics…
Multivariate versions of classical orthogonal polynomials such as Jacobi, Hahn, Laguerre and Meixner are reviewed and their connection explored by adopting a probabilistic approach. Hahn and Meixner polynomials are interpreted as posterior…
Limiting cases are studied of the Koornwinder-Macdonald multivariable generalization of the Askey-Wilson polynomials. We recover recently and not so recently introduced families of hypergeometric orthogonal polynomials in several variables…
The purpose of this paper is to present a syatemic study of some familes of higher-order Euler numbers and polynomials. In particular, by using the basis property of higher-order Euler polynomials for the space of polynomials of degree less…
We show how Viennot's combinatorial theory of orthogonal polynomials may be used to generalize some recent results of Sukumar and Hodges on the matrix entries in powers of certain operators in a representation of su(1,1). Our results link…
We investigate semi-classical generalizations of the Charlier and Meixner polynomials, which are discrete orthogonal polynomials that satisfy three-term recurrence relations. It is shown that the coefficients in these recurrence relations…
We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…
Multiple orthogonal polynomials are traditionally studied because of their connections to number theory and approximation theory. In recent years they were found to be connected to certain models in random matrix theory. In this paper we…
This work explores classical discrete multiple orthogonal polynomials, including Hahn, Meixner of the first and second kinds, Kravchuk, and Charlier polynomials, with an arbitrary number of weights. Explicit expressions for the recursion…
We revisit the ladder operators for orthogonal polynomials and re-interpret two supplementary conditions as compatibility conditions of two linear over-determined systems; one involves the variation of the polynomials with respect to the…
Kazhdan-Lusztig-Stanley polynomials are a combinatorial generalization of Kazhdan-Lusztig polynomials of for Coxeter groups that include g-polynomials of polytopes and Kazhdan-Lusztig polynomials of matroids. In the cases of Weyl groups,…
The Motzkin numbers can be derived as coefficients of hybrid polynomials. Such an identification allows the derivation of new identities for this family of numbers and offers a tool to investigate previously unnoticed links with the theory…
Inhomogeneous lattice paths are introduced as ordered sequences of rectangular Young tableaux thereby generalizing recent work on the Kostka polynomials by Nakayashiki and Yamada and by Lascoux, Leclerc and Thibon. Motivated by these works…
We show that several families of polynomials defined via fillings of diagrams satisfy linear recurrences under a natural operation on the shape of the diagram. We focus on key polynomials, (also known as Demazure characters), and Demazure…
We prove a constant term theorem which is useful for finding weight polynomials for Ballot/Motzkin paths in a strip with a fixed number of arbitrary `decorated' weights as well as an arbitrary `background' weight. Our CT theorem, like…
Lanczos methods for solving $\textit{A}\textbf{x}=\textbf{b}$ consist in constructing a sequence of vectors $(\textbf{x}_k), k=1,...$ such that $\textbf{r}_{k}=\textbf{b}-\textit{A}\textbf{x}_{k}=\textit{P}_{k}(\textit{A})\textbf{r}_{0}$,,…
We study modular and integral flow polynomials of graphs by means of subgroup arrangements and lattice polytopes. We introduce an Eulerian equivalence relation on orientations, flow arrangements, and flow polytopes; and we apply the theory…
The $(-1)$-Jacobi, Bannai-Ito, and $(-1)$-Meixner-Pollaczek polynomials are studied in [Trans. Amer. Math. Soc. 364 (2012), 5491-5507], [Adv. Math. 229 (2012), 2123-2158], and [Stud. Appl. Math. 153 (2024), e12728], respectively, through…