Application of N,N‐bis(diphenylphosphino)aniline palladium(II) complexes as pre‐catalysts in Heck coupling reactions

Palladium(II) complexes with N,N‐bis(diphenylphosphino)aniline ligands catalyse the Heck reaction between styrene and aryl bromides, affording stilbenes in good yield. The structures of two of the complexes used as pre‐catalysts have been determined by single‐crystal X‐ray diffraction. Copyright © 2007 John Wiley & Sons, Ltd.     

On dimensional rigidity of bar-and-joint frameworks

Let V={1,2,…,n}. A mapping p:V→R^r, where p¹,…,pⁿ are not contained in a proper hyper-plane is called an r-configuration. Let G=(V,E) be a simple connected graph on n vertices. Then an r-configuration p together with graph G, where adjacent vertices of G are constrained to stay the same distance apart, is called a bar-and-joint framework (or a framework) in R^r, and is denoted by G(p). In this paper we introduce the notion of dimensional rigidity of frameworks, and we study the problem of determining whether or not a given G(p) is dimensionally rigid. A given framework G(p) in R^r is said to be dimensionally rigid iff there does not exist a framework G(q) in R^s for s?r+1, such that ∥qⁱ-q^j∥²=∥pⁱ-p^j∥² for all (i,j)∈E. We present necessary and sufficient conditions for G(p) to be dimensionally rigid, and we formulate the problem of checking the validity of these conditions as a semidefinite programming (SDP) problem. The case where the points p¹,…,pⁿ of the given r-configuration are in general position, is also investigated.     

Lifetime study of high-spin states in 104,105In

In the neutron deficient isotopes _104,105In lifetimes of high spin states in the range from 0.5 ps to 600 ps have been measured in a coincidence recoil distance Doppler shift (RDDS) experiment. By combining the Doppler shift attenuation (DSA) and RDDS methods at few μm flight distances, the problem of delayed feeding has been avoided and very short lifetimes in the range 0.5–0.8 ps have been determined. Shell model calculations with strong restrictions for the neutron orbitals reveal good agreement with experimental level energies and still fair agreement for most measured B(M1) and B(E2) values. Received: 30 June 1998     

Exact solutions to linear programming problems

The use of floating-point calculations limits the accuracy of solutions obtained by standard LP software. We present a simplex-based algorithm that returns exact rational solutions, taking advantage of the speed of floating-point calculations and attempting to minimize the operations performed in rational arithmetic. Extensive computational results are presented.     

Fire containment in grids of dimension three and higher

We consider a deterministic discrete-time model of fire spread introduced by Hartnell [Firefighter! an application of domination, Presentation, in: 20th Conference on Numerical Mathematics and Computing, University of Manitoba in Winnipeg, Canada, September 1995] and the problem of minimizing the number of burnt vertices when a fixed number of vertices can be defended by firefighters per time step. While only two firefighters per time step are needed in the two-dimensional lattice to contain any outbreak, we prove a conjecture of Wang and Moeller [Fire control on graphs, J. Combin. Math. Combin. Comput. 41 (2002) 19-34] that 2d-1 firefighters per time step are needed to contain a fire outbreak starting at a single vertex in the d-dimensional square lattice for d?3; we also prove that in the d-dimensional lattice, d?3, for each positive integer f there is some outbreak of fire such that f firefighters per time step are insufficient to contain the outbreak. We prove another conjecture of Wang and Moeller that the proportion of elements in the three-dimensional grid P_n×P_n×P_n which can be saved with one firefighter per time step when an outbreak starts at one vertex goes to 0 as n gets large. Finally, we use integer programming to prove results about the minimum number of time steps needed and minimum number of burnt vertices when containing a fire outbreak in the two-dimensional square lattice with two firefighters per time step.     

Some geometrical aspects of semidefinite linear complementarity problems

This article studies some geometrical aspects of the semidefinite linear complementarity problem (SDLCP), which can be viewed as a generalization of the well-known linear complementarity problem (LCP). SDLCP is a special case of a complementarity problem over a closed convex cone, where the cone considered is the closed convex cone of positive semidefinite matrices. It arises naturally in the unified formulation of a pair of primal-dual semidefinite programming problems. In this article, we introduce the notion of complementary cones in the semidefinite setting using the faces of the cone of positive semidefinite matrices and show that unlike complementary cones induced by an LCP, semidefinite complementary cones need not be closed. However, under R₀-property of the linear transformation, closedness of all the semidefinite complementary cones induced by L is ensured. We also introduce the notion of a principal subtransformation with respect to a face of the cone of positive semidefinite matrices and show that for a self-adjoint linear transformation, strict copositivity is equivalent to strict semimonotonicity of each principal subtransformation. Besides the above, various other solution properties of SDLCP will be interpreted and studied geometrically.     

Imidazol(in)ium carboxylates as N-heterocyclic carbene ligand precursors for Suzuki-Miyaura reactions

Simple catalysts formed in situ from palladium acetate and a variety of imidazolium and imidazolinium carboxylates and dithiocarboxylates have been screened in the coupling of aryl halides with trans-2-phenylvinylboronic acid. Imidazol(in)ium carboxylates show an excellent activity, which compares to that displayed by the parent imidazol(in)ium chlorides, whereas imidazol(in)ium dithiocarboxylates are poorly efficient. Interestingly, the base employed exerts a profound influence on the trans/cis stereochemistry of the coupling product.