Laurent phenomenon sequences

In this paper, we undertake a systematic study of sequences generated by recurrences x[subscript m+n]x[subscript m]=P(x[subscript m+1],...,x[subscript m+n−1])xm+nxm=P(xm+1,...,xm+n−1) which exhibit the Laurent phenomenon. Some of the most famous among these are the Somos and the Gale-Robinson sequen...

Full description

Bibliographic Details
Main Authors: Alman, Joshua (Contributor), Cuenca, Cesar (Author), Huang, Jiaoyang (Contributor), Cuenca, Cesar A. (Contributor)
Other Authors: Massachusetts Institute of Technology. Department of Mathematics (Contributor)
Format: Article
Language:English
Published: Springer US, 2016-06-17T17:20:38Z.
Subjects:
Online Access:Get fulltext
Description
Summary:In this paper, we undertake a systematic study of sequences generated by recurrences x[subscript m+n]x[subscript m]=P(x[subscript m+1],...,x[subscript m+n−1])xm+nxm=P(xm+1,...,xm+n−1) which exhibit the Laurent phenomenon. Some of the most famous among these are the Somos and the Gale-Robinson sequences. Our approach is based on finding period 1 seeds of Laurent phenomenon algebras of Lam-Pylyavskyy. We completely classify polynomials P that generate period 1 seeds in the cases of n=2,3 and of mutual binomial seeds. We also find several other interesting families of polynomials P whose generated sequences exhibit the Laurent phenomenon. Our classification for binomial seeds is a direct generalization of a result by Fordy and Marsh, that employs a new combinatorial gadget we call a double quiver.
National Science Foundation (U.S.) (grants DMS-1067183 and DMS-1148634)