Vinylic MIDA Boronates: New Building Blocks for the Synthesis of Aza‐Heterocycles

A two‐step synthesis of structurally diverse pyrrole‐containing bicyclic systems is reported. ortho‐Nitro‐haloarenes coupled with vinylic N‐methyliminodiacetic acid (MIDA) boronates generate ortho‐vinyl‐nitroarenes, which undergo a “metal‐free” nitrene insertion, resulting in a new pyrrole ring. This novel synthetic approach has a wide substrate tolerance and it is applicable in the preparation of more complex “drug‐like” molecules. Interestingly, an ortho‐nitro‐allylarene derivative furnished a cyclic β‐aminophosphonate motif.     

FEM study of palladium and molybdenum clusters on an alumina covered field emitter

Palladium and molybdenum polycrystalline layers (clusters) have been deposited in a stainless steel UHV system onto a layer of alumina (Al₂O₃). This layer has been prepared by high temperature oxidation of an aluminium layer. The interaction of this system with nitrogen has been investigated at room temperature by an FEM technique. Under these conditions nitrogen spillover from molybdenum to palladium has been observed.     

Influence of the sulfonate countercation on the thermal stability of nafion perfluorosulfonate membranes

We report a strong dependence of the thermal stability of Nafion® perfluorosulfonate ionomer on the nature of the counterion associated with the fixed sulfonate site. These results were obtained using thermal gravimetric analysis on a series of alkali metal and alkyl ammonium cation-exchanged Nafion films. We have found that the temperature of decomposition of Nafion is inversely dependent on the size of the exchanged cation; i.e., Nafion films show improved thermal stability as the size of the counter cation decreases. We attribute this inverse relationship of thermal stability with counterion size to an initial decomposition reaction which is strongly influenced by the strength of the sulfonate-coun-terion interaction. © 1993 John Wiley & Sons, Inc.     

Randomized greedy matching

We consider a randomized version of the greedy algorithm for finding a large matching in a graph. We assume that the next edge is always randomly chosen from those remaining. We analyze the performance of this algorithm when the input graph is fixed. We show that there are graphs for which this Randomized Greedy Algorithm (RGA) usually only obtains a matching close in size to that guaranteed by worst-case analysis (i.e., half the size of the maximum). For some classes of sparse graphs (e.g., planar graphs and forests) we show that the RGA performs significantly better than the worst-case. Our main theorem concerns forests. We prove that the ratio to maximum here is at least 0.7690…, and that this bound is tight.     

A finiteness result for Heegaard splittings

In this paper we show that for a given 3-manifold and a given Heegaard splitting there are finitely many preferred decomposing systems of 3g−3 disjoint essential disks. These are characterized by a combinatorial criterion which is a slight strengthening of Casson-Gordon's rectangle condition. This is in contrast to fact that in general there can exist infinitely many such systems of disks which satisfy just the Casson-Gordon rectangle condition.