PólyasTheorem.PDF

EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 9, No. 1, 2016, 84-113 ISSN 1307-5543 – Counting Symmetries with Burnside’s Lemma and Pólya’s Theorem Md. Tau?q Nasseef Department of Mathematics, School of Mathematics,Statistics and Actuarial Science , University of Kent, Kent, United Kingdom Abstract. Counting concerns a large part of combinational analysis. Burnside’s lemma, sometimes also called Burnside’s counting theorem, the Cauchy-Frobenius lemma or the orbit-counting theorem [5], is often useful in taking account of symmetry when counting mathematical objects. The Pólya’s theorem is also known as the Red?eld-Pólya Theorem which both follows and ultimately generalizes Burnside’s lemma on the number of orbits of a group action on a set. Pólya’s Theory is a spectacular tool that allows us to count the number of distinct items given a certain number of colors or other characteris- tics. Sometimes it is interesting to know more information about the characteristics of these distinct objects. Pólya’s Theory is a unique and useful theory which acts as a picture function by producing a polynomial that demonstrates what the different con?gurations are, and how many of each exist.The dynamics of counting symmetries are the most interesting part. This subject has been a fascination for mathematicians and scientist for ages. Here 16 Bead Necklace, patterns of n tetrahedron with 2 colors, patterns of n cubes with 3 and 4 colorings and so on have been solved. 2010 Mathematics Subject Classi?cations: 14L,14P,14Q Key Words and Phrases: Burnside’s Lemma, Pólya’s Theorem, Counting Symmetries,Group 1. Introduction and Preliminaries 1.1. Group Action Let G be a group and A is a set which is nonempty. Suppose that G is a permutation group acting on a set A, and consider the set BA of all functions f : A → B. Then G acts naturally on BA as follows: if g ∈ G and f ∈ BA then de?ne the fun