On a theorem of Blichfeldt

preprint2016arXivOpen access

Abstract

Let GG be a permutation group on n<∞n<\infty objects. Let f(g)f(g) be the number of fixed points of g∈Gg\in G, and let {f(g):1≠g∈G}={f1,…,fr}\{f(g):1\ne g\in G\}=\{f_1,\ldots,f_r\}. In this expository note we give a character-free proof of a theorem of Blichfeldt which asserts that the order of GG divides (n−f1)…(n−fr)(n-f_1)\ldots(n-f_r). We also discuss the sharpness of this bound.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.