Hypercubic billiard word: Difference between revisions
ArrowHead294 (talk | contribs) m →Open questions: Lol, "cleverer" |
|||
| (2 intermediate revisions by the same user not shown) | |||
| Line 15: | Line 15: | ||
== Properties == | == Properties == | ||
Proofs to be added | Proofs to be added | ||
* A (circular) scale word is a rank-2 billiard scale | * A (circular) scale word is a rank-2 billiard scale iff it is a MOS scale. | ||
* All [[distributionally even]] scales on any finite number of letters are billiard scales<ref name="sano"/>. The converse fails, because not all billiard scales are Fokker blocks (DE implies the scale is a Fokker block); [[blackdye]] can be checked to be a billiard scale by using the initial position <math>\left(1, \frac{1}{\sqrt{5}}, \frac{1}{\sqrt{3}}\right)</math>, but it is not a Fokker block. | * All [[distributionally even]] scales on any finite number of letters are billiard scales<ref name="sano"/>. The converse fails, because not all billiard scales are Fokker blocks (DE implies the scale is a Fokker block); [[blackdye]] can be checked to be a billiard scale by using the initial position <math>\left(1, \frac{1}{\sqrt{5}}, \frac{1}{\sqrt{3}}\right)</math>, but it is not a Fokker block. | ||
* A billiard scale becomes a billiard scale over fewer letters when one removes all instances of some subset of its step sizes. In particular, ternary billiard scales are ''deletion-MOS'' (DMOS): deleting any step size results in a MOS. However, the converse is false. | * A billiard scale becomes a billiard scale over fewer letters when one removes all instances of some subset of its step sizes. In particular, ternary billiard scales are ''deletion-MOS'' (DMOS): deleting any step size results in a MOS. However, the converse is false. | ||
| Line 28: | Line 28: | ||
== Determining whether a scale word is a billiard scale == | == Determining whether a scale word is a billiard scale == | ||
The following discussion documents a naive algorithm for answering whether a circular word ''s'' over ''d'' letters with step signature ''a''<sub>1</sub>''x''<sub>1</sub>...''a''<sub>''d''</sub>''x''<sub>''d''</sub> is a billiard word with velocity <math>\mathbf{a} = \sum_{i}a_{i} | The following discussion documents a naive algorithm for answering whether a circular word ''s'' over ''d'' letters with step signature ''a''<sub>1</sub>''x''<sub>1</sub>...''a''<sub>''d''</sub>''x''<sub>''d''</sub> is a billiard word with velocity <math>\mathbf{a} = \sum_{i}a_{i}\mathbf{e}_{i} \in \mathbb{Z}^{d}</math>: | ||
Consider the ''d''-dimensional prism <math>P = \prod^{d}_{i = 1}\left[0, a_{i}\right]</math> | Consider the ''d''-dimensional prism <math>P = \prod^{d}_{i = 1}\left[0, a_{i}\right].</math> Since the pattern in which the billiard line {{nowrap|''L'' {{=}} ''L''(''t'')}} {{nowrap|{{=}} '''a'''''t'' + ''b''}} hits integer coordinate hyperplanes (i.e. sets {{nowrap|''x''<sub>''i''</sub> {{=}} ''n''}} for {{nowrap|''n'' ∈ ℤ}}) is periodic with period 1 in ''t'', we may first regard ''P'' as a ''d''-torus and {{nowrap|''L'' : ℝ → ''P''}} as a periodic function with period 1. Because ''s'' is a billiard word, ''L cannot'' meet any point {{nowrap|'''q''' {{=}} (''q''<sub>1</sub>, ..., ''q''<sub>''d''</sub>)}} ∈ ℝ<sup>''d''</sup> where two coordinates, ''q''<sub>''i''</sub> and ''q''<sub>''j''</sub>, {{nowrap|''i'' < ''j''}}, are integers. Thus for two distinct integers {{nowrap|''i'' < ''j''}} in {1, ..., ''d''}, any choice of two integers {{nowrap|''m''<sub>''i''</sub> ∈ {{(}}0, ..., ''a''<sub>''i''</sub>{{)}}}} and {{nowrap|''n''<sub>''j''</sub> ∈ {{(}}0, ..., ''b''<sub>''j''</sub>{{)}}}} corresponds to the affine hyperplane (which we call a ''constraint hyperplane'') | ||
<math>H(m_i, n_j) = \operatorname{span}(\mathbf{a}, \mathbf{e}_1, ..., \hat{\mathbf{e}}_i, ..., \hat{\mathbf{e}}_j, ..., \mathbf{e}_r) + (m_i \mathbf{e}_i + n_j \mathbf{e}_j),</math> | <math>H(m_i, n_j) = \operatorname{span}(\mathbf{a}, \mathbf{e}_1, ..., \hat{\mathbf{e}}_i, ..., \hat{\mathbf{e}}_j, ..., \mathbf{e}_r) + (m_i \mathbf{e}_i + n_j \mathbf{e}_j),</math> | ||