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

Simple item page
dc.creatorHanusa, Christopher R. H.
dc.date2005-12-02
dc.date.accessioned2026-07-07T06:54:48Z
dc.date.available2026-07-07T06:54:48Z
dc.descriptionWe 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.
dc.description22 pages, 33 figures
dc.identifierhttps://arxiv.org/abs/math/0512060
dc.identifierhttp://arxiv.org/abs/math/0512060
dc.identifierElectronic Journal of Combinatorics. Volume 13 (2006). Research Paper 37, 28 pp. (electronic)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/106070
dc.subjectCombinatorics
dc.subject05B45, 05C30 (Primary) 05A15, 05B20, 05C38, 05C50, 05C70, 11A51, 11B83, 15A15, 15A36, 52C20 (Secondary)
dc.titleA Gessel-Viennot-type method for cycle systems in a directed graph
dc.typetext

Files

Collections

arXiv