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.     

Stationary turbulent closure via the Hopf functional equation

Exact closed-form solutions are exhibited for the Hopf equation for stationary incompressible 3D Navier-Stokes flow, for the cases of homogeneous forced flow (including a solution with depleted nonlinearity) and inhomogeneous flow with arbitrary boundary conditions. This provides an exact method for computing two- and higher-point moments, given the mean flow.     

The push-out region of an immersed manifold

We consider immersions: and construct a subspace of which corresponds to a set of embedded manifolds which are either parallel to f, tubes around f or, in general, partial tubes around f. This space is invariant under the action of the normal holonomy group, We investigate the case where is non-trivial and obtain some results on the number of connected components of . Received 24 March 2000.     

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.     

Conformational analysis of dipeptide‐derived polyisocyanides

The conformational properties of polymers derived from isocyanodipeptides have been investigated with a combination of model calculations, X‐ray diffraction, and circular dichroism spectroscopy. Depending on the configuration of the side chains, defined arrays of hydrogen bonds along the polymeric backbone are formed. This leads to a well‐defined conformation as, for example, expressed in the formation of lyotropic liquid‐crystalline phases and increased helical stability. Upon the disruption of the hydrogen bonds by a strong acid, a less well‐defined macromolecular conformation is observed. © 2003 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 41: 1725–1736, 2003     

Ultrasonic spectroscopic evaluation of the ring‐opening metathesis polymerization of dicyclopentadiene

An in situ ultrasonic spectroscopy technique was used to study the ring‐opening metathesis polymerization of dicyclopentadiene catalyzed by bis(tricyclohexylphosphine)benzylidene ruthenium dichloride. A reaction cell employing a flexible poly(ethylene terephthalate) window for pulse echo ultrasonic spectroscopy was used to monitor the polymerization. The changes in the density, wave speed, acoustic modulus, and attenuation were all simultaneously monitored. In comparison with Fourier transform infrared (FTIR) spectroscopy data, the changes in the density, velocity, and modulus only accurately measured the rate constant for the metathesis of the cyclopentyl unsaturation. The ultrasonic values were within 6% of the values determined by FTIR. The activation energy for metathesis of the cyclopentyl unsaturation was 84 kJ mol^?1, following first‐order kinetics. Rate constants for the polymerization of the norbornyl unsaturation could not be determined by ultrasound. The gel point, vitrification, and qualitative information about the reaction rate could be determined from the change in the attenuation. © 2003 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 41: 1323–1333, 2003     

Computing Zeta Functions of Kummer Curves via Multiplicative Characters

We present a practical polynomial-time algorithm for computing the zeta function of a Kummer curve over a finite field of small characteristic. Such algorithms have recently been obtained using a method of Kedlaya based upon Monsky–Washnitzer cohomology, and are of interest in cryptography. We take a different approach. The problem is reduced to that of computing the L-function of a multiplicative character sum. This latter task is achieved via a cohomological formula based upon the work of Dwork and Reich. We show, however, that our method and that of Kedlaya are very closely related.Dedicated to the memory of Gian-Carlo Rota