Top Posts
Recent comments
- Yemon Choi on Student meetings
- Josh Paik on Student meetings
- Peter Cameron on BCC29 at Lancaster
- Robert on BCC29 at Lancaster
- Peter Cameron on BCC29 at Lancaster
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 657 other followers
Cameron Counts: RSS feeds
Meta
Tag Archives: semigroup
Combinatorial Yang-Baxter, 2
It is five years since Tatiana Gateva-Ivanova introduced me to the combinatorial Yang–Baxter equation. I may be slow; I have just understood why this is a good thing for a mathematician to study, aside from its applications in physics (whatever … Continue reading
Posted in exposition
Tagged 2-dimensional semigroups, associative law, semigroup, Yang-Baxter equation
Leave a comment
Definitions
Time to generalise from the preceding examples. There are several good reasons why a choice of definitions is a good thing. First, as several points in the discussion of graphs suggested, different definitions may be adapted for different kinds of … 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
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
Peter Cameron's Blog 