Artificial boundary conditions for Petrovsky systems of second order in exterior domains and in other domains of conical type

The approximation of solutions to boundary value problems on unbounded domains by those on bounded domains is one of the main applications for artificial boundary conditions. Based on asymptotic analysis, here a new method is presented to construct local artificial boundary conditions for a very general class of elliptic problems where the main asymptotic term is not known explicitly. Existence and uniqueness of approximating solutions are proved together with asymptotically precise error estimates. One class of important examples includes boundary value problems for anisotropic elasticity and piezoelectricity. Copyright © 2004 John Wiley & Sons, Ltd.     

New efficient catalysts for the aerobic oxidation of ethers

Some nickel, copper, and silver salts or complexes are efficient catalysts for the oxidation of benzylic ethers with oxygen in 1,2-dimethoxyethane. Salts of the weakly coordinating anion trifluoroacetate are particularly efficient, approaching (and, in some cases, improving) the yields obtained with cobalt(II) chloride, the best catalyst so far reported.     

Olefin terpolymerizations. II. 4-vinylcyclohexene and cyclooctadiene

4-Vinylcyclohexene (VCH) and cyclooctadiene (COD) were investigated as termonomers in EPDM (ethylene/propylene/diene) synthesis by using rac-ethylenebis (1-η⁵-indenyl) zir-conium dichloride ( 1 ) as a catalyst precursor. Homopolymerizations of VCH, vinylcycloh-exane and cyclohexene were compared. The parameter K_πκ_p, which is the apparent rate constant for Ziegler-Natta polymerization, is about the same for VCH and vinylcyclohexanebut is 10 times smaller for cyclohexene. Therefore, the linear olefinic double bond is more active than the cyclic internal double bond. VCH reduces ethylene polymerization rate but not propylene polymerization rate in copolymerizations. In terpolymerizations, VCH tends to suppress ethylene incorporation especially at elevated polymerization temperature and Lowers the polymer MW by about two-fold. COD has very low activity as a termonomer. © 1995 John Wiley & Sons, Inc.     

Lévy processes and their subordination in matrix Lie groups

Lévy processes in matrix Lie groups are studied. Subordination (random time change) is used to show that quasi-invariance of the Brownian motion in a Lie group induces absolute continuity of the laws of the corresponding pure jump processes. These results are applied to several examples which are discussed in detail.     

Obstruction à la transversalité de lagrangiens

In this Note, we give a necessary and sufficient condition for Lagrangians in a symplectic vector bundle to be deformed stably into transversal Lagrangians. In the case of three Lagrangians, we show that the associated Grothendieck group can be identified with a Hermitian K-theory group. To cite this article: M. Karoubi, M.L. Lapa de Souza, C. R. Acad. Sci. Paris, Ser. I 342 (2006).     

Products of residue currents of Cauchy–Fantappiè–Leray type

With a given holomorphic section of a Hermitian vector bundle, one can associate a residue current by means of Cauchy–Fantappiè–Leray type formulas. In this paper we define products of such residue currents. We prove that, in the case of a complete intersection, the product of the residue currents of a tuple of sections coincides with the residue current of the direct sum of the sections.     

Packing Non-Zero A-Paths In Group-Labelled Graphs

Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group Γ and let A⊂V. An A-path is a path whose ends are both in A. The weight of a path P in G is the sum of the group values on forward oriented arcs minus the sum of the backward oriented arcs in P. (If Γ is not abelian, we sum the labels in their order along the path.) We are interested in the maximum number of vertex-disjoint A-paths each of non-zero weight. When A = V this problem is equivalent to the maximum matching problem. The general case also includes Mader's S-paths problem. We prove that for any positive integer k, either there are k vertex-disjoint A-paths each of non-zero weight, or there is a set of at most 2k −2 vertices that meets each of the non-zero A-paths. This result is obtained as a consequence of an exact min-max theorem. These results were obtained at a workshop on Structural Graph Theory at the PIMS Institute in Vancouver, Canada. This research was partially conducted during the period the first author served as a Clay Mathematics Institute Long-Term Prize Fellow.