Introduction: Motivation

Comparing targeted patching algorithms against a benchmark uniformly random patching strategy and proposing a new containment strategy by partitioning mobiles appropriately based on their social relationship graph are compared.

Abstract

The introduction motivates the remainder of the book via two specific examples of theorems from the early days of symplectic topology in which intersection theory plays a prominent role. We sketch closely analogous proofs of both theorems, emphasizing the way that intersection theory is used, but point out why the second theorem (on symplectic 4-manifolds that are standard near infinity) requires a nonobvious extension of homological intersection theory to punctured holomorphic curves. We then discuss informally some of the properties this theory will need to have and what kinds of subtle issues may arise.