This page contains only the screen versions of talks. Instructions at the foot
of the page explain how to create a printer version if you want one.
Most of these are talks at conferences or research seminars.
I have highlighted in red talks which
were designed for a more general audience (usually non-mathematicians,
non-specialists, undergraduates, or high school students).
Algorithmic aspects of synchronization, Queen Mary Algorithms Day,
20 February 2013: slides
- Four talks at CAUL, Lisbon, April 2012:
- Between primitive and 2-transitive, 1: Synchronization
- Between primitive and 2-transitive, 2: Coherent configurations and
association schemes
- Algebraic properties of chromatic roots
- Combinatorial representations
- Balanced and variance-balanced designs, 6th Workshop on Statistics,
Mathematics and Compuation, Covilhã, Portugal, July 2012
- Combinatorial properties of transformation monoids, 35ACCMCC,
Melbourne, December 2011
- Combinatorial representation theory, December 2011
- Hadamard and conference matrices, December 2011
- Regular and synchronizing transformation monoids,
Kolloquium über Kombinatorik, Magdeburg, November 2011
- Sudoku, Researchers Night, 23 September 2011
- Dixon's Theorem and the probability of synchronization,
Groups and Semigroups: Interactions and Computations, Lisbon, 28 July 2011
- Graphs and monoids, cores and hulls, Workshop on Homogeneous Structures,
Leeds, 19 July 2011
- Synchronization, Young Researchers in Mathematics, University of Warwick,
14 April 2011
- Synchronization, AEB60, Eindhoven, 4 March 2011
- From magic squares to Sudoku, KCL Mathsoc, Cumberland Lodge,
19 February 2011
- On the foundations of matroid theory, Old Codger's Combinatorics
meeting, Reading, 3 November 2010
- From synchronization to graph homomorphism, ICRTGC2010, Cochin,
14 August 2010
- Pure Mathematics at QMUL, External Review, 17 March 2010
- Bases for structures and permutation groups, Laci Babai 60,
Columbus, OH, March 2010
- Sudoku and Mathematics, Copson lecture, University of St Andrews,
14 December 2009
- Synchronization, DIMAP, University of Warwick, 13 October 2009
- Synchronization, University of Reading, 4 December 2009
- Some aspects of codes over rings, Galway, July 2009
- Combinatorics of optimal design, British Combinatorial Conference,
St Andrwes, July 2009
- Synchronization, Ottawa Discrete Mathematics Days,23 May 2009
- Oligomorphic permutation gruops: growth rates and algebras,
CanaDAM, May 2009
- Synchronization, Open University Winter Combinatorics Meeting,
28 January 22009
- Synchronization and homomorphisms, Group Theory, Combinatorics & Computation,
Perth, January 2009
- Synchronization and permutation groups, 4-ICC, Auckland, December 2008
- Algebraic properties of chromatic roots,
Australian and New Zealand Mathematics Colloquium, Christchurch, New Zealand, December 2008:
slides
- Permutation groups and synchromizing automata,
Bridging the Gaps, 7 November 2008:
slides
- Synchronization and homomorphisms (Statistics, Mathematics, Computation
and Biometry, Lisbon, 22 July 2008):
slides
- The profile of a relational structure (INI workshop on Combinatorial
and Probabilistic Inequalities, 24 June 2008):
slides
- Sum-free sets and shift automorphisms (CICADA workshop, 20 May 2008):
slides
- Cores, hulls and synchronization (ROGICS'08, Mahdia, Tunisia, 12 May
2008): slides
- Scenes from mathematical life
(G. C. Steward lectures, Caius College, Cambridge):
- Before and beyond Sudoku (4 March)
- Proving theorems in Tehran (7 March)
- Transgressing the boundaries (11 March)
- Cameron felt like counting (9 May)
- Lectures on Forder tour of New Zealand, April 2008:
- Dunedin: Sudoku, mathematics and statistics (7 Apr); Scenes from mathematical life (8 Apr)
- Christchurch: Sudoku, Mathematics and Statistics (10 Apr); The random graph (11 Apr)
- Welllington: The random graph (14 Apr); Oligomorphic permutation groups (15 Apr)
- Palmerston North: Orbit counting for colourings and flows (17 Apr); Scenes from mathematical life (18 Apr)
- Hamilton: Sudoku, Mathematics and Statistics (21 Apr); The random graph (22 Apr)
- Auckland: Cores, hulls and synchronisation (28 Apr); The random graph (1 May);
Sudoku: Is it mathematics? (Public lecture, 30 Apr)
- Counting orbits on flows and colourings, University of Bristol/City
University London, October 2007
- From Higman-Sims to Urysohn: a random walk through groups, graphs,
designs and spaces, Ambleside, 25 August 2007:
slides
- Optimal designs and root systems, BCC, Reading, 13 July 2007:
slides
- Gregynog Mathematics Colloquium, 22-23 May 2007:
- Oligomorphic permutation groups: growth rates and algebras:
slides
- Counting orbits on colourings and flows:
slides
- Derangements and p-elements in permutation groups, Group Theory
and Applications, Manchester, 14 February 2007:
slides
- Sudoku: an alternative history, talk to the Archimedeans, 2 February 2007:
slides
- Symmetry in mathematics and mathematics of symmetry, International
Symmetry Conference, Edinburgh, January 2007:
slides
- Posets, homomorphisms and homogeneity,
Czech-Slovak Symposium on Graph Theory, Combinatorics, Algorithms and
Applications, 10 July 2006: slides
- Derangements, Groups in Galway, 20 May 2006
- The Rado graph and the Urysohn space,
Reading Combinatorics Conference, 18 May 2006:
slides
- Automorphism groups of homogeneous structures,
Postgraduate Group Theory Conference, Southampton, 19 April 2006:
slides
- Su Doku and mathematics, Induction lecture,
Queen Mary, September 2005
- Counting, structure and symmetry,
NZIMA/ACCMCC conference, December 2004
- The Rado graph and the Urysohn space, New
Zealand Mathematics Colloquium, December 2004
- Designs on the Web, Computer Science, Royal
Holloway, 26 October 2004
- Cyclic automorphisms of homogeneous
structures, EMS Joint Weekend, Prague, September 2004
- Finite geometry and permutation groups: some
polynomial links, Segre memorial meeting, Roma, June 2004
- Random Latin squares, RAND-APX, Oxford,
December 2003
- Permutations and codes, Bled, June 2003
- The countable homogeneous poset, Leeds,
April 2003
- Slides on Discrete Mathematics
in the undergraduate curriculum, 2003
- How big is the symmetric group?, PGGT2002,
Birmingham, April 2002
- Polynomials associated with permutation groups,
matroids and codes
- Random strongly regular graphs?, COMB01,
Barcelona, September 2001
- Association schemes and permutation
groups, LMS Durham Symposium, July 2001
- Multi-letter Youden rectangles from quadratic
forms, British Combinatorial Conference, July 2001
- Codes (London Mathematical
Society Popular Lecture, June-July 2001)
- Elusive groups and the polycirculant
conjecture, Barcelona, February 2001
- Orbits on n-tuples, Computation, Models
and Groups, Cambridge, January 2001
- The random graph revisited (composite of talks
at Australian Mathematical Society meeting and European Congress of
Mathematics, July 2000)
- Codes, matroids and trellises
(Combinatorics2000, Gaeta, May 2000)
- Quantum error correction (MathFIT meeting,
QMW, 5 April 2000)
- J. J. Seidel
(Seidel birthday meeting, Oisterwijk, August 1999)
- Permutations
(Erdös memorial conference, Budapest, July 1999)
- Some bridges between codes and designs
(23ACCMCC, Brisbane, July 1998)
- Some counting problems related to permutation
groups (FPSAC, Toronto, June 1998)
- Fisher and Bose, Hamming and Golay
(Reading colloquium, May 1998)
- An algebra related to enumeration
(CALCA, Oakland, May 1998)
Apart from the last batch, theseare either the Beamer slides of the talks or versions
made with the handout option to Beamer, which simply ignores pauses
and produces one page per frame. My default Beamer font is Palatino, using the
mathpazo package.
Print versions can be produced as follows. If the output from the screen
version is called x1.pdf, then run pdflatex on the following
input file:
\documentclass[a4paper]{article}
\usepackage{pdfpages}
\begin{document}
\includepdf[pages=1,landscape=false,frame=false,noautoscale=false]{x1.pdf}
\includepdf[pages=2-last,nup=2x3,landscape=false,frame=true,
noautoscale=true,scale=0.7,delta=0mm 5mm]{x1.pdf}
\end{document}
This puts the first slide on the front page and the others 3 rows and 2 columns
per page.
Note that the filename occurs twice!
If you don't have a handout version of the slides, note the numbers of the
last slide of each frame and put the list of these numbers in place of 2-last.
Peter J. Cameron
16 October 2025
