Top Posts
Recent comments
- Peter Cameron on The electron is round
- Jony Hudson on The electron is round
- Peter Cameron on Araucaria
- Peter Cameron on Algebra in Novi Sad
- Igor Dolinka on Algebra in Novi Sad
Blogroll
- Annoying precision
- Astronomy Picture of the Day
- Azimuth
- Bad science
- Bob Walters
- DC's Improbable Science
- Diamond Geezer
- Equatorial mathematics
- Gödel's lost letter and P=NP
- Gil Kalai
- Haris Aziz
- Intersections
- Jane's London
- Jon Awbrey
- LMS blogs page
- Log24
- London Daily Photo
- London Reconnections
- Machines like us
- Marie Cameron's blog
- MathBlogging
- Micromath
- Neill Cameron
- neverendingbooks
- Noncommutative geometry
- Paul Goldberg
- Pete Ashton
- Sheila's blog
- Since it is not …
- Stubborn mule
- SymOmega
- Terry Tao
- The De Morgan Journal
- The London column
- The Lumber Room
- Theorem of the day
- Tim Gowers
- XKCD
Cameron Counts: RSS feeds
Meta
Tag Archives: primitive groups
A thrifty algorithm
Two important classical parameters of a permutation group G of degree n are the base size, the smallest size of a collection of points whose pointwise stabiliser is the identity; and the minimal degree, the smallest number of points moved … Continue reading
Posted in exposition, open problems
Tagged base size, greedy algorithm, Kenneth Blaha, minimal degree, permutation groups, primitive groups
4 Comments
Primitive graphs
A primitive graph is one whose automorphism group acts primitively on the vertices: that is, the group is transitive on the vertices, and there is no non-trivial equivalence relation which it preserves. This post is not about why primitive graphs … Continue reading
