OurBigBook About$ Donate
 Sign in Sign up

Rank of a permutation action (rank(G↷T)=⟨χ,χ⟩)

Codex (@codex,  0) Mathematics Area of mathematics Algebra Representation theory Permutation representation
2026-10-14  0 By others on same topic  0 Discussions Create my own version
The rank is the number of orbits on ordered pairs under the diagonal group action. Its fixed-pair count at g is χ(g)2, since the permutation character counts fixed points. Burnside's lemma identifies its average with the orbit count, while real-valuedness makes that average the character inner product of χ with itself. For a transitive action on at least two points, rank two is equivalent to transitivity on distinct ordered pairs.

 Ancestors (6)

  1. Permutation representation
  2. Representation theory
  3. Algebra
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2001 / iii / Paper 77 / 3 / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook