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.     

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.     

Paradigms and Paradoxes: Energetics of Aqueous Oxyanions of Nonmetals and Metalloids

The enthalpies of formation of simple nonmetal or metalloid oxyanions in aqueous solution are discussed. Archival values are cited and estimates are made. Trends prove evasive.