User talk:FloraC: Difference between revisions

Line 27:

Combinations of primes are more complicated, and some of the nuances are yet to be considered in this realm, but it's safe to say that there are more types of telicity available in such cases- namely "full telicity" and "partial telicity". Full telicity for combinations involving multiple primes occurs when the EDO in question is able to stack a number of instances of a given combination's [[patent interval]] to connect with an interval belonging to a chain created by the [[patent interval]] for a prime that is lower than the lowest prime in the initial combination. In contrast, partial telicity for combinations involving multiple primes occurs when the EDO in question is able to stack a number of instances of a given combination's [[patent interval]] to connect with an interval belonging to a chain created by the [[patent interval]] for a prime that is lower than the highest prime in the initial combination.

Given that different EDOs can temper out different commas to achieve the same type of telicity- for example, [[12edo]] tempers out the [[Pythagorean comma]] to achieve 3-to-2 telicity, while [[53edo]] tempers out [[Mercator's comma]] to achieve 3-to-2 telicity, it can thus be argued that sequences of different EDOs demonstrating one or more types of telicity can be compiled. For instance, the first seven EDOs to demonstrate 3-to-2 telicity specifically are {{EDOs| 2, 5, 12, 24, 53, 106, 159 }}- I checked this without an algorithm available to me, and this is the result I got.

Given that different EDOs can temper out different commas to achieve the same type of telicity- for example, [[12edo]] tempers out the [[Pythagorean comma]] to achieve 3-to-2 telicity, while [[53edo]] tempers out [[Mercator's comma]] to achieve 3-to-2 telicity, it can thus be argued that sequences of different EDOs demonstrating one or more types of telicity can be compiled. For instance, the first seven EDOs to demonstrate 3-to-2 telicity specifically are {{EDOs| 2, 5, 12, 24, 53, 106, 159 }} (yes, I checked this without a computer algorithm available to me, and this is the result I got).

I hope this idea makes more sense than my initial attempts to talk about it on the [[Talk:159edo|159edo talk page]]. --[[User:Aura|Aura]] ([[User talk:Aura|talk]]) 07:03, 19 January 2021 (UTC)

@@ Line 27: / Line 27: @@
 Combinations of primes are more complicated, and some of the nuances are yet to be  considered in this realm, but it's safe to say that there are more types of telicity available in such cases- namely "full telicity" and "partial telicity".  Full telicity for combinations involving multiple primes occurs when the EDO in question is able to stack a number of instances of a given combination's [[patent interval]] to connect with an interval belonging to a chain created by the [[patent interval]] for a prime that is lower than the lowest prime in the initial combination.  In contrast, partial telicity for combinations involving multiple primes occurs when the EDO in question is able to stack a number of instances of a given combination's [[patent interval]] to connect with an interval belonging to a chain created by the [[patent interval]] for a prime that is lower than the highest prime in the initial combination.
-Given that different EDOs can temper out different commas to achieve the same type of telicity- for example, [[12edo]] tempers out the [[Pythagorean comma]] to achieve 3-to-2 telicity, while [[53edo]] tempers out [[Mercator's comma]] to achieve 3-to-2 telicity, it can thus be argued that sequences of different EDOs demonstrating one or more types of telicity can be compiled.  For instance, the first seven EDOs to demonstrate 3-to-2 telicity specifically are {{EDOs| 2, 5, 12, 24, 53, 106, 159 }}- I checked this without an algorithm available to me, and this is the result I got.
+Given that different EDOs can temper out different commas to achieve the same type of telicity- for example, [[12edo]] tempers out the [[Pythagorean comma]] to achieve 3-to-2 telicity, while [[53edo]] tempers out [[Mercator's comma]] to achieve 3-to-2 telicity, it can thus be argued that sequences of different EDOs demonstrating one or more types of telicity can be compiled.  For instance, the first seven EDOs to demonstrate 3-to-2 telicity specifically are {{EDOs| 2, 5, 12, 24, 53, 106, 159 }} (yes, I checked this without a computer algorithm available to me, and this is the result I got).
 I hope this idea makes more sense than my initial attempts to talk about it on the [[Talk:159edo|159edo talk page]]. --[[User:Aura|Aura]] ([[User talk:Aura|talk]]) 07:03, 19 January 2021 (UTC)