scientific article; zbMATH DE number 3989368
A problem in campanology, the science of change ringing, consists in constructing a (closed) sequence of \(n!+1\) successive ringings of n bells (once each, in some order) which satisfies some extra conditions. In the first paper of the series [Math. Proc. Camb. Philos. Soc. 94, 203-215 (1983; Zbl 0528.05025)], the author treats the problem by means of constructing suitable generating sets of the symmetric group \(S_ n\) so as to obtain a Hamiltonian Cayley color graph for \(S_ n.\) In the present paper, identity words in \(S_ n\) are studied in order to obtain further possible restrictions to the sequence in the original problem. Then, one of the standard algorithms for generating all elements of \(S_ n\) is modified to get a recursive procedure for constructing the desired ringing sequences. Finally, the genera of the corresponding Cayley color graphs are determined.
- Treble dodging minor methods: Ringing the cosets, on six bells
- Gray codes for reflection groups
- Fabian Stedman: The First Group Theorist?
- scientific article; zbMATH DE number 4132416 (Why is no real title available?)
- On Fletcher's Paper "Campanological Groups"
- Ringing the Cosets
- Ringing the cosets. II
- scientific article; zbMATH DE number 888850 (Why is no real title available?)
- Change ringing and Hamiltonian cycles: the search for Erin and Stedman triples
- Topological Graph Theory: A Personal Account
- The mathematical art of change ringing
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3752398)