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

2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/126551We 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.11 pagesCombinatorics05A15A determinant of Stirling cycle numbers counts unlabeled acyclic single-source automatatext