Title: On Almost Polynomially Convex Sets and Applications

Abstract: In this talk I will describe what an almost polynomially convex set is, show how any union of disjoint cubes in R^d is almost polynomially convex and (in the end) show how to use this to construct a stationary random entire function with dense orbit almost surely. This talk is based on joint work with B. Weiss.

While it is part (b) of last week, most of the talk is independent.