Skip to main content

Kirkman’s Ladies, A Combinatorial Design

  • Chapter
  • First Online:
Looking at Numbers

Abstract

I found a surprising number of new musical patterns in formations as simple as the permutations, sums and subsets already discussed, and in the case of my “counting music”, even simpler ones, but I was always interested in finding new directions in all this. One new direction presented itself quite unexpectedly in 2003, when I heard a piece by a young Dutch composer, Samuel Vriezen. Using a scale of only 11 notes, Vriezen constructed 11 five-note chords in such a way that each chord had exactly two notes in common with each other chord. I asked the composer how he had ever found such a group of chords, and he told me it was not too complicated. He thought I could construct such a system myself, if I thought about it a bit.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Kirkman, T.P. 1847. On a problem in combinatorics. Cambridge and Dublin Mathematical Journal 2: 191–204.

    Google Scholar 

  2. White, H.S., F.N. Cole, and L.D. Cummings. 1919. Complete classification of the triad systems on fifteen elements. Memoirs of the National Academy of Sciences of the United States of America 14: 1–89.

    Google Scholar 

  3. Colbourn, C. and J. Dinitz. 2007. Handbook of combinatorial designs. Boca Raton: CRC Press.

    Google Scholar 

  4. Mulder, P. 1917. Kirkman Systemen. Groningen Dissertation. Leiden, Netherlands.

    Google Scholar 

  5. Cole, F.N. 1922. Kirkman parades. Bulletin of the American Mathematical Society 28: 435–437.

    Article  MathSciNet  Google Scholar 

  6. Ray-Chauduri, D.K., and R.M. Wilson. 1971. Solution of Kirkman’school girl problem. Proceedings of Symposia in Pure Mathematics American Mathematical Society 19: 187–204.

    Article  Google Scholar 

  7. Rees, R.S., and D.R. Stinson. 1989. On combinatorial designs with subdesigns. Discrete Mathematics 77: 259–279.

    Article  MathSciNet  MATH  Google Scholar 

  8. Colbourn, C., and A. Rosa. 1999. Triple systems. Oxford: Oxford University Press

    Google Scholar 

  9. Steiner, J. 1853. Combinatorische aufgabe. Journal of Reine Angewandte Mathematik 45: 181–182.

    Article  Google Scholar 

  10. Denniston, R.H.F. 1974. Sylvester's problem of the fifteen schoolgirls. Discrete Mathematics 9: 229–233.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tom Johnson .

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Basel

About this chapter

Cite this chapter

Johnson, T., Jedrzejewski, F. (2014). Kirkman’s Ladies, A Combinatorial Design. In: Looking at Numbers. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-0554-4_4

Download citation

Publish with us

Policies and ethics