Permutation representations of finite simple groups: Orbits of cyclic ...
Permutation representations of finite simple groups: Orbits of cyclic ...
Permutation representations of finite simple groups: Orbits of cyclic ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Here the lemma for permutation modules <strong>of</strong> <strong>cyclic</strong> <strong>groups</strong> can<br />
not be applied any longer. Instead we need to recall a theorem<br />
<strong>of</strong> Burnside that is not so well-known any longer.<br />
If G acts on Ω and if U ⊆ G let fix Ω (U) be the number <strong>of</strong><br />
elements ω ∈ Ω fixed by all elements <strong>of</strong> U. (This function extends<br />
the permutation character to sub<strong>groups</strong>.)<br />
Theorem (Burnside, 1911): Let (G, Ω) and (G, ∆) be permutation<br />
actions. Then (G, Ω) = ∼ (G, ∆) if and only if fix Ω (U) =<br />
fix ∆ (U) for all sub<strong>groups</strong> U in G.<br />
THANK YOU