Top Posts
Recent comments
- Jon Awbrey on Creativity
- 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
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
Category Archives: exposition
The symmetric group, 13
In my post on the Novi Sad Algebraic Conference, I described how the symmetric group on a set X is “contained” in the full transformation semigroup on X, which is itself contained in the clone of functions on X. In … Continue reading
Algebra in Novi Sad
I have just spent a very wet week in Novi Sad at the fourth Novi Sad Algebraic Conference. Wet both in the sense of the large amount of rain that fell (most afternoons brought lightning, thunder and a heavy downpour) … Continue reading
Posted in events, exposition
Tagged 42, clones, hyperplane arrangements, polymorphisms, semigroups, Sierpinski rank
2 Comments
London Combinatorics Colloquia, 2
It’s that time of year again, and while I miss the buttercups in Reading, we had as usual a feast of interesting mathematics and a large and enthusiastic audience. It was a bit more tightly focussed than I would have … Continue reading
Posted in events, exposition
Tagged amenability, Ben Green, Cayley graphs, Endre Szemeredi, Gabor Kun, Noga Alon, Norman Biggs, Regularity Lemma, sum-free sets
Leave a comment
Finite geometry and probabilistic combinatorics
In the late 1960s, when I was born as a mathematician, I worked on finite permutation groups, on the edge of finite geometry and the combinatorics of very regular structures. I was dimly aware that there was a completely different … Continue reading
Endomorphism monoids of graphs
A monoid is, for me, a set of mappings on a finite domain which is closed under composition and contains the identity mapping. The composition is, of course, associative. Thus, it is “a group without the inverses”. A homomorphism from … Continue reading
Posted in exposition, open problems
Tagged endomorphism monoid, grid graph, Latin square, semigroup
Leave a comment
Fibonacci numbers, 8
I am at the Southeastern Conference this week; I will say more about this later. Now, I simply want to add a post to my sequence on Fibonacci numbers, based on a lovely talk by Bruce Sagan. What I have … Continue reading
Two lectures
Last Friday I heard two very interesting lectures. One was the London Mathematical Society’s Mary Cartwright lecture, timed to coincide with the launch of a report by the LMS on good practice in supporting women in academic careers. It was … Continue reading
Primitivity
The first mathematics book that I read really seriously was Helmut Wielandt’s Finite Permutation Groups. So I have known the definition of a primitive permutation group for more than forty years. But there is still more to learn. My recent … Continue reading
Posted in exposition, open problems
Tagged graph, primitive group, semigroup, synchronization
Leave a comment
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 2-groups
Leave a comment
The Graph Extension Theorem
I made some notes on the Graph Extension Theorem for a new research project. They may be of wider interest, so here is a summary. Shult’s Graph Extension Theorem is a simple device for showing that certain permutation groups have … Continue reading
Posted in exposition
Tagged Higman, Seidel, Shult, switching, transitive extension, two-graph
4 Comments