Title: A Markov Chain Application on Multi-restricted Stirling numbers
Speaker: Ji Young Choi, DIMACS Visitor
Date: Wednesday, December 1, 2010 12:10pm
Location: Graduate Student Lounge, 7th Floor, Hill Center, Rutgers University, Busch Campus, Piscataway, NJ
Cows are drawn one after the other from a farm initially containing r whites, according to the following scheme: if white is drawn, place a black cow in the farm; if black is drawn, put it back. What is the probability to draw k white cows in n trials, if each black cow can be drawn no more than m times? In this talk, the solution for the above question will be presented using the Multi-restricted Stirling numbers of the second kind, which is the number of partitions of an n set with k nonempty subsets of size less than or equal to m.