Critical percolation exploration path and SLE 6: a proof of convergence

It was argued by Schramm and Smirnov that the critical site percolation exploration path on the triangular lattice converges in distribution to the trace of chordal SLE ₆. We provide here a detailed proof, which relies on Smirnov’s theorem that crossing probabilities have a conformally invariant scaling limit (given by Cardy’s formula). The version of convergence to SLE ₆ that we prove suffices for the Smirnov–Werner derivation of certain critical percolation crossing exponents and for our analysis of the critical percolation full scaling limit as a process of continuum nonsimple loops. Research of Charles M.Newman was partially supported by the US NSF under grants DMS-01-04278 and DMS-06-06696.     

General Aspects and Optimization of Enantioselective Biocatalysis in Organic Solvents: The Use of Lipases [New Synthetic Methods (76)]

Enantioselective biocatalysis in nonaqueous media is becoming increasingly important in preparative synthetic chemistry. This article discusses (1) the general catalytic properties of enzymes in nonaqueous environments, (2) the basic principles that govern lipase-catalyzed enantioselective esterification and transesterification reactions in organic media for the preparation of optically active acids and alcohols, (3) the determination of kinetic and thermodynamic parameters, and (4) the quantitative analysis of published data.     

A demand-driven method for scheduling optimal smooth production levels

This paper is concerned with demand-driven production scheduling in a commercial environment where smoothed production plans generation over a rolling horizon is desirable as new observations of demand are received through time. Demands are assumed to be normally distributed and dependent on the previous observed levels. The method of chance constraint of Charnes and Cooper is extended to multi-product production planning with variable workforce, back-ordered inventory, and nonstationary stochastic demand process. Bayesian procedures for revising the chance constraints and several variants of linear-programming-based production planning models are presented. In all cases the proposed methodology ensures that demands are satisfied, at a given level of confidence, while achieving smooth production.     

Autour du théorème de Ferrand–Obata (Concerning the Theorem of Ferrand–Obata)

The aim of this article is to give a new dynamical proof of the Ferrand–Obata theorem when the manifold is compact. This will give us a generalisation of this theorem to transversally conformal foliations ofcodimension greater than three and constant basic functions.     

On the Erlang Loss Model with Time Dependent Input

We consider the M(t)/M(t)/m/m queue, where the arrival rate λ(t) and service rate μ(t) are arbitrary (smooth) functions of time. Letting p_n(t) be the probability that n servers are occupied at time t (0≤ n≤ m, t > 0), we study this distribution asymptotically, for m→∞ with a comparably large arrival rate λ(t) = O(m) (with μ(t) = O(1)). We use singular perturbation techniques to solve the forward equation for p_n(t) asymptotically. Particular attention is paid to computing the mean number of occupied servers and the blocking probability p_m(t). The analysis involves several different space-time ranges, as well as different initial conditions (we assume that at t = 0 exactly n₀ servers are occupied, 0≤ n₀≤ m). Numerical studies back up the asymptotic analysis. AMS subject classification: 60K25,34E10 Supported in part by NSF grants DMS-99-71656 and DMS-02-02815     

Reactivity of γ-chloro-gem-trichloroalkanes with chromous chloride

CrCl₂-mediated condensation of γ-chloro-gem-trichloroalkanes with aldehyde generates homoallylic alcohols through a hydride rearrangement followed by a Nozaki-Hiyama allylation.     

Concentration for self‐bounding functions and an inequality of Talagrand

We see that the entropy method yields strong concentration results for general self‐bounding functions of independent random variables. These give an improvement of a concentration result of Talagrand much used in discrete mathematics. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2006     

Unstable minimal surfaces and Heegaard splittings

Partially supported by NSF grant DMS-8701746