A Simple Proof of Rankin's Campanological Theorem

DOI10.2307/2589053zbMath0986.20027OpenAlexW4249899973MaRDI QIDQ2757352

Richard G. Swan

Publication date: 26 November 2001

Full work available at URL: https://doi.org/10.2307/2589053

zbMATH Keywords

sequencings of finite groups

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Generators, relations, and presentations of groups (20F05) General theory for finite permutation groups (20B05)

Related Items (3)

Constructing the first (and coolest) fixed-content universal cycle ⋮ Hamiltonicity of digraphs for universal cycles of permutations ⋮ Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples

This page was built for publication: A Simple Proof of Rankin's Campanological Theorem