Highly efficient synthesis of the tricyclic core of Taxol by cascade metathesis

An efficient enantioselective synthesis of the ABC tricyclic core of the anticancer drug Taxol is reported. The key step of this synthesis is a cascade metathesis reaction, which leads in one operation to the required tricycle if appropriate fine-tuning of the dienyne precursor is performed

Compositional uniformity, domain patterning and the mechanism underlying nano-chessboard arrays

We propose that systems exhibiting compositional patterning at the nanoscale, so far assumed to be due to some kind of ordered phase segregation, can be understood instead in terms of coherent, single phase ordering of minority motifs, caused by some constrained drive for uniformity. The essential features of this type of arrangements can be reproduced using a superspace construction typical of uniformity-driven orderings, which only requires the knowledge of the modulation vectors observed in the diffraction patterns. The idea is discussed in terms of a simple two dimensional lattice-gas model that simulates a binary system in which the dilution of the minority component is favored. This simple model already exhibits a hierarchy of arrangements similar to the experimentally observed nano-chessboard and nano-diamond patterns, which are described as occupational modulated structures with two independent modulation wave vectors and simple step-like occupation modulation functions.Comment: Preprint. 11 pages, 11 figure

The Minimal Length of a Lagrangian Cobordism between Legendrians

To investigate the rigidity and flexibility of Lagrangian cobordisms between Legendrian submanifolds, we investigate the minimal length of such a cobordism, which is a $1$-dimensional measurement of the non-cylindrical portion of the cobordism. Our primary tool is a set of real-valued capacities for a Legendrian submanifold, which are derived from a filtered version of Legendrian Contact Homology. Relationships between capacities of Legendrians at the ends of a Lagrangian cobordism yield lower bounds on the length of the cobordism. We apply the capacities to Lagrangian cobordisms realizing vertical dilations (which may be arbitrarily short) and contractions (whose lengths are bounded below). We also study the interaction between length and the linking of multiple cobordisms as well as the lengths of cobordisms derived from non-trivial loops of Legendrian isotopies.Comment: 33 pages, 9 figures. v2: Minor corrections in response to referee comments. More general statement in Proposition 3.3 and some reorganization at the end of Section

Processing oblique aerial photographs in Flanders: the Havik Project at the Ghent University. A contribution to archaeological resource management

A contribution to archaeological resource management. Ghent University has organised an archaeological aerial survey of both provinces of East- and West-Flanders since the beginning of the 1980s. As a result of these activities, some 50,000 photographs have been captured. They reveal thousands of archaeological structures, from the Neolithic through to the most recent periods. Since 1997, financial support has been received from the Flemish Community aimed at the realisation of a GIS based database (Access 97 relational database - Arcview 3.1) and the digitalisation of some 50% of the photographs. As a result, it was possible to locate all 50,000 images and connect them with geographical information offered by the support centre GIS Flanders. It is expected in the near future that this information will be available for SMR-purposes and archaeological heritage management. There are also several scientific outputs: one of them is the study of Bronze Age barrows

Exact Algorithms for Maximum Independent Set

We show that the maximum independent set problem (MIS) on an $n$-vertex graph can be solved in $1.1996^nn^{O(1)}$ time and polynomial space, which even is faster than Robson's $1.2109^{n}n^{O(1)}$-time exponential-space algorithm published in 1986. We also obtain improved algorithms for MIS in graphs with maximum degree 6 and 7, which run in time of $1.1893^nn^{O(1)}$ and $1.1970^nn^{O(1)}$, respectively. Our algorithms are obtained by using fast algorithms for MIS in low-degree graphs in a hierarchical way and making a careful analyses on the structure of bounded-degree graphs

An exact sequence for contact- and symplectic homology

A symplectic manifold $W$ with contact type boundary $M = \partial W$ induces a linearization of the contact homology of $M$ with corresponding linearized contact homology $HC(M)$. We establish a Gysin-type exact sequence in which the symplectic homology $SH(W)$ of $W$ maps to $HC(M)$, which in turn maps to $HC(M)$, by a map of degree -2, which then maps to $SH(W)$. Furthermore, we give a description of the degree -2 map in terms of rational holomorphic curves with constrained asymptotic markers, in the symplectization of $M$.Comment: Final version. Changes for v2: Proof of main theorem supplemented with detailed discussion of continuation maps. Description of degree -2 map rewritten with emphasis on asymptotic markers. Sec. 5.2 rewritten with emphasis on 0-dim. moduli spaces. Transversality discussion reorganized for clarity (now Remark 9). Various other minor modification