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
Category Archives: exposition
BCC29 at Lancaster
Last week we celebrated the 29th British Combinatorial Conference in Lancaster, face to face. (As a side observation, this was by far the largest social gathering I have been at since the start of the pandemic; I found it both … Continue reading
Peter Neumann’s 3p paper
In 1955, Helmut Wielandt published a paper proving the following theorem: Let G be a primitive permutation group of degree 2p, where p is a prime greater than 3, which is not doubly transitive. Then p = 2a2+2a+1 for some positive integer … Continue reading
An O’NanScott note
My old friend Leonard Soicher is visiting St Andrews this week, having made a better job of retiring than I did. Today he gently took me to task for using the expression “simple diagonal type” for one of the types … Continue reading
Graphs on groups, 13
There are many results about the universality, or otherwise, of various graphs defined on groups: answers to questions of the form “for which graphs Γ is there a group G such that Γ is isomorphic to an induced subgraph of … Continue reading
Graphs on groups, 12
One thing I have learned from the project is that the most interesting question about graphs defined on groups is this: given two types of graph defined on a group G, what is the class of groups for which the … Continue reading
Posted in doing mathematics, exposition
Tagged enhanced power graph, independence graph, power graph, rank, supersoluble group
1 Comment
Graphs on groups, 11
A brief interlude to describe another recent preprint, and as in the preceding post I will concentrate on one result in the paper. I don’t know why it happens, but in this project one of the most interesting graph parameters … Continue reading
Posted in doing mathematics, exposition
Tagged clique number, nilpotent group, solubility graph, souble group
Leave a comment
Graphs on groups, 10
The lesson of this post and the next in the series is that the most interesting questions (to me, anyway) are not about the girth of the deep commuting graph but instead about the classes of groups G defined by … Continue reading
Posted in doing mathematics, exposition
Tagged 2Engel group, commuting graph, conjugacy, Dedekind group, enhanced power graph, power graph
Leave a comment
Graphs on groups, 9
We continue to make progress with the graphs on groups project, but this post attempts to step back and look at the whole thing. What use is all this? Once, after I talked at a departmental colloquium at the University … Continue reading
Posted in doing mathematics, exposition, open problems
Tagged graph theory, group theory, number theory, open problems
Leave a comment
Graphs on groups, 5
I gave two lectures on this stuff to a new research seminar on Groups and Graphs, run by Vijayakumar Ambat in Kochi, Kerala. The first was an introduction to the hierarchy, the second was about cographs and twin reduction, why … Continue reading
Posted in events, exposition, open problems
Tagged cograph, commuting graph, nilpotent group, perfect graph, power graph
2 Comments
Oligomorphic groups: topology or geometry?
One perhaps unexpected result of the pandemic is that there is a huge volume of really interesting mathematics flying around the internet at the moment, courtesy of Zoom and other platforms. This week I went to a talk by Joy … Continue reading