Maximal Area Sets and Harmony
نویسنده
چکیده
A musical scale can be viewed as a subset of notes or pitches taken from a chromatic universe. For the purposes of this paper we consider a chromatic universe of twelve equally spaced pitches. Given integers (N,K) with N > K we use particular integer partitions of N into K parts to construct distinguished sets, or scales. We show that a natural geometric realization of these sets have maximal area, so we call them maximal area sets. We then discuss properties of maximal area sets for the integer pairs (12,5) (12,6) (12,7) and (12,8) with the obvious relevance to scales in our normal chromatic collection of 12 pitches. Complementary maximal area sets are those sets where the chosen K notes realize maximal area, and the complementary N −K notes also realize maximal area. The complementary maximal area sets closely match a significant collection of scales identified in a book on jazz theory by Mark Levine [9].
منابع مشابه
Geometry and Harmony
A musical scale can be viewed as a subset of notes or pitches taken from a chromatic universe. Given integers (N,K) N > K we use particular integer partitions of N into K parts to construct distinguished sets, or scales. We show that a natural geometric realization of these sets have maximal area, so we call them maximal area sets. We then discuss properties of maximal area sets for the integer...
متن کاملSome results on maximal open sets
In this paper, the notion of maximal m-open set is introduced and itsproperties are investigated. Some results about existence of maximal m-open setsare given. Moreover, the relations between maximal m-open sets in an m-spaceand maximal open sets in the corresponding generated topology are considered.Our results are supported by examples and counterexamples.
متن کاملMaximal Independent Sets for the Pixel Expansion of Graph Access Structure
Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...
متن کاملMAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE
Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...
متن کاملCertain subalgebras of Lipschitz algebras of infinitely differentiable functions and their maximal ideal spaces
We study an interesting class of Banach function algebras of innitely dierentiable functions onperfect, compact plane sets. These algebras were introduced by Honary and Mahyar in 1999, calledLipschitz algebras of innitely dierentiable functions and denoted by Lip(X;M; ), where X is aperfect, compact plane set, M = fMng1n=0 is a sequence of positive numbers such that M0 = 1 and(m+n)!Mm+n ( m!Mm)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 23 شماره
صفحات -
تاریخ انتشار 2007