Skip to main content

Webern’s Twelve-Tone Rows through the Medium of Klumpenhouwer Networks

  • Conference paper
Mathematics and Computation in Music (MCM 2007)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 37))

Included in the following conference series:

  • 2169 Accesses

Abstract

The theory of Klumpenhouwer networks (K-nets) in contemporary music theory continues to build on the foundational work of (1990) and (1991), and has tended to focus its attention on two principal issues: recursion between pitch-class and operator networks and modeling of transformational voice-leading patterns between pitch classes in pairs of sets belonging to the same or different Tn/TnI classes.1 At the core of K-net theory lies the duality of objects (pitch classes) and transformations (Tn and TnI operators and their hyper-Tn and hyper-TnI counterparts). Understood in this general way, K-net theory suggests other avenues of investigation into aspects of precompositional design, such as connections between K-nets and Perle cycles, K-nets and Stravinskian rotational or four-part arrays, and between K-nets and row structure in the “classical” twelve-tone repertoire.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Buchler, M.: Reconsidering Klumpenhouwer Networks. Music Theory Online 13(2) (2007)

    Google Scholar 

  • Foley, G.: The Efficacy of K-Nets in Perlean Theory. Music Theory Online 13(3) (2007)

    Google Scholar 

  • Klumpenhouwer, H.: Reconsidering Klumpenhouwer Networks: A Response. Music Theory Online 13(3) (2007)

    Google Scholar 

  • Klumpenhouwer, H.: A Generalized Model of Voice-Leading for Atonal Music. Ph.D. dissertation. Harvard University (1991)

    Google Scholar 

  • Lambert, P.: Isographies and Some Klumpenhouwer Networks They Involve. Music Theory Spectrum 24(2), 165–195 (2002)

    Article  Google Scholar 

  • Lewin, D.: Klumpenhouwer Networks and Some Isographies That Involve Them. Music Theory Spectrum 12(1), 83–120 (1990)

    Article  Google Scholar 

  • Losada, C.: K-nets and Hierarchical Structural Recursion: Further Considerations. Music Theory Online 13(3) (2007)

    Google Scholar 

  • Morris, R., Alegant, B.: The Even Partitions in Twelve-Tone Music. Music Theory Spectrum 10, 74–101 (1988)

    Article  Google Scholar 

  • Nolan, C.: Thoughts on Klumpenhouwer Networks and Mathematical Models: The Synergy of Sets and Graphs. Music Theory Online 13(3) (2007)

    Google Scholar 

  • O’Donnell, S.: Embracing Relational Abundance. Music Theory Online 13(3) (2007)

    Google Scholar 

  • Stoecker, P.: Without a Safety (k)-Net. Music Theory Online 13(3) (2007)

    Google Scholar 

  • Tymoczko, D.: Recasting K-nets. Music Theory Online 13(3) (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nolan, C. (2009). Webern’s Twelve-Tone Rows through the Medium of Klumpenhouwer Networks. In: Klouche, T., Noll, T. (eds) Mathematics and Computation in Music. MCM 2007. Communications in Computer and Information Science, vol 37. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04579-0_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04579-0_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04578-3

  • Online ISBN: 978-3-642-04579-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics