Regioselective 1,4-trifluoromethylation of α,β-enones using ‘protect-in-situ’ methodology

In a convenient and efficient procedure, the nucleophilic 1,4-trifluoromethylation of several α,β-enones using (trifluoromethyl)trimethylsilane was achieved. The high regioselectivity of the reaction has been reached by blocking the carbonyl moiety of the electrophile with a bulky aluminum-centered Lewis acid.     

Relativistic quantum defect calculations on the copper isoelectronic sequence

The quantum defect orbital (QDO ) method and its relativistic (RQDO ) counterpart have been employed in this work to compute oscillator strengths for several fine-structure transitions in members of the copper isoelectronic sequence up to Z = 92. The RQDO results are found to be in quite good agreement with the best estimates derived from other sources, whenever the comparison is possible. © 1994 John Wiley & Sons, Inc.     

Prospects for new physics observations in diffractive processes at the LHC and Tevatron

We study the double-diffractive production of various heavy systems (e.g. Higgs, dijet, and SUSY particles) at LHC and Tevatron collider energies. In each case we compute the probability that the rapidity gaps, which occur on either side of the produced system, survive the effects of soft rescattering and QCD bremsstrahlung effects. We calculate both the luminosity for different production mechanisms, and a wide variety of subprocess cross sections. The results allow numerical predictions to be readily made for the cross sections of all these processes at the LHC and the Tevatron collider. For example, we predict that the cross section for the exclusive double-diffractive production of a 120 GeV Higgs boson at the LHC is about 3 fb, and that the QCD background in the decay mode is about 4 times smaller than the Higgs signal if the experimental missing-mass resolution is 1 GeV. For completeness we also discuss production via or WW fusion. Received: 7 November 2001 / Revised version: 11 December 2001 / Published online: 25 January 2002     

The Potts model representation and a Robinson–Schensted correspondence for the partition algebra

We construct a correspondence between the set of partitions of a finite set M and the set of pairs of walks to the same vertex on a graph giving the Bratteli diagram of the partition algebra on M. This is the precise analogue of the correspondence between the set of permutations of a finite set and the set of pairs of Young tableaux of the same shape, called the Robinson–Schensted correspondence.     

Spline prewavelets for non-uniform knots

Summary In this paper, we develop a framework suitable for performing a multiresolution analysis using univariate spline spaces of arbitrary degree and with non-uniform knot-sequences. To this end, we show, among other things, the existence of compactly supported prewavelets and of prewavelets that are globally supported, but decay exponentially. In each case we obtain a decomposition of a fine spline space as a sum of a coarse spline space plus a spline space spanned by prewavelets.     

Spline collocation for strongly elliptic equations on the torus

Summary We prove convergence and error estimates in Sobolev spaces for the collocation method with tensor product splines for strongly elliptic pseudodifferential equations on the torus. Examples of applications include elliptic partial differential equations with periodic boundary conditions but also the classical boundary integral operators of potential theory on torus-shaped domains in three or more dimensions. For odd-degree splines, we prove convergence of nodal collocation for any strongly elliptic operator. For even-degree splines and midpoint collocation, we find an additional condition for the convergence which is satisfied for the classical boundary integral operators. Our analysis is a generalization to higher dimensions of the corresponding analysis of Arnold and Wendland [4].     

A generic view of Dantzig-Wolfe decomposition in mixed integer programming

The Dantzig-Wolfe reformulation principle is presented based on the concept of generating sets. The use of generating sets allows for an easy extension to mixed integer programming. Moreover, it provides a unifying framework for viewing various column generation practices, such as relaxing or tightening the column generation subproblem and introducing stabilization techniques.