Boris Tsirelson,
"Random compact set meets the graph of nonrandom continuous function"
Available online (free of charge) from e-print archive:
arXiv.org/abs/1308.5112/

A research paper, 6 pages, bibl. 4 refs.

On the plane, every random compact set with almost surely uncountable first projection intersects with a high probability the graph of some continuous function. Implication: every black noise over the plane fails to factorize when the plane is split by such graph.

1. Introduction and result.
1. The construction.
2. The proof.
3. Implications for noise theory.