Counting concerns a large part of combinational analysis. Burnsides lemma, sometimes also called Burnsides counting theorem, the Cauchy-Frobenius lemma or the orbit-counting theorem, is often useful... This description may be from another edition of this product.