Synthesis of Highly Substituted γ‐Butyrolactones by a Gold‐Catalyzed Cascade Reaction of Benzyl Esters

Easily accessible benzylic esters of 3‐butynoic acids in a gold‐catalyzed cyclization/rearrangement cascade reaction provided 3‐propargyl γ‐butyrolactones with the alkene and the carbonyl group not being conjugated. Crossover experiments showed that the formation of the new C?C bond is an intermolecular process. Initially propargylic–benzylic esters were used, but alkyl‐substituted benzylic esters worked equally well. In the case of the propargylic–benzylic products, a simple treatment of the products with aluminum oxide initiated a twofold tautomerization to the allenyl‐substituted γ‐butyrolactones with conjugation of the carbonyl group, the olefin, and the allene. The synthetic sequence can be conducted stepwise or as a one‐pot cascade reaction with similar yields. Even in the presence of the gold catalyst the new allene remains intact.     

Iodine(III)‐Catalyzed Rearrangements of Imides: A Versatile Route to α,α‐Dialkylated α‐Hydroxy Carboxylamides

A tertiary hydroxy group α to a carboxyl moiety comprises a key structural motif in many bioactive substances. With the herein presented metal‐free rearrangement of imides triggered by hypervalent λ³‐iodane, an easy and selective way to gain access to such a compound class, namely α,α‐disubstituted‐α‐hydroxy carboxylamides, was established. Their additional methylene bromide side chain constitutes a useful handle for rapid diversification, as demonstrated by a series of further functionalizations. Moreover, the in situ formation of an iodine(III) species under the reaction conditions was proven. Our findings clearly corroborate that hypervalent λ³‐benziodoxolones are involved in these organocatalytic reactions.     

Condensation of all-cis-tetraphenylcyclotetrasiloxanetetraol in ammonia: new method for preparation of ladder-like polyphenylsilsesquioxanes

1. Download : Download high-res image (68KB)
2. Download : Download full-size image

     

The mechanism of ethylene polymerization by nickel salicylaldiminato catalysts - Agostic interactions and their kinetic isotope effects

The ethylene polymerization reaction of a neutral nickel catalyst was studied by DFT calculations at the Becke3LYP/6-31G(d) level of theory. As in related cases a β-agostic bond stabilizes the nickel alkyl ground states. Transition states for the insertion of the olefin show a distinct α-agostic interaction, which has not been observed for late metal polymerization catalysts before. An ethylene-alkyl complex was identified as the resting state of the reaction. The overall barrier height of the reaction amounts to 17.54 kcal/mol, which slightly increases to 17.60 kcal/mol for the polymerization of deuterated ethylene. Therefore, a small positive kinetic isotope effect (k_H/k_D = 1.09) can be calculated, which is caused by the α-agostic interaction in the transition state. A comparison to other late metal based polymerization systems reveals that the ethylene coordination step of highly active catalysts is significantly lower in energy compared to catalysts which are only moderately active.     

Microlocal Analysis of an FBP Algorithm for Truncated Spiral Cone Beam Data

In this article we propose an FBP-type algorithm for inversion of spiral cone beam data, study its theoretical properties, and illustrate performance of the algorithm by numerical examples. In particular, it is shown that the algorithm does not reconstruct f exactly, but computes the result of applying a pseudo-differential operator (PDO) with singular symbol to f. Away from critical directions the amplitude of this PDO is homogeneous of order zero in the dual variable, bounded, and approaches one as the pitch of the spiral goes to zero. Numerical experiments presented in the article show that even when the pitch is relatively large, the accuracy of reconstruction is quite high. On the other hand, under certain circumstances, the algorithm produces artifacts typical of all FBP-type algorithms.     

When random proportional subspaces are also random quotients

We discuss when a generic subspace of some fixed proportional dimension of a finite-dimensional normed space can be isomorphic to a generic quotient of some proportional dimension of another space. We show (in Theorem 4.1) that if this happens (for some natural random structures) then for any proportion arbitrarily close to 1, the first space has a lot of Euclidean subspaces and the second space has a lot of Euclidean quotients.     

The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study

The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 2¹⁶⁹⁴ scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time.