Top Posts
Recent comments
 dsp on The enhanced power graph is weakly perfect
 dsp on The enhanced power graph is weakly perfect
 What Lovelace Did: From Bombelli to Bernoulli to Babbage  on Polynomials taking integer values
 What Ada Did: From Bombelli to Bernoulli to Babbage  on Polynomials taking integer values
 Peter Cameron on The enhanced power graph is weakly perfect
Blogroll
 Astronomy Picture of the Day
 Azimuth
 British Combinatorial Committee
 Comfortably numbered
 Diamond Geezer
 Exploring East London
 From hill to sea
 Gödel's lost letter and P=NP
 Gil Kalai
 Jane's London
 Jon Awbrey
 Kourovka Notebook
 LMS blogs page
 Log24
 London Algebra Colloquium
 London Reconnections
 MathBlogging
 Micromath
 Neill Cameron
 neverendingbooks
 Noncommutative geometry
 numericana hall of fame
 Ratio bound
 Robert A. Wilson's blog
 Since it is not …
 Spitalfields life
 Sylvy's mathsy blog
 SymOmega
 Terry Tao
 The Aperiodical
 The De Morgan Journal
 The ICA
 The London column
 The Lumber Room
 The matroid union
 Theorem of the day
 Tim Gowers
 XKCD
Find me on the web

Join 659 other followers
Cameron Counts: RSS feeds
Meta
Tag Archives: maximal subgroups
The Wall conjecture extended
Tim Wall boldly conjectured in 1961 that the number of maximal subgroups of a finite group G is at most G−1. (This would be best possible, since the the elementary abelian 2group attains this bound.) He proved that the conjecture … Continue reading
The symmetric group, 12
This instalment is about the maximal subgroups of the symmetric group, and the O’Nan–Scott Theorem. There are two versions of this theorem, one of which is sometimes called the Aschbacher–O’Nan–Scott Theorem. One is about maximal subgroups of the symmetric group … Continue reading
Posted in exposition, symmetric group
Tagged maximal subgroups, O'NanScott theorem, permutation group, symmetric group
6 Comments