Papers
Topics
Authors
Recent
Search
2000 character limit reached

Laurent Phenomenon Sequences

Published 3 Sep 2013 in math.CO and math.RT | (1309.0751v2)

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.

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.