The Cube Recurrence

  title={The Cube Recurrence},
  author={Gabriel D. Carroll and David E Speyer},
  journal={Electron. J. Comb.},
We construct a combinatorial model that is described by the cube recurrence, a quadratic recurrence relation introduced by Propp, which generates families of Laurent polynomials indexed by points in ${\Bbb Z}^3$. In the process, we prove several conjectures of Propp and of Fomin and Zelevinsky about the structure of these polynomials, and we obtain a combinatorial interpretation for the terms of Gale-Robinson sequences, including the Somos-6 and Somos-7 sequences. We also indicate how the model… Expand
Growth Rate of the Cube Recurrence
In this thesis, we first give a brief overview of various recurrence relations that exhibit rich combinatorial structure. Then we provide a detailed description of the cube recurrence, which is aExpand
The multidimensional cube recurrence
Abstract We introduce a recurrence which we term the multidimensional cube recurrence, generalizing the octahedron recurrence studied by Propp, Fomin and Zelevinsky, Speyer, and Fock and GoncharovExpand
Tilings, groves and multiset permutations: asympotics of rational generating functions whose pole set includes a cone
We consider a number of combinatorial problems in which rational generating functions may be obtained, whose denominators have factors with certain singularities. Specifically, there exist coneExpand
Grove Arctic Curves from Periodic Cluster Modular Transformations
Groves are spanning forests of a finite region of the triangular lattice that are in bijection with Laurent monomials that arise in solutions of the cube recurrence. We introduce a large class ofExpand
Asymptotics of multivariate sequences, part III: Quadratic points
Abstract We consider a number of combinatorial problems in which rational generating functions may be obtained, whose denominators have factors with certain singularities. Specifically, there existExpand
Perfect Matchings for the Three-Term Gale-Robinson Sequences
This paper provides an interpretation in the setting of perfect matchings of graphs, which makes integrality/polynomiality obvious and implies that the coefficients of the Gale-Robinson polynomials are positive, as Fomin and Zelevinsky conjectured. Expand
An arctic circle theorem for Groves
This work examines a related combinatorial model called groves, created by Carroll and Speyer as combinatorsial interpretations for Laurent polynomials given by the cube recurrence, which has observable frozen regions which it describes precisely via asymptotic analysis of a generating function. Expand
Combinatorics of Tripartite Boundary Connections for Trees and Dimers
These Pfaffian formulas are used to give exact expressions for reconstruction: reconstructing the conductances of a planar graph from boundary measurements, and similar theorems for the double-dimer model on bipartite planar graphs are proved. Expand
Laurent Polynomials and Superintegrable Maps
This article is dedicated to the memory of Vadim Kuznetsov, and begins with some of the author's recollections of him. Thereafter, a brief review of Somos sequences is provided, with particular focusExpand
A periodicity theorem for the octahedron recurrence
The octahedron recurrence lives on a 3-dimensional lattice and is given by $$f(x,y,t+1)=(f(x+1,y,t)f(x-1,y,t)+f(x,y+1,t)f(x,y-1,t))/f(x,y,t-1)$$. In this paper, we investigate a variant of thisExpand


Perfect matchings and the octahedron recurrence
We study a recurrence defined on a three dimensional lattice and prove that its values are Laurent polynomials in the initial conditions with all coefficients equal to one. This recurrence wasExpand
The Laurent Phenomenon
A unified treatment of the phenomenon of birational maps given by Laurent polynomials is suggested, which covers a large class of applications and settles in the affirmative a conjecture of D. Gale on integrality of generalized Somos sequences. Expand
Alternating sign matrices and domino tilings
We introduce a family of planar regions, called Aztec diamonds, and study the ways in which these regions can be tiled by dominoes. Our main result is a generating function that not only gives theExpand
A New Approach to Solving Three Combinatorial Enumeration Problems on Planar Graphs
The technique of delta-wye graph reduction is shown how to compute the number of spanning trees and perfect matchings, and how to evaluate energy in the Ising “spin glass” model of statistical mechanics. Expand
Applications of graphical condensation for enumerating matchings and tilings
  • Eric H. Kuo
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 2004
A technique called graphical condensation is used to prove various combinatorial identities among numbers of (perfect) matchings of planar bipartite graphs and tilings of regions. GraphicalExpand
The Many Faces of Alternating-Sign Matrices
  • J. Propp
  • Mathematics, Computer Science
  • DM-CCG
  • 2001
I give a survey of different combinatorial forms of alternating-sign matrices, starting with the original form introduced by Mills, Robbins and Rumsey as well as corner-sum matrices, height-functionExpand
Determinants and alternating sign matrices
Let M be an n by n matrix. By a connected minor of M of size k we mean a minor formed from k consecutive rows and k consecutive columns. We give formulas for det M in terms of connected minors, oneExpand
Hirota’s difference equations
A review of selected topics for Hirota’s bilinear difference equation (HBDE) is given. This famous three-dimensional difference equation is known to provide a canonical integrable discretization forExpand
A survey of Hirota's difference equations
A review of selected topics in Hirota's bilinear difference equation (HBDE) is given. This famous 3-dimensional difference equation is known to provide a canonical integrable discretization for mostExpand
Cluster algebras I: Foundations
In an attempt to create an algebraic framework for dual canonical bases and total positivity in semisimple groups, we initiate the study of a new class of commutative algebras.