A determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata

Simple item page
dc.creatorCallan, David
dc.date2007-03-31
dc.date.accessioned2026-07-07T07:54:18Z
dc.date.available2026-07-07T07:54:18Z
dc.descriptionWe show that a determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata. The proof involves a bijection from these automata to certain marked lattice paths and a sign-reversing involution to evaluate the determinant.
dc.description11 pages
dc.identifierhttps://arxiv.org/abs/0704.0004
dc.identifierhttp://arxiv.org/abs/0704.0004
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/126551
dc.subjectCombinatorics
dc.subject05A15
dc.titleA determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata
dc.typetext

Files

Collections

arXiv