A hypercube-graph model for n-tone rows and relations

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We investigate the representation of n-tone rows as paths on an n-dimensional hypercube graph with vertices labeled in the power set of the aggregate. These paths run from the vertex labeled by the null set to the one labeled by the full set, passing through vertices whose labels gradually accumulate members of the aggregate. Row relations are then given as hypercube symmetries. Such a model is more sensitive to the musical process of chromatic completion than those that deal more exclusively with n-tone rows and their relations as permutations of an underlying set. Our results lead to a graph-theoretical representation of the duality inherent in the pitch-class/order-number isomorphism of serial theory. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Peck, R. W. (2013). A hypercube-graph model for n-tone rows and relations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7937 LNAI, pp. 177–188). https://doi.org/10.1007/978-3-642-39357-0_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free