I'm back adding more layers to my combinatoric problem to serve as instruction (Black and white balls, probability that no black ball is alone).
The scenario is still the same and straightforward: k distinguishable balls ($j$ black and $k-j$ white) go in $n$ distinguishable boxes with an equal probability without exclusion.
I would this time find the probability of $m$ boxes containing exactly one lone black ball. Using the answers I found for the same problem where all the balls are the same color and help I got for my simpler scenarios, I started by counting the number of ways to arrange the balls so that the $l$th box (we numbered them beforehand) contains one lone black ball:
$$N(l)=j(n−1)^{(k-1)}$$ By extension $$N(l1,l2,..,lo)=j(j-1)...(j-o+1)(n-o)^{(k-o)}$$ with $l1$, $l2$,..., $lo$ being distinct
I do not really understand how to apply inclusion-exclusion for this formula to give the metric I am looking for. I would gladly take any explanation to it :)
If you also know other methods or approaches that arrive to the solution (more or less directly), I'd be happy to try and work on them!
Thanks in advance!
//Emitted formula formatting