Papers
Topics
Authors
Recent
Search
2000 character limit reached

Linear relations for Laurent polynomials and lattice equations

Published 23 Dec 2019 in nlin.SI and math.CO | (1912.11116v2)

Abstract: A recurrence relation is said to have the Laurent property if all of its iterates are Laurent polynomials in the initial values with integer coefficients. We consider a family of nonlinear recurrences with the Laurent property, which were derived by Alman et al. via a construction of periodic seeds in Laurent phenomenon algebras, and generalize the Heideman-Hogan recurrences. Each member of the family is shown to be linearizable, in the sense that the iterates satisfy linear recurrence relations with constant coefficients. The latter are obtained from linear relations with periodic coefficients, which were found recently by Kamiya et al. from travelling wave reductions of a linearizable lattice equation on a 6-point stencil. We introduce another linearizable lattice equation on the same stencil, and present the corresponding linearization for its travelling wave reductions. Finally, for both of the 6-point lattice equations considered, we use the formalism of van der Kamp to construct a broad class of initial value problems with the Laurent property.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.