### Top Posts

### Recent comments

### Blogroll

- Alexander Konovalov
- Annoying precision
- Astronomy Picture of the Day
- Azimuth
- Bad science
- Bob Walters
- British Combinatorial Committee
- CIRCA tweets digest
- CoDiMa
- Coffee, love, and matrix algebra
- Collecting reality
- Comfortably numbered
- Computational semigroup theory
- DC's Improbable Science
- Diamond Geezer
- Exploring East London
- From hill to sea
- Gödel's lost letter and P=NP
- Gil Kalai
- Haris Aziz
- Intersections
- Jane's London
- Jon Awbrey
- Kourovka Notebook
- LMS blogs page
- Log24
- London Algebra Colloquium
- London Reconnections
- Marie Cameron's blog
- MathBlogging
- Micromath
- Neill Cameron
- neverendingbooks
- Noncommutative geometry
- numericana hall of fame
- Paul Goldberg
- Ratio bound
- Robert A. Wilson's blog
- Sheila's blog
- Since it is not …
- Spitalfields life
- St Albans midweek lunch
- Stubborn mule
- Sylvy's mathsy blog
- SymOmega
- Tangential thoughts
- 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
- Vynmath
- XKCD

### Find me on the web

### Cameron Counts: RSS feeds

### Meta

# Category Archives: doing mathematics

## Graphs on groups, 2

I wrote the long post about this to try to write it out of my system. No luck … I mentioned in that survey that every finite graph is embeddable as induced subgraph in the enhanced power graph, deep commuting … Continue reading

Posted in doing mathematics, mathematics
Tagged commuting graph, enhanced power graph
Leave a comment

## Ramanujan+100

I have just spent the last four days in Kochi, Kerala, at the International Conference on Number Theory and Discrete Mathematics, commemorating Srinivasa Ramanujan, the great Indian mathematician, on the 100th anniversary of his far-too-early death. The conference had perhaps … Continue reading

## 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

## A paradox, and where it led

What is the difference between a contradiction and a paradox? A contradiction is a dead end, a sign that the road leads nowhere and you should turn back and take the other road. A paradox, however, is an invitation to … Continue reading

Posted in doing mathematics, exposition
Tagged Anti-foundation Axiom, Bea Adam-Day, random graph
Leave a comment

## Perfectness of the power graph

The power graph of a group is the graph whose vertices are the group elements (sometimes the identity is excluded but it doesn’t matter here), in which x and y are joined if one is a power of the other. … Continue reading

Posted in doing mathematics, exposition
Tagged commuting graph, Lovász, partial preorder, perfect graph, power graph
1 Comment

## On the Frattini subgroup

I wrote earlier about the Frattini subgroup of a group. It can be defined in either of two ways (as the set of non-generators of a group, the elements which can be dropped from any generating set containing them; or … Continue reading

Posted in doing mathematics, exposition
Tagged Frattini subgroup, G. A. Miller, writing mathematics
4 Comments

## Surprising fun fact

I have just found a proof of the following. Usual caveat: nobody else has read the proof yet, and I have not carefully checked it. Let G be a finite group. The finite group H will be called an inverse … Continue reading

## Integrals of groups revisited

After my trip to Florence in February, I wrote about the work I did there with Carlo Casolo and Francesco Matucci. After Carlo’s untimely death the following month, we were left with many pages of notes from him about the … Continue reading

Posted in doing mathematics, exposition
Tagged Carlo Casolo, derived subgroup, Sofos Efthymios
Leave a comment

## A problem

I seem to have too many balls in the air at the moment. So let me drop one here. Any thoughts very welcome. A k-hypergraph consists of a set X of vertices and a collection of k-element subsets called edges. … Continue reading