Remote stereocontrol by the sulfinyl group: Mukaiyama aldol reactions of (S)-2-[2-(p-tolylsulfinyl)phenyl]acetaldehyde in the asymmetric synthesis of β-hydroxyacids and 1,3-diols

(S)-2-[2-(p-Tolylsulfinyl)phenyl]acetaldehyde reacts with different O-silylated ketenethioacetals in the presence of Yb(OTf)₃ yielding β-hydroxythioesters in high yields and diastereoselectivities. The obtained compounds were readily transformed into β-hydroxyacids and their corresponding diols. These Mukaiyama aldol reactions are a direct evidence of the ability of the sulfinyl group to control 1,5- and 1,6-asymmetric induction processes.     

A novel and efficient synthesis of porphine

meso-Tetra(n-hexyloxycarbonyl)porphyrin was found to be converted into porphine, the mother compound of porphyrins, in a 77% yield when heated in aqueous sulfuric acid at 180 °C over 30 min under an inert atmosphere. The observation demonstrates that the substituted porphyrin serves as a novel and useful precursor for porphine.     

Enantiodiscrimination of racemic electrophiles by diketopiperazine enolates: asymmetric synthesis of methyl 2-amino-3-aryl-butanoates and 3-methyl-aspartates

Enolates of (S)-N,N′-bis-(p-methoxybenzyl)-3-iso-propylpiperazine-2,5-dione exhibit high levels of enantiodiscrimination in alkylations with (RS)-1-aryl-1-bromoethanes and (RS)-2-bromoesters, affording substituted diketopiperazines containing two new stereogenic centres in high de. Deprotection and hydrolysis of the resultant substituted diketopiperazines provides a route to the asymmetric synthesis of homochiral methyl 2-amino-3-aryl-butanoates and 3-methyl-aspartates in high de and ee.     

Inequalities for the Moments and Distribution of the Ladder Height of a Random Walk

We obtain upper bounds for the tail distribution of the first nonnegative sum of a random walk and for the moments of the overshoot over an arbitrary nonnegative level if the expectation of jumps is positive and close to zero. In addition, we find an estimate for the expectation of the first ladder epoch.     

Large set of P3‐decompositions

Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λK_n into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P₃,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008     

Collisional excitation of Na-Rydberg atoms

The scattering of heavy ion with a multilevel Rydberg atom in the presence of an electromagnetic field is studied. The interaction of Rydberg atom and the e.m field is explored using non-perturbative quasi-energy technique. Although the results are presented for selected excitations but in actual calculations we have included many levels of the atom. The effect of various parameters are shown on collisional excitation process. As an illustration detailed calculations are performed for the inelastic proton-Na Rydberg atom collision accompanied by the transfer of photons and the effects of dressing due to the field are considered. The emphasis of the present work is on collision induced transitions especially the case that involves change of orbital as well as principal quantum number. Received 26 December 2001 / Received in final form 8 April 2002 Published online 19 July 2002     

非傍轴平顶高斯光束M2因子两种定义的比较研究

基于功率密度的二阶矩方法,推导出了非傍轴平顶高斯(FG)光束束宽和远场发散角的解析表达式·研究表明,当w0/λ→0时,远场发散角趋于渐近值θmax=63.435°,与阶数无关·使用非傍轴高斯光束代替傍轴高斯光束作为理想光束,研究了非傍轴FG光束的M2因子,并与传统定义的M2因子作了比较·在非傍轴范畴,非傍轴FG光束的M2因子不仅与阶数N有关,而且与w0/λ有关·按照定义,当w0/λ→0时,非傍轴FG光束的M2因子不等于0,对阶数N=1,2,3时,M2因子分别趋于0.913,0.882和0.886·当N→∞时,M2因子取最小值M2min=0.816·     

Rehabilitation of the Gauss-Jordan algorithm

Summary In this paper a Gauss-Jordan algorithm with column interchanges is presented and analysed. We show that, in contrast with Gaussian elimination, the Gauss-Jordan algorithm has essentially differing properties when using column interchanges instead of row interchanges for improving the numerical stability. For solutions obtained by Gauss-Jordan with column interchanges, a more satisfactory bound for the residual norm can be given. The analysis gives theoretical evidence that the algorithm yields numerical solutions as good as those obtained by Gaussian elimination and that, in most practical situations, the residuals are equally small. This is confirmed by numerical experiments. Moreover, timing experiments on a Cyber 205 vector computer show that the algorithm presented has good vectorisation properties.