Polya Enumeration Theorem applied to a Google foobar challenge
Nice combinatorial theorem + implementation
For positive integers $w$, $h$, $s$ consider the equivalence classes of $w\times h$ matrices, with entries on the set $S=\{1,2,3,\ldots,s\}$, identified by arbitrary permutations of the rows and the columns. The goal is to compute the number of those classes.
[Read More]