111 research outputs found
Graphical condensation of plane graphs: a combinatorial approach
The method of graphical vertex-condensation for enumerating perfect matchings
of plane bipartite graph was found by Propp (Theoret. Comput. Sci. 303(2003),
267-301), and was generalized by Kuo (Theoret. Comput. Sci. 319 (2004), 29-57)
and Yan and Zhang (J. Combin. Theory Ser. A, 110(2005), 113-125). In this
paper, by a purely combinatorial method some explicit identities on graphical
vertex-condensation for enumerating perfect matchings of plane graphs (which do
not need to be bipartite) are obtained. As applications of our results, some
results on graphical edge-condensation for enumerating perfect matchings are
proved, and we count the sum of weights of perfect matchings of weighted Aztec
diamond.Comment: 13 pages, 5 figures. accepted by Theoretial Computer Scienc
Proof of Blum's conjecture on hexagonal dungeons
Matt Blum conjectured that the number of tilings of the Hexagonal Dungeon of
sides (where ) is
(J. Propp, New Perspectives in
Geometric Combinatorics, Cambridge University Press, 1999). In this paper we
present a proof for this conjecture using Kuo's Graphical Condensation Theorem
(E. Kuo, Applications of Graphical Condensation for Enumerating Matchings and
Tilings, Theoretical Computer Science, 2004).Comment: 30 page
The Cube Recurrence
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 . 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
- …