Perfect matchings for the three-term Gale-Robinson sequences

Mireille Bousquet-Mélou (1) , James Propp (2) , Julian West (3)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 Department of Mathematics [Lowell]
3 Dept. of Mathematics, University of Victoria

In 1991, David Gale and Raphael Robinson, building on explorations carried out by Michael Somos in the 1980s, introduced a three-parameter family of rational recurrence relations, each of which (with suitable initial conditions) appeared to give rise to a sequence of integers, even though a priori the recurrence might produce non-integral rational numbers. Throughout the '90s, proofs of integrality were known only for individual special cases. In the early '00s, Sergey Fomin and Andrei Zelevinsky proved Gale and Robinson's integrality conjecture. They actually proved much more, and in particular, that certain bivariate rational functions that generalize Gale-Robinson numbers are actually polynomials with integer coefficients. However, their proof did not offer any enumerative interpretation of the Gale-Robinson numbers/polynomials. Here we provide such an interpretation in the setting of perfect matchings of graphs, which makes integrality/polynomiality obvious. Moreover, this interpretation implies that the coefficients of the Gale-Robinson polynomials are positive, as Fomin and Zelevinsky conjectured.

Mots clés: Gale-Robinson sequences; Perfect matchings

Domaines: Combinatoire [math.CO]

Mireille Bousquet-Mélou, James Propp, Julian West. Perfect matchings for the three-term Gale-Robinson sequences. The Electronic Journal of Combinatorics, 2009, 16 (1), paper R125. ⟨hal-00396223⟩