Theoretical estimates for proton-NMR spin–lattice relaxation rates of heterometallic spin rings

Heterometallic molecular chromium wheels are fascinating new magnetic materials. We reexamine the available experimental susceptibility data on MCr₇ wheels in terms of a simple isotropic Heisenberg Hamiltonian for M=Fe, Ni, Cu, and Zn and find in that FeCr₇ needs to be described with an iron–chromium exchange that is different from all other cases. In a second step we model the behavior of the proton spin lattice relaxation rate as a function of applied magnetic field for low temperatures as it is measured in nuclear magnetic resonance (NMR) experiments. It appears that CuCr₇ and NiCr₇ show an unexpectedly reduced relaxation rate at certain level crossings.     

Photopolymers for Rapid Prototyping of Soluble Mold Materials and Molding of Cellular Biomaterials

To substitute cross-linked photopolymers in rapid prototyping of mold materials and therefore extend the range of materials which can be casted, organo-soluble photopolymers were developed. Branched bisalkylacrylamides were suitable as base component for such formulations, due to their high reactivity, good mechanical properties, and excellent solubility of the formed polymers. These molding materials were used to prepare cellular biocompatible materials which could be used as bone replacement materials. Biocompatible crosslinkers based on methacrylates from hydrolyzed gelatine or lactic acid ethyleneglycol blockcopolymers and commercially available reactive diluents are the base components of such a formulation. Biocompatibility was investigated by osteoblast-like cells. Cellular biocompatible parts were obtained by thermal polymerization in soluble mould materials prepared by 3D-photoshaping.     

Coloring mixed hypertrees

A mixed hypergraph is a triple (V,C,D) where V is its vertex set and C and D are families of subsets of V, called C-edges and D-edges, respectively. For a proper coloring, we require that each C-edge contains two vertices with the same color and each D-edge contains two vertices with different colors. The feasible set of a mixed hypergraph is the set of all k's for which there exists a proper coloring using exactly k colors. A hypergraph is a hypertree if there exists a tree such that the edges of the hypergraph induce connected subgraphs of the tree.We prove that feasible sets of mixed hypertrees are gap-free, i.e., intervals of integers, and we show that this is not true for precolored mixed hypertrees. The problem to decide whether a mixed hypertree can be colored by k colors is NP-complete in general; we investigate complexity of various restrictions of this problem and we characterize their complexity in most of the cases.