The Doorways Problem and Sturmian Words
Abstract
The doorways problem considers adjacent parallel hallways of unit width each with a single doorway (aligned with integer lattice points) of unit width. It then asks, what are the properties of lines that pass through each doorway? Configurations of doorways closely correspond to Sturmian words, and so properties of these configurations may be lifted to properties of Sturmian words. This paper classifies the slopes of lines of sight, lines that pass through each doorway, for both the case of a finite number of parallel hallways and an infinite number and their consequences for Sturmian words. We then produce a metric on configurations with an infinite number of hallways that preserves the property of admitting a line of sight under limits. Pulling back this metric to R, we produce the Baire metric under which the irrational numbers form a complete metric space. Pulling back this metric to the set of all Sturmian sequences, we show that the set of all Sturmian sequences is complete with this metric (unlike with the standard metric).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.