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.     

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.     

A primer on perfect simulation for spatial point processes

This primer provides a self-contained exposition of the case where spatial birth-and-death processes are used for perfect simulation of locally stable point processes. Particularly, a simple dominating coupling from the past (CFTP) algorithm and the CFTP algorithms introduced in [13], [14], and [5] are studied. Some empirical results for the algorithms are discussed. Received: 30 June 2002     

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.     

Nielsen realization for 3-manifolds containing two-sided projective planes

For compact irreducible sufficiently large 3-manifolds containing 2-sided projective planes, we consider the following Realization Problem: Given a finite subgroup of the outer automorphism group of the fundamental group, is there a finite group of homeomorphisms, which induces this subgroup? Received: 16 November 1999; in final form: 18 January 2001 / Published online: 8 November 2002     

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     

Rank-perfect and" weakly rank-perfect graphs

An edge e of a perfect graph G is critical if G−e is imperfect. We would like to decide whether G−e is still “almost perfect” or already “very imperfect”. Via relaxations of the stable set polytope of a graph, we define two superclasses of perfect graphs: rank-perfect and weakly rank-perfect graphs. Membership in those two classes indicates how far an imperfect graph is away from being perfect. We study the cases, when a critical edge is removed from the line graph of a bipartite graph or from the complement of such a graph.