Hypercubic billiard word: Difference between revisions

Inthar (talk | contribs)
No edit summary
Tags: Mobile edit Mobile web edit
Inthar (talk | contribs)
No edit summary
Line 33: Line 33:
Now we use the projection π, a linear map on ℝ<sup>''d''</sup> whose kernel is generated by '''a''', to project ''C̄'' to an (''d'' &minus; 1)-dimensional convex polytope π(''C̄''). The constraint hyperplanes now become (''d'' &minus; 2)-dimensional hyperplanes that partition π(''C̄'') into finitely many convex regions. The components of ''L'' now become points in π(''C̄''), and each region in the partition has at most one point of π(''L''). When ''L'' hits an integer coordinate hyperplane ''x''<sub>''i''</sub> = (some integer), the corresponding point in π(''L'') now shifts by &minus;π('''e'''<sub>''i''</sub>), since the corresponding point in ''C̄'' must undergo a shift by &minus;'''e'''<sub>''i''</sub> upon ''L'' hitting the coordinate hyperplane. Since ''L'' hits len(''s'') coordinate hyperplanes before returning to its starting region, if we choose any point in π(''L'') and shift it len(''s'') times, each corresponding to the coordinate of the hyperplane hit by ''L''. To find all billiard scales with signature '''a''', we simply iterate the procedure described in the previous sentence over all regions in the partition we obtained in π(''C̄''); we may choose the centroid of the region (which is a convex polytope) as the starting point of π(''L'').
Now we use the projection π, a linear map on ℝ<sup>''d''</sup> whose kernel is generated by '''a''', to project ''C̄'' to an (''d'' &minus; 1)-dimensional convex polytope π(''C̄''). The constraint hyperplanes now become (''d'' &minus; 2)-dimensional hyperplanes that partition π(''C̄'') into finitely many convex regions. The components of ''L'' now become points in π(''C̄''), and each region in the partition has at most one point of π(''L''). When ''L'' hits an integer coordinate hyperplane ''x''<sub>''i''</sub> = (some integer), the corresponding point in π(''L'') now shifts by &minus;π('''e'''<sub>''i''</sub>), since the corresponding point in ''C̄'' must undergo a shift by &minus;'''e'''<sub>''i''</sub> upon ''L'' hitting the coordinate hyperplane. Since ''L'' hits len(''s'') coordinate hyperplanes before returning to its starting region, if we choose any point in π(''L'') and shift it len(''s'') times, each corresponding to the coordinate of the hyperplane hit by ''L''. To find all billiard scales with signature '''a''', we simply iterate the procedure described in the previous sentence over all regions in the partition we obtained in π(''C̄''); we may choose the centroid of the region (which is a convex polytope) as the starting point of π(''L'').


== Open questions ==
* For an arbitrary billiard scale, does there exist an interval class ''j'' coprime to len(scale) such that the [[necklace]] of ''j''-steps has an interval occurring exactly once? This conjecture, if proven, could imply that any billiard scale has a well-formed [[generator sequence]] that generates CS scales when extended further.
== See also ==
== See also ==
* List of [[ternary billiard words of length at most 31]]
* List of [[ternary billiard words of length at most 31]]