... be worth mentioning that the cube recurrence can be written in a slightly more symmetrical fashion than above: the families of functions (fi,j,k ) satisfying the cube recurrence can be made to ... fi,j−1,k fi−1,j,k−1 + fi,j,k−1fi−1,j−1,k (i + j + k > 1) Fomin and Zelevinsky showed in [4] that the cube recurrence also generates Laurent polynomials and conjectured that all the coefficients of these ... that are in bijection with the terms of these Laurent polynomials, under a generalized form of the cube recurrence; Propp’s observations, among other interesting results, will then follow directly...