### Top Posts

### Recent comments

- Peter Cameron on Apology
- Robin Whitty on Apology
- Peter Cameron on Isbell’s Conjecture
- Sean Eberhard on Isbell’s Conjecture
- Sean Eberhard on Isbell’s Conjecture

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

# Tag Archives: Hall-Paige conjecture

## Research trips in February

I don’t know how things have got so busy. I had two interesting trips in February; I worked hard, and some interesting mathematics resulted; but I don’t seem to have found the time to describe it. So here goes. This … Continue reading

## The Hall–Paige conjecture

A Latin square of ordern is an n×n array of symbols from an alphabet of size n with the property that each symbol in the alphabet occurs once in each row or column. Two Latin squares L and M are … Continue reading

## Synchronization update

There is some recent news about the synchronization project. Two steps forward have occurred. The set-up Here is a brief recapitulation. Let G be a transitive permutation group on Ω, where |Ω| = n. We say that G is non-synchronizing if there … Continue reading