Top Posts
Recent comments
 dsp on The enhanced power graph is weakly perfect
 dsp on The enhanced power graph is weakly perfect
 What Lovelace Did: From Bombelli to Bernoulli to Babbage  on Polynomials taking integer values
 What Ada Did: From Bombelli to Bernoulli to Babbage  on Polynomials taking integer values
 Peter Cameron on The enhanced power graph is weakly perfect
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 659 other followers
Cameron Counts: RSS feeds
Meta
Tag Archives: HallPaige conjecture
BCC29 at Lancaster
Last week we celebrated the 29th British Combinatorial Conference in Lancaster, face to face. (As a side observation, this was by far the largest social gathering I have been at since the start of the pandemic; I found it both … Continue reading
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 setup Here is a brief recapitulation. Let G be a transitive permutation group on Ω, where Ω = n. We say that G is nonsynchronizing if there … Continue reading