Related papers: Lattice Diagram polynomials in one set of variable…
The aim of this work is to study some lattice diagram determinants $\Delta_L(X,Y)$. We recall that $M_L$ denotes the space of all partial derivatives of $\Delta_L$. In this paper, we want to study the space $M^k_{i,j}(X,Y)$ which is defined…
The aim of this work is to study some lattice diagram polynomials $\Delta_D(X,Y)$. We recall that $M_D$ denotes the space of all partial derivatives of $\Delta_D$. In this paper, we want to study the space $M^k_{i,j}(X,Y)$ which is the sum…
The lattice cell in the ${i+1}^{st}$ row and ${j+1}^{st}$ column of the positive quadrant of the plane is denoted $(i,j)$. If $\mu$ is a partition of $n+1$, we denote by $\mu/ij$ the diagram obtained by removing the cell $(i,j)$ from the…
A lattice diagram is a finite set $L=\{(p_1,q_1),... ,(p_n,q_n)\}$ of lattice cells in the positive quadrant. The corresponding lattice diagram determinant is $\Delta_L(\X;\Y)=\det \| x_i^{p_j}y_i^{q_j} \|$. The space $M_L$ is the space…
A lattice diagram is a finite list L=((p_1,q_1),...,(p_n,q_n) of lattice cells. The corresponding lattice diagram determinant is \Delta_L(X;Y)=\det \| x_i^{p_j}y_i^{q_j} \|. These lattice diagram determinants are crucial in the study of the…
The $M$-polynomial of a graph $G$ is defined as $\sum_{i\le j} m_{i,j}(G)x^iy^j$, where $m_{i,j}(G)$, $i,j\ge 1$, is the number of edges $uv$ of $G$ such that $\{d_v(G), d_u(G)\} = \{i,j\}$. Knowing the $M$-polynomial, formulas for bond…
We consider two sequences of orthogonal polynomials $(P_n)_{n\geq 0}$ and $(Q_n)_{n\geq 0}$ such that $$ \sum_{j=1} ^{M} a_{j,n}\mathrm{S}_x\mathrm{D}_x ^k P_{k+n-j} (z)=\sum_{j=1} ^{N} b_{j,n}\mathrm{D}_x ^{m} Q_{m+n-j} (z)\;, $$ with…
Three-term recurrences have infused stupendous amount of research in a broad spectrum of the sciences, such as orthogonal polynomials (in special functions) and lattice paths (in enumerative combinatorics). Among these are the Lucas…
We consider two sequences of orthogonal polynomials $(P_n)_{n\geq 0}$ and $(Q_n)_{n\geq 0}$ with respect regular functionals ${\bf u}$ and ${\bf v}$, respectively. We assume that $$\sum_{j=1} ^{M} a_{j,n}\mathrm{D}_x ^k P_{k+n-j}…
Some particular examples of classical and quantum systems on the lattice are solved with the help of orthogonal polynomials and its connection to continuous models are explored.
We investigate generalizations of the Charlier and the Meixner polynomials on the lattice N and on the shifted lattice N+1-\beta. We combine both lattices to obtain the bi-lattice N \cup (N+1-\beta) and show that the orthogonal polynomials…
We will describe solvable lattice models whose partition functions depend on two sets of variables, $x_1,\cdots,x_n$ and $y_1, y_2, \cdots $ that have different connections with the representation theory of $\text{GL}(n,F)$ where $F$ is a…
Let $\mathcal{T}$ be a collection of 3-element subsets $S$ of $\{1, \ldots,n\}$ with the property that if $i<j<k$ and $a<b<c$ are two 3-element subsets in $S$, then there exists an integer sequence $x_1 < x_2 < \cdots < x_n$ such that $x_i,…
A distributive lattice structure ${\mathbf M}(G)$ has been established on the set of perfect matchings of a plane bipartite graph $G$. We call a lattice {\em matchable distributive lattice} (simply MDL) if it is isomorphic to such a…
We study the set of square-free parts of volume polynomials associated with four planar lattice polytopes. This is motivated by the problem of describing possible pairwise intersection numbers of four curves in $(\mathbb{C}^*)^2$ with…
In this paper we determine, under some mild restrictions, the lattice of submodules $\gL$ of a module $M$ all of whose composition factors have multiplicity one. Such a lattice is distributive, and hence determined by its poset of down-sets…
The concept of permutograph is introduced and properties of integral functions on permutographs are established. The central result characterizes the class of integral functions that are representable as lattice polynomials. This result is…
The purpose of this article is to investigate the combinatorial properties of the cross section lattice of a $J$-irreducible monoid associated with a semisimple algebraic group of one of the types $A_n$, $B_n$, or $C_n$. Our main tool is a…
We study the higher-order Euler polynomials and give the corresponding monic orthogonal polynomials, which are Meixner-Pollaczek polynomials with certain arguments and constant factors. Moreover, through a general connection between moments…
A lattice gauge theory with an action polynomial in independent field variables is considered. The link variables are described by unconstrained complex matrices instead of unitary ones. A mechanism which permits to switch off in the…