Related papers: Linear relations for Laurent polynomials and latti…
We consider a family of nonlinear recurrences with the Laurent property. Although these recurrences are not generated by mutations in a cluster algebra, they fit within the broader framework of Laurent phenomenon algebras, as introduced…
We consider a two dimensional extension of the so-called linearizable mappings. In particular, we start from the Heideman-Hogan recurrence, which is known as one of the linearizable Somos-like recurrences, and introduce one of its two…
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…
Based on a recursive factorisation technique we show how integrable difference equations give rise to recurrences which possess the Laurent property. We derive non-autonomous Somos-$k$ sequences, with $k=4,5$, whose coefficients are…
A composition of birational maps given by Laurent polynomials need not be given by Laurent polynomials; however, sometimes---quite unexpectedly---it does. We suggest a unified treatment of this phenomenon, which covers a large class of…
We conjecture recurrence relations satisfied by the degrees of some linearizable lattice equations. This helps to prove linear growth of these equations. We then use these recurrences to search for lattice equations that have linear growth…
Fomin and Zelevinsky show that a certain two-parameter family of rational recurrence relations, here called the (b,c) family, possesses the Laurentness property: for all b,c, each term of the (b,c) sequence can be expressed as a Laurent…
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…
We study a recurrence defined on a three dimensional lattice and prove that its values are Laurent polynomials in the initial conditions with all coefficients equal to one. This recurrence was studied by Propp and by Fomin and Zelivinsky.…
We exhibit a family of sequences of noncommutative variables, recursively defined using monic palindromic polynomials in $\mathbb Q[x]$, and show that each possesses the Laurent phenomenon. This generalizes a conjecture by Kontsevich.
We show that Laurent biorthogonal polynomials whose defining three-term recurrence have constant coefficients have coefficient arrays that are Riordan arrays. For each such family of Laurent biorthogonal polynomials we associate in a…
We study the Laurent property, the irreducibility and the coprimeness for lattice equations (partial difference equations), mainly focusing on how the choice of initial value problem (the choice of domain) affects these properties. We show…
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…
In this paper, we undertake a systematic study of recurrences x_{m+n}x_{m} = P(x_{m+1}, ..., x_{m+n-1}) which exhibit the Laurent phenomenon. Some of the most famous among these sequences come from the Somos and the Gale-Robinson…
Six families of generalized hypergeometric series in a variable $x$ and an arbitrary number of parameters are considered. Each of them is indexed by an integer $n$. Linear recurrence relations in $n$ relate these functions and their product…
We show that any graph polynomial from a wide class of graph polynomials yields a recurrence relation on an infinite class of families of graphs. The recurrence relations we obtain have coefficients which themselves satisfy linear…
We provide a simple method to recognize classical orthogonal polynomials on lattices defined only by their coefficients of the three term recurrence relation.
The central idea of this article is to present a systematic approach to construct some recurrence relations for the solutions of the second-order linear difference equation of hypergeometric-type defined on the quadratic-type lattices. We…
Somos 4 sequences are a family of sequences defined by a fourth-order quadratic recurrence relation with constant coefficients. For particular choices of the coefficients and the four initial data, such recurrences can yield sequences of…
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…