Related papers: Orthogonal Polynomials and Lattice Path Interpreta…
Preorder polytopes, defined from preorders on finite sets, are introduced and studied from a lattice point enumeration point of view. They naturally generalize arbor polytopes, recently introduced and studied by the second named author.…
Multivariate orthogonal polynomials can be introduced by using a moment functional defined on the linear space of polynomials in several variables with real coefficients. We study the so-called Uvarov and Christoffel modifications obtained…
We introduce machine learning methodology to the study of lattice polytopes. With supervised learning techniques, we predict standard properties such as volume, dual volume, reflexivity, etc, with accuracies up to 100%. We focus on 2d…
We show that the planar orthogonal polynomials with $l$ logarithmic singularities in the potential are the multiple orthogonal polynomials (Hermite-Pad\'e polynomials) of Type II with $l$ measures. We also find the ratio between the…
We construct new elliptic solutions of the restricted Toda chain. These solutions give rise to a new explicit class of orthogonal polynomials which can be considered as a generalization of the Stieltjes-Carlitz elliptic polynomials.…
The linearization coefficients for a set of orthogonal polynomials are given explicitly as a weighted sum of combinatorial objects. Positivity theorems of Askey and Szwarc are corollaries of these expansions.
Zernike polynomials are a basis of orthogonal polynomials on the unit disk that are a natural basis for representing smooth functions. They arise in a number of applications including optics and atmospheric sciences. In this paper, we…
We present an algebraic theory of orthogonal polynomials in several variables that includes classical orthogonal polynomials as a special case. Our bottom line is a straightforward connection between apolarity of binary forms and the inner…
We use the ordinary Euler operator to compute the Ehrhart series for an arbitrary lattice polytope. The resulting formula involves the coefficients of the Ehrhart polynomial, combined via Eulerian numbers. We use this to compute $h^*_{d-1}$…
In this paper, we study umbral calculus to have alternative ways of obtaining our results. That is, we derive some interesting identities of the higher-order Bernoulli, Euler and Hermite polynomials arising from umbral calculus to have…
We introduce orthogonal polynomials $M_j^{\mu,\ell}(x)$ as eigenfunctions of a certain self-adjoint fourth order differential operator depending on two parameters $\mu\in\mathbb{C}$ and $\ell\in\mathbb{N}_0$. These polynomials arise as…
A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…
This article studies a large, general class of orthogonal polytopes which we may call "generic orthotopes". These objects emerged from a desire to represent a Coxeter complex by an orthogonal polytope that is particularly nice with respect…
In this work, we define a more general family of polynomials in several variables satisfying a linear recurrence relation. Then we provide explicit formulas and determinantal expressions. Finally, we apply these results to recurrent…
We solve the difference equation with linear coefficients by the Momentenansatz to obtain explicit formulas for orthogonal polynomials.
Various recurrence relations between formal orthogonal polynomials can be used to derive Lanczos-type algorithms. In this paper, we consider recurrence relation $A_{12}$ for the choice $U_i(x)=P_i(x)$, where $U_i$ is an auxiliary family of…
Many mathematicians have been studying various degenerate versions of special polynomials and numbers in some arithmetic and combinatorial aspects. Our main focus here is a new type of degenerate poly-Euler polynomials and numbers. This…
We show combinatorially that the higher-order matching polynomials of several families of graphs are d-orthogonal polynomials. The matching polynomial of a graph is a generating function for coverings of a graph by disjoint edges; the…
Matrix polynomials given in an orthogonal basis are considered. Following the ideas of Mackey et al. "Vector spaces of Linearizations for Matrix Polynomials" (2006), the vec- tor spaces, called M1(P), M2(P) and DM(P), of potential…
Sequences of bivariate orthogonal polynomials written as vector polynomials of increasing size satisfy a couple of three term relations with matrix coefficients. In this work, introducing a time-dependent parameter, we analyse a Lax-type…