Subword complexity and projection bodies

A polytope P⊆[0,1d) and an induce a so-called Hartman sequence which is by definition 1 at the kth position if and 0 otherwise, k∈Z. We prove an asymptotic formula for the subword complexity of such a Hartman sequence. This result establishes a connection between symbolic dynamics and convex geometry: If the polytope P is convex then the subword complexity of asymptotically equals the volume of the projection body ΠP of P for almost all .