Mathematics – Combinatorics
Scientific paper
2007-03-31
Mathematics
Combinatorics
11 pages
Scientific paper
We 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.
No associations
LandOfFree
A determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-552305