IJPAM: Volume 82, No. 3 (2013)


Yutaka Nishiyama
Department of Business Information
Faculty of Information Management
Osaka University of Economics
2, Osumi Higashiyodogawa Osaka, 533-8533, JAPAN

Abstract. There is a famous problem which involves discriminating the faces of a die using 3 colors: how many different patterns can be produced? This article introduces Burnside's lemma which is a powerful method for handling such problems. It requires a knowledge of group theory, but is not so difficult and is likely to be understood by elementary school pupils.

Received: September 25, 2012

AMS Subject Classification: 19A22, 00A09, 97A20

Key Words and Phrases: Burnside's counting theorem, Pólya's formula, permutation, orbit, invariant, equivalence, equivalence class

Download paper from here.

Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2013
Volume: 82
Issue: 3