Polygons on two-dimensional Brownian paths (Q1084765)

Let \(w(t)\), \(0\leq t<\infty\) be the standard Brownian process in the plane. The key result of the paper is the following: Let \(0,z_ 1,...,z_ k\) be any polygonal path with \(k+1\) (not necessarily distinct) vertices, then there exist almost surely (a.s.) translates of it with vertices on the Brownian path. Moreover, these translates are a.s. dense in the plane and the passage times of the Brownian path can be a.s. prescribed with arbitrary accuracy. If \(z_ 1=...=z_ k=0\) the result yields the a.s. existence of points of arbitrary high finite multiplicity on plane Brownian paths. This was proven by the author, \textit{P. Erdős} and \textit{S. Kakutani} in Bull. Res. Council Israel 7F, 175-180 (1958). However, even in this case the present paper gives additional information about recurrence times. The result about the placing of the vertices on the Brownian path extends to infinite polygons. In general, however, the passage times can be prescribed with arbitrary accuracy only for a finite number of vertices (they can be bounded from below for all). The method of proof is similar to that in the above quoted paper.