Related papers: Perfect Matchings and the Octahedron Recurrence
Necessary and sufficient conditions for the regularity of solutions of the functional equation appearing in the theory of classical orthogonal polynomials on lattices are stated. Moreover, the functional Rodrigues formula and a closed…
In this paper we generalize to bivariate polynomials of Fibonacci and Lucas, properties obtained for Chebyshev polynomials. We prove that the coordinates of the bivariate polynomials over appropriate basis are families of integers…
The Congruence Lattice Problem asks whether every algebraic distributive lattice is isomorphic to the congruence lattice of a lattice. It was hoped that a positive solution would follow from E. T. Schmidt's construction or from the approach…
We use the Legendre polynomials and the Hermite polynomials as two examples to illustrate a simple and systematic technique on deriving asymptotic formulas for orthogonal polynomials via recurrence relations. Another application of this…
We consider a one-parameter family of third order nonlinear recurrence relations. Each member of this family satisfies the singularity confinement test, has a conserved quantity, and moreover has the Laurent property: all of the iterates…
The number of lattice points $\left| tP \cap \mathbb{Z}^d \right|$, as a function of the real variable $t>1$ is studied, where $P \subset \mathbb{R}^d$ belongs to a special class of algebraic cross-polytopes and simplices. It is shown that…
We investigate generalizations of the Charlier polynomials on the lattice $\mathbb{N}$, on the shifted lattice $\mathbb{N}+1-\beta$ and on the bi-lattice $\mathbb{N}\cup (\mathbb{N}+1-\beta)$. We show that the coefficients of the three-term…
We prove that the sequence of the characters of the Kirillov-Reshetikhin (KR) modules $W_{m}^{(a)}, m\in \mathbb{Z}_{m\geq 0}$ associated to a node $a$ of the Dynkin diagram of a complex simple Lie algebra $\mathfrak{g}$ satisfies a linear…
The problem of counting polymer coverings on the rectangular lattices is investigated. In this model, a linear rigid polymer covers $k$ adjacent lattice sites such that no two polymers occupy a common site. Those unoccupied lattice sites…
We characterize the Archimedean lattice-ordered algebras with identity that admit a polynomial growth continuous function calculus. More precisely, for an $n$-tuple $\mathbf{x}=(x_1,\dots,x_n)$ in an Archimedean lattice-ordered algebra $X$…
We introduce the notion of a polyptych lattice, which encodes a collection of lattices related by piecewise linear bijections. We initiate a study of the new theory of convex geometry and polytopes associated to polyptych lattices. In…
This work is a study of polynomial compositions having a fixed number of terms. We outline a recursive method to describe these characterizations, give some particular results and discuss the general case. In the final sections, some…
We give four examples of families of orthogonal polynomials for which the coefficients in the recurrence relation satisfy a discrete Painlev\'e equation. The first example deals with Freud weights $|x|^\rho \exp(-|x|^m)$ on the real line,…
We present a version of the domino shuffling algorithm (due to Elkies, Kuperberg, Larsen and Propp) which works on a different lattice: the hexagonal lattice superimposed on its dual graph. We use our algorithm to count perfect matchings on…
Matrix-valued Cauchy bi-orthogonal polynomials were proposed in this paper, together with its quasideterminant expression. It is shown that the coefficients in four-term recurrence relation for matrix-valued Cauchy bi-orthogonal polynomials…
Polynomials $Q_n(z)$, $n=0,1,\ldots,$ that are multi-orthogonal with respect to a Nikishin system of $p\geq 1$ compactly supported measures over the star-like set of $p+1$ rays $S_+:=\{z\in \mathbb{C}: z^{p+1}\geq 0 \}$ are investigated. We…
We prove that the constant terms of powers of a Laurent polynomial satisfy certain congruences modulo prime powers. As a corollary, the generating series of these numbers considered as a function of a p-adic variable satisfies a non-trivial…
This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…
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…
A positive linear recurrence sequence (PLRS) is a sequence defined by a homogeneous linear recurrence relation with positive coefficients and a particular set of initial conditions. A sequence of positive integers is \emph{complete} if…