Counting under

group operation G operates on s

G S
151 210,1
lost
Isms
Grog theory
If 1Gt p p prime the

G is abelian
Question How about
141 173
p prime
Find an
example for some s
G
such that is
161 1,3 G sot abelian

Tixiang
symmetry group a
of square
Dy dihedral
group

1141 4 2 8 23
x Hw DX is not
isomorphic to
2 82
the
reflection and rotation does not commute
 y
reflection
Y Y y
notation

view x as
y permutations
of
4
vertus
T
clockwise
X 11.1.34
I
Yxy yay yay yw yw x i

counterclockwise
Xingu
Hamiltonian generalitation
of complex numbers

112
Sca b
I AEK BERG
at bi

fauna
i
b

Define multiplication
a is 3
a b Cid
fac bd ad 16L
addition structure the same way

a b t CC d late btw
r t
associativity commutativity distributive between
 y y
1124
f la b d
µ C 9 b c d f y
at bit
Cj talk

Catbitly't dik At Bit

Cit Dh
expand Not commutative

fiiiiiiiiiiiiiii.TT

ij k jk i ki y
ji k
kj i ihr
j Y
in
i

H 11110.0 0.014 x

ftp.t.EQ.IQ 8 z
 Finite field 2
Fp 122
c l
y Commutative associative
distributive
nonzero elements
have
ii raise multiplicative
IR Q G
Matric
Mmm
n 4
in
Fp
At Mnxm Bt Minx c
A'B E
Mnxl
A BE Man A B F BA
in
general

For p prime consider

Fp Zµz

I
a b
ee pT
 G
1Gt is a
p3 group anim

matrix multiplication

G is not commutative

in it
Q P 141 8 whether G is inno.µ
to Py or
Q

Xylow.sn 3Thms

proved
bycountinga
cook G
up operation 04 some
set
constructing from G
and
count med
pk
 const
Motivation TX under
Colony
reflection
symmetry

necklace with 6 beads

2
O
color the beads
6 e by a set
2

5
4 a of colors C
Ifr
bo y
14 _n
50 Oy
Q How
many necklaces
different are there

h h n ht colorings
of 1 2 3 x
Sif
View the colorings under rotations as the same
or under
rotations and
reflections

General is that
setting

X finite set Perm x is the

group
all
of permutations
of X G is a
subgroup
of
Pennix
 C has a nature operation on X

REG Xt X r x ra

There is set
Caf
a
colors

4h h
KY
Each a
coloring is map f X 7C

G operation on the set

of all the

colorings
7efin
x

Cheuk t
g GREG fix C

Yin't
fY I i

gif Agim
 silk t

We call
f fr are
equivalent
if
two IT
coloring Under G
7
gfG S't
fff fr
f f are in the same orbit under G opa

fix f ly for some

geo
or in other words
find fly
for some
9th

Q Countingthenumberottigy
operation
Thm Burnside's lemma G operates on
S
G.sf.in
VgtG.Fixg fsc S g.s sy

of orbits
I 5
9 set
of orbits
I
IFixgl
JEG

Example necklace G tat Y bbea n

e 113414 Elk

is
n
p
84
E Lb
H
I
537 1264
g 5 r t
I6 5 45 21
Pmk
Fixr Fixr g sis I s g s

4 f such that fly fin fist ten fit Hb Y

 I

lfixr ffixo il
n.IFixry
Fixe nb
ffi.ru n2

Fix
oil h's

Burnside lemma of necklaces

f nb 1 htt 2in't 2h

Burnside's lemma
Pf of
Consider the tablet G XS
of
A 11g.si g.i sy
w

µ
g
 E I Habit
S gg.FI

1 I lost.is
m
og.E.os.fosI oE E.o iot
E IGI
Os't'll
HGlittoforbi
II of orbit
ftp.Eixgl

Thm H of equivalence dalles

of colony
under G

Kl GE

Here 4g of cycle in
g including
1 cycles
 of parts of digs

Polya's Theory

Count the number

Q of colorings with

each coloring
fixed number
for Under G
opera

fr rs
ray
ii is in C I it
Zz iz im
k it ll im number
of colorings
using
rj if times
fathik arml
Eklinirinimsiritrailermin
Set For
up
y G C a
Perm 1 3

Type g 14,4 Cn

hab C
g I
cycles C 2
oyuki
Cu n
cycle
C 124 T Uch
HI
 Fou
g
a
define monomial

7g tf te ta

cycle indication ta HT GEE 7g

21
Example
622 operates on 4 1 2.3.45 64

ts f tgt2H
f l
12713714141,6
r 1123456

p 114 h 5
Sb

Than Fc Ir
polya hi I 2 rant hi
hiring
r t
ht
Pf I ii is ing
all the colorings with
I Kj

f operates on CI of orbits

Burnside's lemma
Fixy CI
In side each
cycle the elements
have the same color
C 7C 7C
g 7C
wz
lengthy
feuding toga
Hg I s

i i

I
Ege Hy init things
y 4g
2
7g ht Ttm r t
k't
gta arm

G 7C ht 1hm ritrit thi

Hg
Eg ffixgca.IS rii
GEE him

E Eg ffixglc.tt rii rmim

ME YyEgHixg
r anim

IG Klin intr rain

let Falk rm
A