Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Laurent phenomenon sequences

Laurent phenomenon sequences

Thumbnail Image
Download
Name

10801_2015_647_ReferencePDF.pdf

Size

408.56 KB

Format

Adobe PDF

Checksum (MD5)

ee749aefa9aecbf6b3d0fad6bf2d038d

Download all files submitted through automated deposit
art_7897701123176627709.zip (336.38 KB)
Author(s)
Alman, Joshua
•
Cuenca, Cesar
•
Huang, Jiaoyang
•
Cuenca, Cesar A.
Date Issued
November 2015
Journal
Journal of Algebraic Combinatorics
Publisher
Springer US
Citation
Alman, Joshua, Cesar Cuenca, and Jiaoyang Huang. “Laurent Phenomenon Sequences.” Journal of Algebraic Combinatorics 43, no. 3 (November 5, 2015): 589–633.
Version
Author's final manuscript
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
http://hdl.handle.net/1721.1/103143
DOI of Published Version
https://doi.org/10.1007/s10801-015-0647-5
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.