In this talk we examine when these sewn ribbon complexes embed in
3-space. We give several characterizations of these spatial ribbons
complexes. We also consider the theoretical and algorithmic
implications of our characterizations. The problem seems to lie right
on the boundary (assuming there is one) between polynomial and
Tea. High tea will be served at 3:30 pm in the Lounge.
Emmy's. Certain refreshments will be available at Emmy's after the talk.
Host. Michael Orrison is the host. Anybody who is interested in having dinner with the speaker should contact Michael at 643-2374.