Rank-3 scale theorems: Difference between revisions

Line 24:

First attempt at a definition: "A scale word ''S'' with ''k'' step sizes X_1, ..., X_k (with a_1 X_1's, ..., and a_k X_k's) is ''line-quantizing'' (LQ) if ''S'', when viewed as a set of instructions tracing a path in Z^k from the origin (in which each X_i means "go 1 step in the positive x_i direction"), results in a path that is a closest approximation to the line [a_1 : a_2 : ... : a_k] intersecting the origin in R^k."

The problem with this definition is that it is unclear what "closest approximation" means. We take several different definitions of that phrase and define different versions of LQ property.

The problem with this definition is that it is unclear what "closest approximation" means. We take several different definitions of that phrase and define different versions of the LQ property.

Let n = a+b+c be the scale size, w = aX bY cZ be the scale word, let R be the corresponding path following the word w (R(k) = your location after taking k steps according to w), and put n+1 equally spaced points p_n on the line segment L = {(a,b,c)t : 0 <= t <= n}, i.e. the points {L(k) = (a,b,c) k : k ∈ {0, ..., n}}.

@@ Line 24: / Line 24: @@
 First attempt at a definition: "A scale word ''S'' with ''k'' step sizes X_1, ..., X_k (with a_1 X_1's, ..., and a_k X_k's) is ''line-quantizing'' (LQ) if ''S'', when viewed as a set of instructions tracing a path in Z^k from the origin (in which each X_i means "go 1 step in the positive x_i direction"), results in a path that is a closest approximation to the line [a_1 : a_2 : ... : a_k] intersecting the origin in R^k."
-The problem with this definition is that it is unclear what "closest approximation" means. We take several different definitions of that phrase and define different versions of LQ property.
+The problem with this definition is that it is unclear what "closest approximation" means. We take several different definitions of that phrase and define different versions of the LQ property.
 Let n = a+b+c be the scale size, w = aX bY cZ be the scale word, let R be the corresponding path following the word w (R(k) = your location after taking k steps according to w), and put n+1 equally spaced points p_n on the line segment L = {(a,b,c)t : 0 <= t <= n}, i.e. the points {L(k) = (a,b,c) k : k ∈ {0, ..., n}}.