Generator-offset property: Difference between revisions
| Line 203: | Line 203: | ||
Suppose a step of S is reached by stacking t-many k-steps. We have three cases after accounting for equave complements: | Suppose a step of S is reached by stacking t-many k-steps. We have three cases after accounting for equave complements: | ||
t = 1: S is equivalent to abacaba. | # t = 1: S is equivalent to abacaba. | ||
# t = 2: QR QQ RQ IQ RQ QR QI => S is equivalent to abacaba. | |||
t = 2: QR QQ RQ IQ RQ QR QI => S is equivalent to abacaba. | # t = 3: QRQ QRQ IQR QQR QIQ RQQ RQI => S is equivalent to abacaba. | ||
t = 3: QRQ QRQ IQR QQR QIQ RQQ RQI => S is equivalent to abacaba. | |||
(This also implies S is SV3.) | (This also implies S is SV3.) | ||
| Line 237: | Line 235: | ||
[Case 3.10: (x, y) = (floor(n/μ), 2*floor(n/μ) + 3)] | [Case 3.10: (x, y) = (floor(n/μ), 2*floor(n/μ) + 3)] | ||
] | ] | ||
END CASEBLOCK 3.x] | END CASEBLOCK 3.x] | ||
End Case 3.] | End Case 3.] | ||
== Open conjectures == | == Open conjectures == | ||