The Cube Recurrence

Simple item page
dc.creatorCarroll, Gabriel D.
dc.creatorSpeyer, David E
dc.date2004-03-24
dc.date.accessioned2026-07-07T05:06:42Z
dc.date.available2026-07-07T05:06:42Z
dc.descriptionWe construct a combinatorial model that is described by the cube recurrence, a nonlinear recurrence relation introduced by Propp, which generates families of Laurent polynomials indexed by points in $\mathbb{Z}^3$. In the process, we prove several conjectures of Propp and of Fomin and Zelevinsky, and we obtain a combinatorial interpretation for the terms of Gale-Robinson sequences. We also indicate how the model might be used to obtain some interesting results about perfect matchings of certain bipartite planar graphs.
dc.identifierhttps://arxiv.org/abs/math/0403417
dc.identifierhttp://arxiv.org/abs/math/0403417
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/70577
dc.subjectCombinatorics
dc.titleThe Cube Recurrence
dc.typetext

Files

Collections

arXiv