Related papers: Perfect Matchings and the Octahedron Recurrence
Dolgachev proved that, for any field k, the ring naturally associated to a generic Laurent polynomial in d variables, $d \geq 4$, is factorial. We prove a sufficient condition for the ring associated to a very general complex Laurent…
It is well-known that Leonard pairs have a close connection with bispectral orthogonal polynomials of the Askey scheme. In this paper, we introduce the notion of a Leonard trio $(V,\oV,Z)$, an algebraic structure extending Leonard pairs,…
Generalizing the famous Bernstein-Kushnirenko Theorem, Khovanskii proved in 1978 a combinatorial formula for the arithmetic genus of the compactification of a generic complete intersection associated to a family of lattice polytopes.…
The Alexander polynomial (1928) is the first polynomial invariant of links devised to help distinguish links up to isotopy. Fox's conjecture (1962) -- stating that the absolute values of the coefficients of the Alexander polynomial for any…
Heckman and Opdam introduced a non-symmetric analogue of Jack polynomials using Cherednik operators. In this paper, we derive a simple recursion formula for these polynomials and formulas relating the symmetric Jack polynomials with the…
We generalize the polynomial Szemer\'{e}di theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new…
We consider a family of nonlinear rational recurrences of odd order which was introduced by Heideman and Hogan. All of these recurrences have the Laurent property, implying that for a particular choice of initial data (all initial values…
In recent work it was shown how recursive factorisation of certain QRT maps leads to Somos-4 and Somos-5 recurrences with periodic coefficients, and to a fifth-order recurrence with the Laurent property. Here we recursively factorise the…
Erman, Smith, and V\'arilly-Alvarado showed that the expected number of doubly monic Laurent polynomials $f(z) = z^{-m} + a_{-m+1}z^{-m+1} + \cdots + a_{n-1}z^{n-1} + z^n$ whose first $m+n-1$ powers have vanishing constant term is the…
Recently, a new characterization of Lyndon words that are also perfectly clustering was proposed by Lapointe and Reutenauer (2024). A word over a ternary alphabet {a,b,c} is called perfectly clustering Lyndon if and only if it is the…
It is shown that the polynomial \[p(t) = \text{Tr}[(A+tB)^m]\] has positive coefficients when $m = 6$ and $A$ and $B$ are any two 3-by-3 complex Hermitian positive definite matrices. This case is the first that is not covered by prior,…
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…
Polynomials with coefficients in $\{-1,1\}$ are called Littlewood polynomials. Using special properties of the Rudin-Shapiro polynomials and classical results in approximation theory such as Jackson's Theorem, de la Vall\'ee Poussin sums,…
Polynomial ensembles are determinantal point processes associated with (non necessarily orthogonal) projections onto polynomial subspaces. The aim of this survey article is to put forward the use of recurrence coefficients to obtain the…
We describe a family of polynomials discovered via a particular recursion relation, which have connections to Chebyshev polynomials of the first and the second kind, and the polynomial version of Pell's equation. Many of their properties…
We compare two methods for analysing periodic dimer models. These are the matrix-valued orthogonal polynomials approach due to Duits and one of the authors, and the Wiener-Hopf approach due to Berggren and Duits. We establish their…
It is shown that monic orthogonal polynomials on the unit circle are the characteristic polynomials of certain five-diagonal matrices depending on the Schur parameters. This result is achieved through the study of orthogonal Laurent…
We discuss the relationship between the recurrence coefficients of orthogonal polynomials with respect to a semi-classical Laguerre weight and classical solutions of the fourth Painlev\'e equation. We show that the coefficients in these…
We obtain a recurrence relation for the f-polynomial of Gelfand-Zetlin polytopes by analyzing geometric properties of a linear projection of the Gelfand-Zetlin polytope onto a cube. We apply this recurrence relation to find explicit…
The enumeration of perfect matchings of graphs is equivalent to the dimer problem which has applications in statistical physics. A graph $G$ is said to be $n$-rotation symmetric if the cyclic group of order $n$ is a subgroup of the…