# HG changeset patch
# User scott@6e1638ff-ae45-0410-89bd-df963105f760
# Date 1236122842 0
# Node ID af22fa790d13301df92051ec22fc8dc72dd5e4ea
# Parent  71b4e45f47f6c7b32455c3eaccfb042a97b88a6e
...

diff -r 71b4e45f47f6 -r af22fa790d13 talks/AMS-2009.pdf
Binary file talks/AMS-2009.pdf has changed
diff -r 71b4e45f47f6 -r af22fa790d13 text/A-infty.tex
--- a/text/A-infty.tex	Tue Mar 03 23:26:11 2009 +0000
+++ b/text/A-infty.tex	Tue Mar 03 23:27:22 2009 +0000
@@ -106,7 +106,7 @@
 
 
 \subsection{Blob homology}
-The definition of blob homology for $(\cF, \cU)$ a homological system of fields and local relations is essentially the same as that given before in \S \ref{???}.
+The definition of blob homology for $(\cF, \cU)$ a homological system of fields and local relations is essentially the same as that given before in \S \ref{???}, except now there are some extra terms in the differential accounting for the `internal' differential acting on the fields.
 The blob complex $\cB_*^{\cF,\cU}(M)$ is a doubly-graded vector space, with a `blob degree' and an `internal degree'. 
 
 We'll write $\cT$ for the set of finite rooted trees. We'll think of each such a rooted tree as a category, with vertices as objects  and each morphism set either empty or a singleton, with $v \to w$ if $w$ is closer to a root of the tree than $v$. We'll write $\hat{v}$ for the `parent' of a vertex $v$ if $v$ is not a root (that is, $\hat{v}$ is the unique vertex such that $v \to \hat{v}$ but there is no $w$ with $v \to w \to \hat{v}$. If $v$ is a root, we'll write $\hat{v}=\star$. Further, for each tree $t$, let's arbitrarily choose an orientation $\lambda_t$, that is, an alternating $\pm1$-valued function on orderings of the vertices.