Further generalization of the Dubovicki-Milutin theorem

Combining the results of Walczak (Ref. 1) and Lasiecka (Refs. 2 and 3), we extend the well-known Dubovicki-Milutin theorem in two directions: (i) We allow for treatment of several equality constraints in optimization problems; and (ii) We assume less regularity of optimization problems by requiring the existence of external cones instead of tangent cones. An example of an optimization problem is also considered.     

On disjoint configurations in infinite graphs

For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?₀ disjoint copies of A is referred to as ?₀A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?₀A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G₁, G₂,… such that G_i is not a minor of G_j for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?₀A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016     

模糊集单调型分解定理

模糊集的分解集定理有两种形式，第一种形式与模糊集的λ—截集有关：Ａ＝其中Ａ＿λ是的λ—截集￣［１］．第二种形式与集合套有关：其中Ｈ（λ）为集合套￣［２］或者Ａ＝其中Ｈ（λ）为集合套，Ｑ为（０，１）的可列稠密子集＿［３］，．其实，这两种形式在本文提出的基本模糊集的概念下，可以统一起来成为任何模糊集可以分解为一些（可数或不可数）基本模糊集的和。不仅如此，本文还提出简单模糊集的概念，并证明了任何模糊集都可以表示成为可数个单调上升的简单模糊集的和，或等价地，可以表示成可数个单调上升的简单模糊集的极限，所用的证明方法是构造性的，所以对模糊集的结构也得出了一个清晰的认识．     

R￣d中Hausdorff维数和packing维数的确定

本文目的在于建立确定Ｒ￣ｄ中Ｈａｕｓｄｏｒｆｆ维数ｄｉｍ和ｐａｃｋｉｎｇ维数Ｄｉｍ的两个命题（定理１和定理２），进而寻求Ｒ￣ｄ中Ｈａｕｓｄｏｒｆｆ维数ｄｉｍ与ｐａｃｋｉｎｇ维数Ｄｉｍ相等的条件；这使得我们能够引入分形测度的测度论定义。     

Symmetry specified enumeration of substituted derivatives: an easy solution to the complex problem

Several sophisticated methods to solution of symmetry specified enumeration problems are available in the modern literature. In this paper we propose a simple technique that allows one to manually compute the exact numbers of fixed-symmetry derivatives for a given structure either with inclusion or ignoring the substitution patterns. The basic idea of the method suggested consists in the derivation of Pólya-like cycle indices for the automorphism groups of specially constructed orbit partition graphs; the expansion of these indices and subsequent simple calculations result in the desired numbers of substituted derivatives with achiral substituents. Limitations of the new technique (and a method suggested earlier) depend on the relevance of the orbit partitions for particular subgroups of the point symmetry group. For illustration purposes, the results obtained for the prismane (D _3h ) and adamantane (T _d ) structures are discussed. In the former case the numbers of substituted derivatives can be found for all subgroups of the D _3h group, whereas in the latter case these numbers can be determined for eight out of eleven subgroups of the T _d point symmetry group. This work is based on the text of the lecture presented by the authors at the 5th All-Russia Conference on Molecular Modeling (Moscow, April 2007). The paper deals with the methodology and detailed treatment of applied aspects related to solution of enumeration problems for substituted derivatives with prescribed symmetry groups. Unlike the known methods of symmetry specified enumeration, the technique suggested is simple enough and may be regarded as generalization of the Pólya methodology, which is widely used by chemists. Published in Russian in Izvestiya Akademii Nauk. Seriya Khimicheskaya, No. 2, pp. 227–245, February, 2008.     

Some remarks on indiscernible sequences

We prove a property of generic homogeneity of tuples starting an infinite indiscernible sequence in a simple theory and we use it to give a shorter proof of the Independence Theorem for Lascar strong types. We also characterize the relation of starting an infinite indiscernible sequence in terms of coheirs.     

Spectral shift function and trace formula

The complete proofs of Krein’s theorem on the spectral shift function and the trace formula are given for a pair of self-adjoint operators such that either (i) their difference is trace-class or (ii) the difference of their resolvents is trace-class. The proofs, essentially due to Krein, is based on Herglotz’s theorem on the boundary value of the analytic functions whose imaginary part is non-negative on the upper half plane, and an almost optimal class of functions are obtained for which the trace formula is valid. Also an alternative method based on Weyl-von Neumann’s theorem for self-adjoint operators, avoiding the complex function theory and inspired by Voiculescu’s work, is given for the first case. Furthermore, some applications of the spectral shift function have been discussed.     

Synthesis and characterization of poly(higher‐α‐olefin)s with a nickel(α‐diimine)/methylaluminoxane catalyst system: Effect of chain running on the polymer properties

Homopolymerization of octadecene‐1 at different reaction conditions has been studied. Significant chain running can be seen at higher polymerization temperatures. Interestingly, insertion of octadecene‐1 into a sterically hindered nickel‐cation/carbon (secondary) bond is observed. The microstructure of the polymer was established using NMR spectroscopy. The effects of chain running on polymer melting, crystallization behavior, and dynamic mechanical thermal properties were studied using DSC and DMTA. The extent of chain running (i.e., 2,ω‐, 1,ω‐enchainments) decreases with an increase in the carbon number of α‐olefins. © 2006 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 191–210, 2007     

Alternating copolyfluorenevinyles with polynuclear aromatic moieties: Synthesis,photophysics, and electroluminescence

Three new copolymers, namely poly(fluorenevinylene‐alt‐naphthalenevinylene) ( N ), poly(fluorenevinylene‐alt‐anthracenevinylene) ( A ) and poly(fluorenevinylene‐alt‐pyrenevinylene) ( P ), were synthesized by Heck coupling of 9,9‐dihexyl‐2, 7‐divinylfluorene with a polynuclear aromatic dibromide. The 9,10‐disubstituted anthracene was obtained exclusively for A while N and P were obtained as a mixture of two isomers with predominant the 1,4‐disubstituted naphthalene and 1,8‐disubstituted pyrene, respectively. The polymers were soluble in common organic solvents and decomposed above 370 °C. Their glass transition temperature increased from 58 to 110 °C by increasing the number of the phenyl rings of the polynuclear aromatic moiety. Rather high‐efficiency blue and blue‐greenish photoluminescence (PL) of these copolymers in solution was largely decreased in their films, indicating the presence of concentration quenching in the solid state. The OLED using these polymers demonstrated green EL in the case of copolymers N and A , and red EL in the P derivative with η_EL = 0.26–0.31%. © 2007 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 4661–4670, 2007