# Perfect Matchings and the Octahedron Recurrence

• Published in 2004
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 was studied by Propp and by Fomin and Zelivinsky. Fomin and Zelivinsky were able to prove Laurentness and conjectured that the coefficients were 1. Our proof establishes a bijection between the terms of the Laurent polynomial and the perfect matchings of certain graphs, generalizing the theory of Aztec diamonds. In particular, this shows that the coefficients of this polynomial, and polynomials obtained by specializing its variables, are positive, a conjecture of Fomin and Zelevinsky.

### BibTeX entry

@article{Speyer2004a,
abstract = {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 was studied by Propp and by Fomin and Zelivinsky. Fomin and Zelivinsky were able to prove Laurentness and conjectured that the coefficients were 1. Our proof establishes a bijection between the terms of the Laurent polynomial and the perfect matchings of certain graphs, generalizing the theory of Aztec diamonds. In particular, this shows that the coefficients of this polynomial, and polynomials obtained by specializing its variables, are positive, a conjecture of Fomin and Zelevinsky.},
author = {Speyer, David E},
month = {feb},
title = {Perfect Matchings and the Octahedron Recurrence},
url = {http://arxiv.org/abs/math/0402452 http://arxiv.org/pdf/math/0402452v2},
year = 2004,
archivePrefix = {arXiv},
eprint = {math/0402452},
primaryClass = {math.CO},
urldate = {2013-10-09}
}