A Gessel-Viennot-type method for cycle systems in a directed graph
classification
🧮 math.CO
keywords
methodsystemsazteccycledeterminantaldirectedgraphcount
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.