MOS substitution: Difference between revisions

Line 5:

For 5L2m4s, we obtain mLsLsLmLsLs, sLsLmLsLsLm, and sLmLsLsLmLs. The first two are a chiral pair that are billiard scales, and the last is achiral, but it is not deletion-MOS. All three scales admit short generator sequences of 2-steps, respectively GS(L+s, L+s, L+m), GS(L+s, L+m, L+s), and GS(L+m, L+s, L+s), notably representing all 3 possible permutations of (L+s, L+m, L+s).

Open question: Is the length of the shortest guided generator sequence related to the length of the filler MOS? That wouldn't be true for 5L2m3s whose filler MOS is 2m3s and whose shortest generator sequence is GS(s, L, s, m). It could hold when the scale pattern has the divisibilities that this procedure is intended to take advantage of.

Open question: Is the length of the shortest guided generator sequence related to the length of the filler MOS? That wouldn't be true for 5L2m3s whose filler MOS is 2m3s and whose shortest guided generator sequence is GS(s, L, s, m). It could hold when the scale pattern has the divisibilities that this procedure is intended to take advantage of.

Revision as of 13:08, 19 January 2024 view source Inthar (talk \| contribs) autopatrolled, emailconfirmed 15,668 edits No edit summary ← Older edit		Revision as of 13:11, 19 January 2024 view source Inthar (talk \| contribs) autopatrolled, emailconfirmed 15,668 edits No edit summary Newer edit →
Line 5:		Line 5:
	For 5L2m4s, we obtain mLsLsLmLsLs, sLsLmLsLsLm, and sLmLsLsLmLs. The first two are a chiral pair that are billiard scales, and the last is achiral, but it is not deletion-MOS. All three scales admit short generator sequences of 2-steps, respectively GS(L+s, L+s, L+m), GS(L+s, L+m, L+s), and GS(L+m, L+s, L+s), notably representing all 3 possible permutations of (L+s, L+m, L+s).		For 5L2m4s, we obtain mLsLsLmLsLs, sLsLmLsLsLm, and sLmLsLsLmLs. The first two are a chiral pair that are billiard scales, and the last is achiral, but it is not deletion-MOS. All three scales admit short generator sequences of 2-steps, respectively GS(L+s, L+s, L+m), GS(L+s, L+m, L+s), and GS(L+m, L+s, L+s), notably representing all 3 possible permutations of (L+s, L+m, L+s).

	Open question: Is the length of the shortest guided generator sequence related to the length of the filler MOS? That wouldn't be true for 5L2m3s whose filler MOS is 2m3s and whose shortest generator sequence is GS(s, L, s, m). It could hold when the scale pattern has the divisibilities that this procedure is intended to take advantage of.		Open question: Is the length of the shortest guided generator sequence related to the length of the filler MOS? That wouldn't be true for 5L2m3s whose filler MOS is 2m3s and whose shortest guided generator sequence is GS(s, L, s, m). It could hold when the scale pattern has the divisibilities that this procedure is intended to take advantage of.