Interval variety: Difference between revisions
No edit summary |
|||
| Line 15: | Line 15: | ||
Theorem: for all ''n'' ≥ 1, the word '''0123'''...('''''n''-1''') is SV''n''. | Theorem: for all ''n'' ≥ 1, the word '''0123'''...('''''n''-1''') is SV''n''. | ||
Proof | {{Proof|contents=All ''k''-letter subwords of '''0123'''...('''''n''-1''') is of the form ('''i''')('''i+1''')...('''i+k-1'''), and there are exactly ''n'' of them.}} | ||
Theorem: for all ''n'' ≥ 1, the word '''0123'''...('''''n''-2''')('''''n''-1''')('''''n''-2''')...'''3210''' is SV''n''. | Theorem: for all ''n'' ≥ 1, the word '''0123'''...('''''n''-2''')('''''n''-1''')('''''n''-2''')...'''3210''' is SV''n''. | ||
Proof | {{Proof|contents=We prove this by dividing this word into four overlapping noncircular subwords which cover all cases. | ||
Consider the subwords '''0123'''...('''''n''-2''')('''''n''-1''') and ('''''n''-1''')('''''n''-2''')...'''3210'''. If we treat there two words as noncircular, then there are ''n''-''k'' distinct ''k''-letter subwords. | Consider the subwords '''0123'''...('''''n''-2''')('''''n''-1''') and ('''''n''-1''')('''''n''-2''')...'''3210'''. If we treat there two words as noncircular, then there are ''n''-''k'' distinct ''k''-letter subwords. | ||
| Line 33: | Line 33: | ||
(''n'' - ''k'') + 2(''k''/2) = ''n'' (''k'' even) | (''n'' - ''k'') + 2(''k''/2) = ''n'' (''k'' even) | ||
distinct ''k''-letter subwords, so the word is SV''n''. | distinct ''k''-letter subwords, so the word is SV''n''.}} | ||
=== Abstractly SV4 scale patterns === | === Abstractly SV4 scale patterns === | ||