MOS substitution: Difference between revisions

Line 51:

== Original derivation ==

~~Originally~~ developed by Inthar for the purpose of adding [[aberrisma]] steps in an orderly manner to a MOS pattern <math>a\mathbf{L}b\mathbf{m}</math> (which we write in place of <math>a\mathbf{L}b\mathbf{s}</math> for convenience's sake, since <math>\mathbf{s}</math> denotes the new aberrisma steps added to the MOS) in the context of groundfault's [[aberrismic theory]], MOS substitution is intended to take advantage of extra potential symmetry when <math>a, c</math> or <math>b, c</math> is not a coprime pair and mildly generalize the congruence substitution procedure for building [[balanced]] words to obtain non-balanced but still more "even" scales with simple [[generator sequence]] expressions (in the sense of being binary, i.e. using only two distinct generators). The idea is that modifying the input scales in a sufficiently controlled fashion from the nicest case of MOS template scales and MOS filling scales whose period divides the count of unknown letters in the template will result in a scale that retains some degree of elegance in its lattice structure. However, this condition is not necessary for MOS substitution to result in a binary generator sequence (with two distinct generators), though the generator sequence necessary to generate the scale will be longer.

Independently developed by groundfault (and Inthar later, for the purpose of adding [[aberrisma]] steps in an orderly manner to a MOS pattern <math>a\mathbf{L}b\mathbf{m}</math> (which we write in place of <math>a\mathbf{L}b\mathbf{s}</math> for convenience's sake, since <math>\mathbf{s}</math> denotes the new aberrisma steps added to the MOS) in the context of groundfault's [[aberrismic theory]]), MOS substitution is intended to take advantage of extra potential symmetry when <math>a, c</math> or <math>b, c</math> is not a coprime pair and mildly generalize the congruence substitution procedure for building [[balanced]] words to obtain non-balanced but still more "even" scales with simple [[generator sequence]] expressions (in the sense of being binary, i.e. using only two distinct generators). The idea is that modifying the input scales in a sufficiently controlled fashion from the nicest case of MOS template scales and MOS filling scales whose period divides the count of unknown letters in the template will result in a scale that retains some degree of elegance in its lattice structure. However, this condition is not necessary for MOS substitution to result in a binary generator sequence (with two distinct generators), though the generator sequence necessary to generate the scale will be longer.

In the original aberrismic-informed context, say that <math>d = (a, c) > 1.</math> Consider the MOS word <math>(a + c)\mathbf{X}b\mathbf{m}</math>, which we call the ''template MOS''. Since the "most even" arrangement (in the sense of [[distributional evenness]]) of <math>a</math>-many <math>\mathbf{L}</math> steps and <math>c</math>-many <math>\mathbf{s}</math> steps is the MOS <math>a\mathbf{L}b\mathbf{s}</math> (which will in general be a non-[[primitive]] MOS), this method prescribes following the latter MOS, called the ''filling MOS'', to fill in the <math>\mathbf{X}</math> steps. Fixing a choice of which <math>\mathbf{X}</math> in the MOS <math>(a + c)\mathbf{X}b\mathbf{m}</math> you start from, we can choose one of <math>(a+c)/d</math> modes of <math>a \mathbf{L} c \mathbf{s}.</math> If <math>a = c</math>, we obtain a balanced (thus MV3) ternary scale; when in addition <math>b</math> is odd, the scale is also SV3 and chiral, and we recover the two chiralities from the two modes of <math>a\mathbf{L}a\mathbf{s}</math>. Of course, one may do this using template MOS <math>a\mathbf{L}(b + c)\mathbf{X}</math> and the <math>(b, c)</math>-multiperiod filling MOS <math>b\mathbf{m} c\mathbf{s}</math> instead. This article denotes the resulting scale <math>\mathsf{MOS\_subst}(a, b, c; \mathbf{y}, \mathbf{z}; k):</math>

@@ Line 51: / Line 51: @@
 == Original derivation ==
-Originally developed by Inthar for the purpose of adding [[aberrisma]] steps in an orderly manner to a MOS pattern <math>a\mathbf{L}b\mathbf{m}</math> (which we write in place of <math>a\mathbf{L}b\mathbf{s}</math> for convenience's sake, since <math>\mathbf{s}</math> denotes the new aberrisma steps added to the MOS) in the context of groundfault's [[aberrismic theory]], MOS substitution is intended to take advantage of extra potential symmetry when <math>a, c</math> or <math>b, c</math> is not a coprime pair and mildly generalize the congruence substitution procedure for building [[balanced]] words to obtain non-balanced but still more "even" scales with simple [[generator sequence]] expressions (in the sense of being binary, i.e. using only two distinct generators). The idea is that modifying the input scales in a sufficiently controlled fashion from the nicest case of MOS template scales and MOS filling scales whose period divides the count of unknown letters in the template will result in a scale that retains some degree of elegance in its lattice structure. However, this condition is not necessary for MOS substitution to result in a binary generator sequence (with two distinct generators), though the generator sequence necessary to generate the scale will be longer.
+Independently developed by groundfault (and Inthar later, for the purpose of adding [[aberrisma]] steps in an orderly manner to a MOS pattern <math>a\mathbf{L}b\mathbf{m}</math> (which we write in place of <math>a\mathbf{L}b\mathbf{s}</math> for convenience's sake, since <math>\mathbf{s}</math> denotes the new aberrisma steps added to the MOS) in the context of groundfault's [[aberrismic theory]]), MOS substitution is intended to take advantage of extra potential symmetry when <math>a, c</math> or <math>b, c</math> is not a coprime pair and mildly generalize the congruence substitution procedure for building [[balanced]] words to obtain non-balanced but still more "even" scales with simple [[generator sequence]] expressions (in the sense of being binary, i.e. using only two distinct generators). The idea is that modifying the input scales in a sufficiently controlled fashion from the nicest case of MOS template scales and MOS filling scales whose period divides the count of unknown letters in the template will result in a scale that retains some degree of elegance in its lattice structure. However, this condition is not necessary for MOS substitution to result in a binary generator sequence (with two distinct generators), though the generator sequence necessary to generate the scale will be longer.
 In the original aberrismic-informed context, say that <math>d = (a, c) > 1.</math> Consider the MOS word <math>(a + c)\mathbf{X}b\mathbf{m}</math>, which we call the ''template MOS''. Since the "most even" arrangement (in the sense of [[distributional evenness]]) of <math>a</math>-many <math>\mathbf{L}</math> steps and <math>c</math>-many <math>\mathbf{s}</math> steps is the MOS <math>a\mathbf{L}b\mathbf{s}</math> (which will in general be a non-[[primitive]] MOS), this method prescribes following the latter MOS, called the ''filling MOS'', to fill in the <math>\mathbf{X}</math> steps. Fixing a choice of which <math>\mathbf{X}</math> in the MOS <math>(a + c)\mathbf{X}b\mathbf{m}</math> you start from, we can choose one of <math>(a+c)/d</math> modes of <math>a \mathbf{L} c \mathbf{s}.</math> If <math>a = c</math>, we obtain a balanced (thus MV3) ternary scale; when in addition <math>b</math> is odd, the scale is also SV3 and chiral, and we recover the two chiralities from the two modes of <math>a\mathbf{L}a\mathbf{s}</math>. Of course, one may do this using template MOS <math>a\mathbf{L}(b + c)\mathbf{X}</math> and the <math>(b, c)</math>-multiperiod filling MOS <math>b\mathbf{m} c\mathbf{s}</math> instead. This article denotes the resulting scale <math>\mathsf{MOS\_subst}(a, b, c; \mathbf{y}, \mathbf{z}; k):</math>