Remote Regiocontrol by a Thioether Group in Diels-Alder Reactions of Naphthazarin: Regioselective Access to Tetracyclic Polyhydroxyquinones

The synthesis of tetracyclic polyhydroxyquinones 5a and 5b was achieved through a sequence involving two Diels-Alder reactions with 1-methoxy-1,3-cyclohexadiene: the first with 2-(p-tolylthio)naphthazarin and the second on the resulting tricyclic derivative previously transformed into a (p-tolylsulfinyl)naphthazarin. The success of this strategy stemmed from the efficient remote regiocontrol exerted by the thioether substituent in the first step.     

The algebra of differential operators on the circle and W KP (q)

Radul has recently introduced a map from the Lie algebra of differential operators on the circle of W _n . In this Letter, we extend this map to W _KP ^(q) , a recently introduced one-parameter deformation of W_KP - the second Hamiltonian structure of the KP hierarchy. We use this to give a short proof that W is the algebra of additional symmetries of the KP equation.     

A parallel projection method for overdetermined nonlinear systems of equations

We consider overdetermined nonlinear systems of equationsF(x)=0, whereF: ^{n m} ,mn. For this type of systems we define weighted least square distance (WLSD) solutions, which represent an alternative to classical least squares solutions and to other solutions based on residual normas. We introduce a generalization of the classical method of Cimmino for linear systems and we prove local convergence results. We introduce a practical strategy for improving the global convergence properties of the method. Finally, numerical experiments are presented.Work supported by FAPESP (Grant 90/3724/6), FINEP, CNPq and FAEP-UNICAMP.     

On sparse spanners of weighted graphs

Given a graphG, a subgraphG' is at-spanner ofG if, for everyu,v V, the distance fromu tov inG' is at mostt times longer than the distance inG. In this paper we give a simple algorithm for constructing sparse spanners for arbitrary weighted graphs. We then apply this algorithm to obtain specific results for planar graphs and Euclidean graphs. We discuss the optimality of our results and present several nearly matching lower bounds.The work of G. Das and D. Joseph was supported by NSF PYI Grant DCR-8402375. The work of D. Dobkin was supported by NSF Grant CCR-8700917. The work of J. Soares was supported by CNPq proc 203039/87.4 (Brazil) and NSF Grant CCR-9014562. This research was accomplished while G. Das was a student at the University of Wisconsin-Madison. A preliminary version was presented at the Second Scandinavian Workshop on Algorithm Theory, Bergen, Norway, 1990, under the title Generating Sparse Spanners for Weighted Graphs, and proceedings appear in the series Lecture Notes in Computer Science, Springer-Verlag. The preliminary version also appears as Princeton University Technical Report CS-TR-261-90, and as University of Wisconsin-Madison Computer Sciences Technical Report 882.