A Gessel-Viennot-type method for cycle systems in a directed graph

Details A Gessel-Viennot-type method for cycle systems in a directed graph A Gessel-Viennot-type method for cycle systems in a directed graph

2005-12-02

arxiv.org/abs/math/0512060v1

Electronic Journal of Combinatorics. Volume 13 (2006). Research Paper 37, 28 pp. (electronic)

Mathematics

Combinatorics

22 pages, 33 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Gessel-Viennot-type method for cycle systems in a directed graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Gessel-Viennot-type method for cycle systems in a directed graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Gessel-Viennot-type method for cycle systems in a directed graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-529803