[r-t] Decisions / Algorithms for generating the extent

[Richard Smith]

Philip Saddleton wrote:

> Possibly, but better to use
>
> 23456...n1 and 13456...n2
>
> think of the plain course as applying the first n times, and a single
> swapping two bells.

Interesting.  Unless I'm missing something, this makes it
trivial.  (Use nested Q-sets of these "singles" to visit
every "plain course".)  I wonder why I've never seen this
result quoted.

More generally, doesn't it allow us to state that any
connected Cayley graph with generators {a, b} is Hamiltonian
if |a^-1 . b| = 2?

RAS