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.     

Wavelength and power monitoring of DWDM systems using scanning F–P filter calibrated with a F–P laser

A novel technique to overcome the long-term drift and hysteresis of a scanning Fabry–Perot filter was developed and applied to wavelength and power monitoring of DWDM system. By using the comb peaks generated by a temperature-stabilized, near threshold-biased Fabry–Perot diode laser as wavelength reference for the scanning Fabry–Perot filter, wavelength and power measurement accuracy of better than ±10 pm and 0.2 dB, respectively, were achieved.     

Primal cutting plane algorithms revisited

Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost non-existent.  In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general mixed-integer programs are also discussed.     

Generalized Longo–Rehren Subfactors and α-Induction

We study the recent construction of subfactors by Rehren which generalizes the Longo–Rehren subfactors. We prove that if we apply this construction to a non-degenerately braided subfactor N⊂M and α^±-induction, then the resulting subfactor is dual to the Longo–Rehren subfactor M⊗M ^opp⊂R arising from the entire system of irreducible endomorphisms of M resulting from α^plusmn;-induction. As a corollary, we solve a problem on existence of braiding raised by Rehren negatively. Furthermore, we generalize our previous study with Longo and Müger on multi-interval subfactors arising from a completely rational conformal net of factors on S ¹ to a net of subfactors and show that the (generalized) Longo–Rehren subfactors and α-induction naturally appear in this context. Received: 11 September 2001 / Accepted: 7 October 2001     

Complete ideals and singularities of space curves

We consider complete ideals supported on finite sequences of infinitely near points, in regular local rings with dimensions greater than two. We study properties of factorizations in Lipman special *-simple complete ideals. We relate it to a type of proximity, linear proximity, of the points, and give conditions in order to have unique factorization. Several examples are presented. Received: 2 February 2000 / in final form: 14 March 2001 / Published online: 18 January 2002     

Locally Periodic Versus Globally Periodic Infinite Words

We call a one-way infinite word w over a finite alphabet (ρ,l)-repetitive if all long enough prefixes of w contain as a suffix a ρth power (or more generally a repetition of order ρ) of a word of length at most l. We show that each (2,4)-repetitive word is ultimately periodic, as well as that there exist continuum many, and hence also nonultimately periodic, (2,5)-repetitive words. Further, we characterize nonultimately periodic (2,5)-repetitive words both structurally and algebraically.