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 followers
Cameron Counts: RSS feeds
Meta
Tag Archives: graph endomorphisms
A paper on synchronization
A paper on synchronization, written with João Araújo, Wolfram Bentz, Gordon Royle and Artur Schaefer, has just appeared on the arXiv. It is quite a substantial paper, and goes well beyond anything we have published (or that I have written … Continue reading
Posted in exposition
Tagged graph endomorphisms, primitive permutation groups, synchronization
Leave a comment
Orbital combinatorics
Yesterday I went to Edinburgh to give a colloquium talk about synchronization, including the recent stuff about butterflies. The day before, I had discussed Artur Schäfer’s work with him, and he expressed a hope that if he went to the … Continue reading
Random synchronization
Mikhail Berlinkov posted a paper on the arXiv this week proving that two random transformations of an nset generate a synchronizing semigroup with probability 1o(1/n) for large n. His approach was quite different from the one I’d been taking, using … Continue reading
Posted in mathematics, open problems
Tagged graph endomorphisms, random transformations, synchronization
Leave a comment