Top Posts
Recent comments
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 664 other subscribers
Cameron Counts: RSS feeds
Meta
Tag Archives: CFSG
A small problem
In connection with the research discussion about graphs and groups, I began to wonder which finite groups have the property that any two elements of the same order are conjugate. I thought about this, and got a certain distance, and … Continue reading
Prospects in Mathematics, 2
I didn’t say anything about my own talk at the Prospects in Mathematics meeting. But soon afterwards I was rereading Lee Smolin’s 2006 book The Trouble with Physics, and it resonated with some of the things I said. My topic … Continue reading
Posted in doing mathematics, events
Tagged CFSG, Classification of Finite Simple Groups, Lee Smolin, string theory
7 Comments
Commuting graph, 2
Last week Chris Parker gave a very interesting talk in the London Algebra Colloquium on this topic. It is an excellent example of a curious phenomenon. If you look for your keys under the lamppost, then in a Borgesian way … Continue reading
Posted in exposition
Tagged Borges, CFSG, Classification of Finite Simple Groups, special 2groups
Leave a comment
Finding derangements without CFSG
Nearly two years ago, I posed the problem of finding an “elementary” deterministic polynomialtime algorithm for finding a fixedpointfree element (or derangement) in a transitive permutation group. The background is that there are so many fpf elements (at least a … Continue reading
Finite simple groups
The blog Gödel’s Last Letter and P=NP is always worth reading. The two bloggers, RJ Lipton and KW Regan, are computer scientists, but they have interesting things to say about developments in mathematics, and other areas too. For example, last year they … Continue reading
Posted in exposition
Tagged CFSG, computer checking, finite simple groups, KW Regan, new simple group, RJ Lipton
2 Comments
A permutation group challenge, 3
“Then I will do it myself”, said the little red hen. And she did. Since nobody took up the challenge, I had to do it myself. Let λ be a partition of n. We say that a permutation group G … Continue reading
Posted in open problems
Tagged 6transitive groups, CFSG, partitiontransitive groups
Leave a comment
A permutation group challenge
Long ago, in the distant past before the Classification of Finite Simple Groups, Peter Neumann, Jan Saxl and I investigated the class of permutation groups acting on sets of even cardinality n = 2k, with the following interchange property: Any subset of … Continue reading
Posted in exposition, open problems
Tagged CFSG, homogeneity, permutation groups, semigroups
1 Comment
35ACCMCC at Monash
I’ve just spent a week at the 35th Australasian Conference on Combinatorial Mathematics and Combinatorial Computing at Monash University in Clayton, a suburb of Melbourne. The conference happened to coincide with a research visit to Monash, about which I will … Continue reading
Posted in events
Tagged CFSG, crimson rosellas, Gray codes, kookaburras, loops, sulphurcrested cockatoos
11 Comments