Laurent Phenomenon Sequences
Joshua Alman, Cesar Cuenca, Jiaoyang Huang

TL;DR
This paper systematically classifies and explores Laurent phenomenon sequences arising from specific recurrences, extending known results and introducing new combinatorial tools for understanding their structure.
Contribution
It provides a complete classification of polynomials generating period 1 seeds in Laurent phenomenon algebras for certain cases, generalizing previous results with new combinatorial methods.
Findings
Classified polynomials P for n=2,3 and mutual binomial seeds.
Identified new families of polynomials exhibiting the Laurent phenomenon.
Extended the classification of binomial seeds using double quivers.
Abstract
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 recurrences. 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Coding theory and cryptography · Advanced Mathematical Theories and Applications
