### Top Posts

### Recent comments

- Peter Cameron on Magus Muir
- Peter Cameron on Nobel prizes
- Yiftach on Nobel prizes
- Sean Eberhard on A niggling problem
- Peter Cameron on A niggling problem

### 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
- Computational semigroup theory
- DC's Improbable Science
- Diamond Geezer
- Exploring East London
- Gödel's lost letter and P=NP
- Gil Kalai
- Haris Aziz
- Intersections
- Jane's London
- Jon Awbrey
- 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
- 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 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

# Category Archives: open problems

## Problems

I have begun the long job of updating my collection of open problems. I would appreciate any help! My St Andrews problems are here, and are in pretty good shape (there are only 14 of them so this wasn’t a … Continue reading

## Discrete mathematics in Derby

This week I have been at a conference on “Theoretical and Computational Discrete Mathematics” at the University of Derby, under the auspices of the Institute for Mathematics and its Applications. The University of Derby was founded as the Derby Diocesan … Continue reading

## The power graph yet again

Five years ago, I posted a short update on the power graph of a group. Now, finally, the paper resulting from this has appeared on the arXiv; my coauthors are Ghodratollah Aalipour, Saieed Akbari, Reza Nikandish and Farzad Shaveisi. I … Continue reading

## Circular repeated-measurements designs

My first paper in a real statistical journal has just been almost accepted (just a bit of re-formatting …) The paper is entitled “On optimality and construction of circular repeated-measurements designs”, the other authors are R. A. Bailey, K. Filipiak, J. Kunert and A. Markiewicz. … Continue reading

## Random orbits on colourings, or nested Markov chains

I promised after reporting Catherine Greenhill’s talk last week that I would advertise this little problem; so here goes. How do we pick a random proper colouring of a graph Γ? There is a simple Markov chain for this, also … Continue reading

Posted in exposition, open problems
Tagged graph colouring, Markov chain, orbits, random walk
Leave a comment

## Projective and polar spaces

I have produced a new edition of my lecture notes on Projective and Polar Spaces and put them with my lecture note collection. I did this because it seems that people still find some use for these notes. According to … Continue reading

Posted in history, open problems, the Web
Tagged Desargues' Theorem, LaTeX, LaTeX picture environment, Pappus' Theorem, plain TeX, polar spaces, projective spaces
3 Comments

## Chains of semigroups

I have written here about the lovely formula for the length of the longest chain of subgroups in the symmetric group Sn: take n, increase it by 50% (rounding up if necessary), subtract the number of ones in the base … Continue reading