"I count a lot of things that there's no need to count," Cameron said. "Just because that's the way I am. But I count all the things that need to be counted."

Richard Brautigan, The Hawkline Monster: A Gothic Western, Picador, 1976.

Them as counts counts moren them as dont count

Russell Hoban, Riddley Walker, Jonathan Cape, 1980.

Peter Cameron's Home Page

Picture-free version

Contents of this page

     My picture

Other pages


Queen Mary, University of London
School of Mathematical Sciences

I am a Professor of Mathematics in the School of Mathematical Sciences at Queen Mary, University of London. The street address, phone and fax numbers, and directions, are given below. A picture of the College is here (taken by John Winfield, licensed under Creative Commons licence).

For information about research in mathematics, see the School's research page; for details of postgraduate study see the postgraduate page.

My mathematical interests

I am interested in permutation groups, and the (finite or infinite) structures on which they can act (which may be designs, graphs, codes, geometries, etc.). Those countably infinite structures with the most symmetry are the ones which can be specified by first-order logical axioms; this is a general framework which includes many counting problems for types of finite structures. To get more detailed information, take a look at the abstracts of my recent and forthcoming papers, the problems which have appeared on this page, or my conjectures. Like the hero of Richard Brautigan's novel, I like to count things!

Some of my current interests are the connections between optimal designs and Laplace eigenvalues of multigraphs; homomorphisms and cores of symmetric graphs, which connect with automata theory and permutation groups; algebraic number theory properties of chromatic roots; orbit-counting versions of the Tutte and related polynomials; isometry groups of the Urysohn metric space; products of permutation groups; a 2-(14080,1444,148) design (constructed by Hunt and Rudvalis) admitting the Fischer group Fi22, and a 2-(1408,336,80) design (constructed by Praeger and me) admitting 212:(3M22.2); equivalence and typical properties of Latin squares; asymptotics of various counting problems (incidence matrices, 2-covers, etc.); and further properties of the random graph and related groups.

Research output:
  • This year I am teaching MTH6128 Number Theory, and MTHM024/MTH714U Group Theory, as well as MTH6104 Algebraic Structures 2 (reading course, jointly with Professor R. A. Bailey).
  • In the last few years I have also taught Introduction to Algebra, Algebraic Structures I, Combinatorics, Cryptography, Linear Algebra II, Permutation Groups, Projective and Polar Spaces, Probability I, Sets Logic & Categories, and Enumerative & Asymptotic Combinatorics. Notes from some of these courses are available.
  • Here is some advice on studying; it was written for Number Theory students but applies more widely.
Lecture notes:

Books supported by WWW pages:

Combinatorics Introduction to Algebra Sets, Logic and Categories Permutation Groups
Combinatorics Introduction to Algebra Sets, Logic & Categories Permutation Groups
Cambridge Univ. Press Oxford University Press Springer-Verlag Cambridge Univ. Press

Seminars and study groups

We run a Combinatorics Study Group during term-time. Please join us if you are visiting London: we meet at 4:30pm on Fridays in room M103 in the Mathematical Sciences building, Queen Mary, University of London (nearest tube Stepney Green, see map). See the Study Group Homepage for further details including this week's speaker.

I also help to run the Network Coding seminar, with Søren Riis from the Computer Science department. The Network Coding web page is here, and the seminar listing can be found here.

At present, I keep the records for the London Algebra Colloquium. These are a virtually complete list of speakers and talks since the establishment of the colloquium on 25 October 1950.

I also keep records for the Queen Mary Pure Mathematics seminar – but these only go back to 2002.

Design Research Group

The Design Research Group page provides information about research here in design theory and related topics.

It includes pages devoted to design resources and lecture notes on the Web.

It also contains details of our EPSRC-funded project "A Web-based resource for design theory", whose official website is at DesignTheory.org.

The British Combinatorial Committee

I am currently the chairman of the British Combinatorial Committee. There is a BCC homepage with details of the Committee's activities.

The 23rd British Combinatorial Conference will be held at the University of Exeter, from 3 to 8 July 2011. The 24th conference will be at Royal Holloway, University of London, in 2013.

See also the list of forthcoming conferences in combinatorics and related areas, or the on-line British Combinatorial Bulletin.

British Combinatorial Committee

Anything else?

One of the best things about being a mathematician is the opportunity to travel. I have kept various travel diaries. There are some other diaries here too, including Chapter 1 of my autobiography and a readable version of my 2008 G. C. Steward Lectures at Cambridge.

Cameron at Cameron

Apart from this now stressful profession, I used to run (I ran the London Marathon twice in the late 80s, best time 2:46:59), but now I spend time walking along the footpaths and bridleways of Britain. A list of "named" walks I have completed is available here (including a picture, which will be changed from time to time). This picture shows me on a particularly arduous stretch of the Fife Coastal Path in June 2009.


A problem


A submonoid of the full transformation monoid Tn on the set {1,...,n} is synchronizing if it contains a transformation whose image has size 1.

Is it true that two random transformations generate a synchronizing monoid with probability 1-o(1)?

I have a collection of old problems, with annotations. See the problem index. Further links to problem pages can be found here.


School of Mathematical Sciences
Queen Mary, University of London
Mile End Road
London E1 4NS
From U.K. From overseas
Telephone: 020 7882 5477 +44 20 7882 5477
Fax: 020 7882 7684 +44 20 7882 7684

Email: P.J.Cameron@qmul.ac.uk
School of Mathematical Sciences

On leaving Stepney Green station, turn left, continue for 400 metres along Mile End Road to the Mathematical Sciences building.

If coming by bus, take the number 25 or 205: the nearest stop is Ocean Estate, a request stop between Stepney Green Station and Queen Mary College.

Family links


The views and opinions expressed in this page are mine. The College does not have editorial control over this page and does not endorse, warrant or take responsibility for its content, including the first quote below.

The contents may change at any time!

This page has received
Hit Counter by Digits hits
since 9 February 2009.

Web counter
by digits.com.

Clearly we must explain more forcibly, especially at the highest levels of government, that the primary goal of universities is teaching and research, and that income is a constraint, and not the value to be maximised.

Andrew Graham, Balliol College Register, 2005.

We who often glorify our tendency to ignore reason, installing in its place blind faith, valuing it as spiritual, are forever paying for its cost with the obscuration of our mind and destiny.

Rabindranath Tagore

Many teachers will say that 'you cannot express the inexpressible', and they do not try. But teachers like Yasutani and Maezumi don't agree, and I feel as they do: if you perceive deeply enough, a clear and simple way to express it can be found.

Tetsugen (Bernard Glassman), quoted in Peter Matthiessen, Nine-headed Dragon River, Shambhala 1998.

As Don Braben so aptly put it, funding the technology but not the basic research on which it depends is "living off the seedcorn".

Leslie Ann Goldberg

If I give the answer, you immediately forget about the question. If I don't give you the answer, you will still have questions and you will be thinking about the problem long after.

Eugene A. Geist

This page maintained by Peter J. Cameron
Revised 15 July 2011