Skip to main content

Exact Cover Problem in Milton Babbitt’s All-Partition Array

  • Conference paper
  • First Online:
Book cover Mathematics and Computation in Music (MCM 2015)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9110))

Included in the following conference series:

Abstract

One aspect of analyzing Milton Babbitt’s (1916–2011) all-partition arrays requires finding a sequence of distinct, non-overlapping aggregate regions that completely and exactly covers an irregular matrix of pitch class integers. This is an example of the so-called exact cover problem. Given a set, A, and a collection of distinct subsets of this set, S, then a subset of S is an exact cover of A if it exhaustively and exclusively partitions A. We provide a backtracking algorithm for solving this problem in an all-partition array and compare the output of this algorithm with an analysis produced manually.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Babbitt, M.: Set structure as a compositional determinant. J. Music Theor. 5, 72–94 (1987)

    Article  Google Scholar 

  2. Bazelow, A.R., Brickle, F.: A partition problem posed by Milton Babbitt. Perspect. New Music 14(2), 280–293 (1976)

    Article  Google Scholar 

  3. Bemman, B., Meredith, D.: From analysis to surface: generating the surface of Milton Babbitt’s Sheer Pluck from a parsimonious encoding of an analysis of its pitch-class structure. In: The Music Encoding Conference, Charlottesville, VA, 20–23 May 2014

    Google Scholar 

  4. Eger, S.: Restricted weighted integer compositions and extended binomial coefficients. J. Integer Seq. 16(13.1.3), 1–25 (1997)

    MathSciNet  Google Scholar 

  5. Donald, K.: Dancing links. 22 February 2000. http://www-cs-faculty.stanford.edu/ uno/musings.html

  6. Mead, A.: An Introduction to the Music of Milton Babbitt. Princeton University Press, Princeton (1994)

    Book  Google Scholar 

  7. Scott, D.S.: Programming a combinatorial puzzle. Technical report No. 1, Princeton University Department of Electrical Engineering, Princeton, NJ, 10 June 1958

    Google Scholar 

Download references

Acknowledgments

The work reported in this paper was carried out as part of the EC-funded collaborative project, “Learning to Create” (Lrn2Cre8). The Lrn2Cre8 project acknowledges the financial support of the Future and Emerging Technologies (FET) programme within the Seventh Framework Programme for Research of the European Commission, under FET grant number 610859.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to David Meredith .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Bemman, B., Meredith, D. (2015). Exact Cover Problem in Milton Babbitt’s All-Partition Array. In: Collins, T., Meredith, D., Volk, A. (eds) Mathematics and Computation in Music. MCM 2015. Lecture Notes in Computer Science(), vol 9110. Springer, Cham. https://doi.org/10.1007/978-3-319-20603-5_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-20603-5_25

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-20602-8

  • Online ISBN: 978-3-319-20603-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics