  We developed several combinatorial notions about these laminations some with
clear implications for parameter space. We introduce a simplified class of
laminations called finite dynamical laminations (FDL). In order to count FDL,
we introduce sibling portraits, of which we provide a comprehensive counting
theorem. We introduce the pullback tree, and show that all FDL have a child in
it. This gives a characterization of which periodic polygons appear in
invariant laminations. The base of the pullback tree is a set of laminations,
and we show that those laminations have very nice properties. We define the
generational FDL graph, and it provides a summary of the combinatorial
information we provide about polynomial parameter space.
