We show that a certain solution operator for partial derivative in a space of forms square integrable against e(-\z\2) is canonical, i.e.. that it gives the minimal solution when applied to a partial derivative -closed form. and gives zero when applied to a form orthogonal to Ker partial derivative. 

We define sticky graphs and propose their use in the study of self assembly by means of a grammar-like structure modeling the dynamic behaviour of a system.

We briefly present a method for the parameterization of assembly systems derived from their ability to form unique structures. The concept of bond uniqueness is introduced and we show how it influences the number of unique structures that a programmable, or algorithmic, self-assembly system can create. Further, we argue that programmable self-assembly systems create embedded, additional computation that is reflected in the complexity of the generated structures and show how this complexity is related to the bond uniqueness of the building blocks. A brief introduction to sticky graphs, a mathematical tool for modeling self-assembly systems, is given. From the theoretical discussions it becomes clear that building blocks for programmable self-assembly need to have at least four distinct, geometrically separated bonds. A scheme for the production of building blocks with well-directed bonds for programmable self-assembly using DNA-nanoparticles is presented. The introduced procedure is a completely bottom–up approach and can be used to produce quite advanced PSA building blocks like nanoparticle eight-mers with eight bonds. Initial experiments are presented.