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

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-552305

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.