A Gessel--Viennot-type method for cycle systems in a directed graph (Q2500956)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5050755
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Gessel--Viennot-type method for cycle systems in a directed graph |
scientific article; zbMATH DE number 5050755 |
Statements
A Gessel--Viennot-type method for cycle systems in a directed graph (English)
0 references
30 August 2006
0 references
Summary: 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.
0 references
determinantal method
0 references
cycle systems
0 references
directed graph
0 references
path systems
0 references
domino tilings
0 references
Aztec diamonds
0 references
Aztec pillows
0 references
0.7693464159965515
0 references
0.7271121740341187
0 references
0.7271118760108948
0 references
0.7179513573646545
0 references
0.7179510593414307
0 references
