Stability of vertices in random boolean cellular automata

Based on computer simulations, Kauffman (Physica D, 10, 145-156, 1984) made several generalizations about a random Boolean cellular automaton which he invented as a model of cellular metabolism. Here we give the first rigorous proofs of two of Kauffman's generalizations: a large fraction of vertices stabilize quickly, consequently the length of cycles in the automaton's behavior is small compared to that of a random mapping with the same number of states; and reversal of the states of a large fraction of the vertices does not affect the cycle to which the automaton moves.     

An expedient route to diaza-spirocycles utilizing a sequential multicomponent α-aminoallylation/ring-closing metathesis strategy

A general method for the preparation of diaza-spirocycles is reported. This method used an olefin metathesis in order to construct the desired spirocyclic framework. Beginning with commercially available protected amino ketones, this strategy ultimately produced pharmacologically relevant diaza-scaffolds in an efficient and high-yielding process.     

Zur Trennung des Eisens von Nickel und Kobalt

Ohne Zusammenfassung     

The synthesis of 6-trifluoroethyl-l-lysine: a method to introduce functionality at C-6 of l-lysine

Described is a method of introducing trifluoroalkyl groups at C-6 of lysine. This chemistry has the potential to introduce a variety of functionality at C-6 of lysine.     

Laguerre approximation of stable manifolds with application to connecting orbits

We present an algorithm, based on approximation by Laguerre polynomials, for computing a point on the stable manifold of a stationary solution of an autonomous system. A superconvergence phenomenon means that the accuracy of our results is much higher than the usual spectral accuracy. Both the theory and the implementation of the method are considered. Finally, as an application of the algorithm, we describe a fully spectral approximation of homo- and heteroclinic orbits.

     

Asymptotic packing via a branching process

It is shown that under certain side conditions the natural random greedy algorithm almost always provides an asymptotically optimal packing of disjoint hyperedges from a hypergraph H.     

How many black holes fit on the head of a pin?

The Bekenstein–Hawking entropy of certain black holes can be computed microscopically in string theory by mapping the elusive problem of counting microstates of a strongly gravitating black hole to the tractable problem of counting microstates of a weakly coupled D-brane system, which has no event horizon, and indeed comfortably fits on the head of a pin. We show here that, contrary to widely held beliefs, the entropy of spherically symmetric black holes can easily be dwarfed by that of stationary multi-black-hole “molecules” of the same total charge and energy. Thus, the corresponding pin-sized D-brane systems do not even approximately count the microstates of a single black hole, but rather those of a zoo of entropically dominant multicentered configurations. Fourth Award in the 2007 Essay Competition of the Gravity Research Foundation.