A Gessel-Viennot-type method for cycle systems in a directed graph
Combinatorics
2007-05-23 v1
Abstract
We introduce a new determinantal method to count cycle systems in a directed graph that generalizes Gessel and Viennot's determinantal method on path systems. The method gives new insight into the enumeration of domino tilings of Aztec diamonds, Aztec pillows, and related regions.
Cite
@article{arxiv.math/0512060,
title = {A Gessel-Viennot-type method for cycle systems in a directed graph},
author = {Christopher R. H. Hanusa},
journal= {arXiv preprint arXiv:math/0512060},
year = {2007}
}
Comments
22 pages, 33 figures