Hypercubic billiard word: Difference between revisions

In the rational case, let ''w'' be a scale word with signature ''a''₁X₁ ... ''a''_''d''X_''d'' (i.e. ''w'' is a scale word with ''a''_''i''-many X_''i'' steps) and let '''a''' = (''a''₁, ..., ''a''_''d''), which we call the ''velocity''.

We call ''w'' a '''rank-'''''d'' '''billiard scale''' if there exists a vector '''b''' ∈ ℝ^''d'' such that the line '''a'''''t'' + '''b''' has intersections with coordinate level planes ''x''_''i'' = ''k'' ∈ ℤ that spell out the scale as you move in the positive ''t'' direction along that line.  

This definition is equivalent to the definition given in terms of a billiard ball in a cubic room: We first fire off the billiard ball in the direction '''a''' = (''a''₁, ..., ''a''_''d'') given by the scale signature. For integer ''a''_''i'', the particle's trajectory will be periodic, and for almost any starting point, the particle will only collide with one wall at a time. The pattern of which walls the particle collides with then spells out a billiard scale of the given signature, though for [[arity]] higher than 2, this can yield rotationally inequivalent scales depending on the starting point.

* 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; [[blackdye]] can be checked to be a billiard scale by using the initial position (1, 1/√5, 1/√3), but it is not a Fokker block.

* A ''d''-ary billiard scale is (''d'' &minus; 1)-[[balance|block balanced]] and (''d'' &minus; 1)-[[balance|chain balanced]].<ref name="vuillon"/><ref name="sano">Sano, S., Miyoshi, N., & Kataoka, R. (2004). m-Balanced words: A generalization of balanced words. Theoretical computer science, 314(1-2), 97-120.</ref> However, scales on at least 3 letters satisfying the block balance bound need not be billiard scales.

* An aperiodic ''d''-ary billiard scale has maximum variety at most 2^{''d''&minus;1}.<ref name="andrieu">Mélodie Andrieu, Léo Vivion. Minimal Complexities for Infinite Words Written with d Letters. Combinatorics on Words - 14th International Conference, WORDS, Jun 2023, Umeå, Sweden. pp.3–13.</ref> Hence this bound must hold for periodic ''d''-ary billiard scales as well.

The following discussion documents a naive algorithm for answering whether a circular word ''s'' over ''d'' letters with velocity '''a''' = ∑_''i'' ''a''_''i'' '''e'''_''i'' ∈ ℤ^''d'' (representing the signature ''a''₁''x''₁...''a''_''d''''x''_''d'') is a billiard word:

Consider the ''d''-dimensional prism ''P'' = ∏^''d''_''i''=1 [0, ''a''_''i'']. Since the pattern in which the billiard line ''L'' = ''L''(''t'') = '''a'''''t'' + ''b'' hits integer coordinate hyperplanes (i.e. sets ''x''_''i'' = ''n'' for ''n'' ∈ ℤ) is periodic with period 1 in ''t'', we may first regard ''P'' as a ''d''-torus and ''L'' : ℝ → ''P'' as a periodic function with period 1.  Because ''s'' is a billiard word, ''L'' ''cannot'' meet any point '''q''' = (''q''₁, ..., ''q''_''d'') ∈ ℝ^''d'' where two coordinates, ''q''_''i'' and ''q''_''j'', ''i'' < ''j'', are integers. Thus for two distinct integers ''i'' < ''j'' in {1, ..., ''d''}, any choice of two integers ''m''_''i'' ∈ {0, ..., ''a''_''i''} and ''n''_''j'' ∈ {0, ..., ''b''_''j''} corresponds to the affine hyperplane (which we call a ''constraint hyperplane'')

where the circumflexes indicate that the ''i''th and ''j''th basis vectors are to be omitted. In particular, ''L'' and ''H''(''m''_''i'', ''n''_''j'') are disjoint for any ''i'' < ''j'', any ''m''_''i'' ∈ {0, ..., ''a''_''i'' &minus; 1}, and any ''n''_''j'' ∈ {0, ..., ''b''_''j'' &minus; 1}.

Now, using the identifications '''e'''_''i'' = 0 for ''i'' in {1, ..., ''d''} on ''P'' results in a smaller ''d''-torus ''C'' whose fundamental domain in ℝ^''d'' is the unit cube ''C̄'' = ∏^''d''_''i''=1 [0, 1]. The path ''L'' descends to ''L'' : ℝ → ''C'' which is still periodic with period 1. The constraint hyperplanes also descend to ''C''. Now unwrap ''C'' into ''C̄'', and regard ''L'' as a subset of ''C̄'' that is partitioned into disjoint line segments that travel from one facet (i.e. a (''d'' &minus; 1)-dimensional face) of ''C̄'' to another. The reader is warned that to find (the images of) all of the constraint hyperplanes in ''C̄'', any constraint hyperplane that does not meet ''C̄'' should be shifted by integer increments in coordinates so that the shifted hyperplane does meet ''C̄''. The constraint hyperplanes partition ''C̄'' into finitely many regions (as they do for ''P''), and any valid billiard path ''L'' in ''C̄'' must meet len(''s'')-many of these regions before returning to its starting point.

Now we use the projection π, a linear map on ℝ^''d'' whose kernel is generated by '''a''', to project ''C̄'' to a (''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''_''i'' = (some integer), the corresponding point in π(''L'') now shifts by &minus;π('''e'''_''i''), since the corresponding point in ''C̄'' must undergo a shift by &minus;'''e'''_''i'' 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 (all of which are convex polytopes) in the partition we obtained in π(''C̄''); we may choose the centroid of the region as the starting point of π(''L'').

* Is there a cleverer algorithm for checking whether a scale on more than 2 letters is a billiard scale?