The cube recurrence

MaRDI QIDQ1773181zbMATH OpenFDO

Authors Gabriel Carroll, David E Speyer

Publication date 25 April 2005

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0403417, https://eudml.org/doc/124411, http://www.emis.de/journals/EJC/Volume_11/Abstracts/v11i1r73.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

perfect matchingsLaurent polynomialsbipartite planar graphsGale-Robinson sequences

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Special sequences and polynomials (11B83)

Abstract: We 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.

Recommendations

• The multidimensional cube recurrence
• Perfect matchings and the octahedron recurrence
• scientific article; zbMATH DE number 6258608
• Perfect matchings for the three-term Gale-Robinson sequences
• The Laurent phenomenon

Cited in

(25)

• Domino statistics of the two-periodic Aztec diamond
• The Schwarzian octahedron recurrence (dSKP equation) I: explicit solutions
• T-systems, networks and dimers
• A conjecture based on Somos-4 sequence and its extension
• The multidimensional cube recurrence
• Coupled modified KdV equations, skew orthogonal polynomials, convergence acceleration algorithms and Laurent property
• The space of circular planar electrical networks
• The free-fermionic \(C_2^{(1)}\) loop model, double dimers and Kashaev's recurrence
• Electrical response matrix of a regular 2𝑛-gon
• The B-quadrilateral lattice, its transformations and the algebro-geometric construction
• Boundary partitions in trees and dimers
• Linear recurrences for cylindrical networks
• Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on planar graphs
• \(R\)-systems
• A periodicity theorem for the octahedron recurrence
• An arctic circle theorem for groves
• The cluster modular group of the dimer model
• Arctic curves of the six-vertex model on generic domains: the tangent method
• Perfect matchings and the octahedron recurrence
• Asymptotics of multivariate sequences. III: Quadratic points
• Pfaffian formulas for spanning tree probabilities
• Perfect matchings for the three-term Gale-Robinson sequences
• Double-dimers, the Ising model and the hexahedron recurrence
• Quiver combinatorics and triangulations of cyclic polytopes
• Periodicity and integrability for the cube recurrence

This page was built for publication: The cube recurrence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1773181)