论文信息 - A Gessel-Viennot-Type Method for Cycle Systems in a Directed Graph

A Gessel-Viennot-Type Method for Cycle Systems in a Directed Graph

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.

Christopher R. H. Hanusa

[1] William Jockusch. Perfect Matchings and Perfect Squares , 1994, J. Comb. Theory, Ser. A.

[2] N. J. A. Sloane,et al. The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..

[3] Sen-Peng Eu,et al. A Simple Proof of the Aztec Diamond Theorem , 2005, Electron. J. Comb..

[4] P. W. Kasteleyn. The statistics of dimers on a lattice: I. The number of dimer arrangements on a quadratic lattice , 1961 .

[5] Ira M. Gessel,et al. Determinants, Paths, and Plane Partitions , 1989 .

[6] Samuel Karlin,et al. COINCIDENT PROPERTIES OF BIRTH AND DEATH PROCESSES , 1959 .

[7] J. Propp. Enumeration of Matchings: problems and Progress , 1999, math/9904150.

[8] Martin Aigner,et al. Lattice Paths and Determinants , 2001, Computational Discrete Mathematics.

[9] Fuzhen Zhang. The Schur complement and its applications , 2005 .

[10] Jerome Percus,et al. One More Technique for the Dimer Problem , 1969 .

[11] I. Gessel,et al. Binomial Determinants, Paths, and Hook Length Formulae , 1985 .

[12] B. Lindström. On the Vector Representations of Induced Matroids , 1973 .

[13] Stephen J. Kirkland,et al. Aztec diamonds and digraphs, and Hankel determinants of Schröder numbers , 2005, J. Comb. Theory, Ser. B.