Operator stable laws: Series representations and domains of normal attraction

LetX,X ₁,X ₂,... be i.i.d. random vectors in ^d. The limit laws that can arise by suitable affine normalizations of the partial sums,S _n=X ₁+...+X _n, are calledoperator-stable laws. These laws are a natural extension to ^d of the stable laws on. Thegeneralized domain of attraction of [GDOA()] is comprised of all random vectorsX whose partial sums can be affinely normalized to converge to . If the linear part of the affine transformation is restricted to take the formn ^–B for some exponent operatorB naturally associated to thenX is in thegeneralized domain of normal attraction of [GDONA()]. This paper extends the theory of operator-stable laws and their domains of attraction and normal attraction.     

用稳定自由基聚合及光引发聚合制备嵌段共聚物

介绍了稳定自由基聚合的反应原理、引发剂设计，以及用稳定自由基聚合制备嵌段共聚物的几种方法：连续加料法、双官能团引发剂法和一步法。对于光引发聚合的原理及硫自由基的稳定性对聚合反应的影响也进行了讨论。     

Synthesis of stable azomethine ylides by the rearrangement of 1,3-dipolar cycloadducts of 3,4-dihydroisoquinoline-2-oxides with DMAD

1-Aryl-6,7-dimethoxy-1,2,3,4-tetrahydroisoquinolines were prepared according to a one-pot procedure involving the reaction of 2-(3,4-dimethoxyphenyl)-ethylamine with aromatic aldehydes in TFA at reflux. The tetrahydroisoquinolines were treated with H₂O₂-WO₄²⁻ in methanol at room temperature to give the corresponding 3,4-dihydroisoquinoline-2-oxides. Treatment of these cyclic nitrones with DMAD in toluene at room temperature gave the corresponding isoxazolo[3,2-a]isoquinolines. These compounds were heated in toluene at reflux to give the corresponding ylides in high yields (Method A). The effect of the substituents on the rate of the rearrangement of such compounds prompted us to discuss a new mechanism involving consecutive C-C bond heterolysis and 1,3-sigmatropic shift. A one-pot reaction involving the treatment of the nitrones with equimolar amounts of DMAD in refluxing toluene also gave the ylides (Method B). The structures of the prepared compounds were elucidated by spectral means and elemental analyses.     

高效液相色谱分离与质谱稳定同位素稀释法联合测定地质样品中钐及钕

本文报道了用高效液相色谱分离,制取高纯度的Sm及Nd。再与质谱稳定同位素稀释法联合测定几种岩石矿物中的Sm与Nd。     

一类自伴随Lubrication方程的对称,守恒律,拉格朗日函数和精确解

本文借助李对称分析研究了一类自伴随的Lubrication方程,此类方程可用来描述液体薄膜动力学行为.基于非奇异的局域守恒律乘子和李对称方法,我们系统地推导出了此类方程的局域守恒律,非局域相关系统,李对称和一些有趣的精确解.此模型的非局域相关系统在本文中被首次研究,可用于寻找原方程更丰富的解空间.此外,基于局域守恒律和变分原则,我们推导出原方程的四类拉格朗日函数.     

Gorenstein AC亏范畴*

作者定义了Gorenstein AC导出范畴 D^b_gac(R)并且和导出范畴作了一些比较.作者定义了Gorenstein AC奇点范畴 D^b_gacsg(R),在这个范畴中具有有限Gorenstein AC- 投射维数的模都是零对象.同时, 作者给出了由Gorenstein AC- 投射模构成的稳定范畴到奇点范畴的三角嵌入 F : GAC → D^b_sg(R) .通过作函子 F 的商引入Gorenstein AC亏范畴 D^b_gacd(R),并且给出三角等价 D^b_gacd(R) = D^b_gacsg(R)     

Necessary conditions for characterization of laws via mixed sums

SupposeX andY are independent and identically distributed, and independent ofU which satisfies 0U1. Recent work has centered on finding the lawsL(X) for whichX U(X+Y) where denotes equality in law. We show that this equation corresponds to a certain projective invariance property under random rotations. Implicitly or explicitly, it has been assumed that the characteristic function ofX has an expansion property near the origin. We show that solutions may be admitted in the absence of this condition when –logU has a lattice law. A continuous version of the basic problem replaces sums with a Lévy process. Instead we consider self-similar processes, showing that a solution exists only whenU is constant, and then all processes of a given order are admitted.This research was in part supported by NSERC grant A-8466.     

Near-perfect matrices

A 0, 1 matrixA isnear-perfect if the integer hull of the polyhedron {x0: Ax } can be obtained by adding one extra (rank) constraint. We show that in general, such matrices arise as the cliquenode incidence matrices of graphs. We give a colouring-like characterization of the corresponding class of near-perfect graphs which shows that one need only check integrality of a certain linear program for each 0, 1, 2-valued objective function. This in contrast with perfect matrices where it is sufficient to check 0, 1-valued objective functions. We also make the following conjecture: a graph is near-perfect if and only if sequentially lifting any rank inequality associated with a minimally imperfect graph results in the rank inequality for the whole graph. We show that the conjecture is implied by the Strong Perfect Graph Conjecture. (It is also shown to hold for graphs with no stable set of size eleven.) Our results are used to strengthen (and give a new proof of) a theorem of Padberg. This results in a new characterization of minimally imperfect graphs: a graph is minimally imperfect if and only if both the graph and its complement are near-perfect.The research has partially been done when the author visited Mathematic Centrum, CWI, Amsterdam, The Netherlands.     

A priori error estimates for numerical methods for scalar conservation laws. Part I: The general approach

In this paper, we construct a general theory of a priori error estimates for scalar conservation laws by suitably modifying the original Kuznetsov approximation theory. As a first application of this general technique, we show that error estimates for conservation laws can be obtained without having to use explicitly any regularity properties of the approximate solution. Thus, we obtain optimal error estimates for the Engquist-Osher scheme without using the fact (i) that the solution is uniformly bounded, (ii) that the scheme is total variation diminishing, and (iii) that the discrete semigroup associated with the scheme has the -contraction property, which guarantees an upper bound for the modulus of continuity in time of the approximate solution.