一类新的表面活性剂——长链烷基三苯基鏻——Ⅵ.稳态荧光猝灭法测定十二烷基三苯基溴化鏻胶束的平均簇集数

研究了十二烷基三苯基溴化鏻(C_(12)PBr)胶束中N,N-二甲基苯胺(DMA)和二苯甲酮(DPK)对芘的荧光猝灭,发现DMA的猝灭行为不符合Stern-Volmer动态猝灭和Turro静态猝灭模型;DPK的猝灭行为不符合Stern-Volmer猝灭模型,但遵从Turro静态猝灭模型。根据DPK的静态猝灭性质测得C_(12)PBr胶束的平均簇集数为15士2,并相应地得到C_(12)PBr的临界胶束浓度为(1.77±0.09)×10~(-3)mol/L,后者与文献值一致。     

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     

Transversal-Free Translation Nets

Translation planes of order q ² containing non-Desarguesian Baer subplanes are used to construct transversal-free translation nets with very small deficiencies. Also, a generalization of the ideas of Bruen shows that any non-Desarguesian spread in PG(3, q) produces a transversal-free net of small deficiency.     

On CCE graphs of doubly partial orders

Let D be a digraph. The competition-common enemy graph (CCE graph) of D has the same set of vertices as D and an edge between vertices u and v if and only if there are vertices w and x in D such that (w,u), (w,v), (u,x), and (v,x) are arcs of D. We call a graph a CCE graph if it is the CCE graph of some digraph. In this paper, we show that if the CCE graph of a doubly partial order does not contain C₄ as an induced subgraph, it is an interval graph. We also show that any interval graph together with enough isolated vertices is the CCE graph of some doubly partial order.     

关于紧优双环网络的无限族

双环网络是计算机互连网络和通讯系统的一类重要拓扑结构．1993年,李乔等人提出一个系统的构造方法,构造出69类0紧优和33类1紧优双环网络的无限族,并提出研究下述问题:求k(k>1)紧优双环网络的无限族．2003年,徐俊明等人给出一个4紧优双环网络的无限族．本文首先证明从每一个具体的0紧优双环网络出发,都可以构造若干0紧优双环网络无限族;结合同余方程组理论和数论中的素数理论,给出若干求一般k(k≥0)紧优双环网络无限族(包括非单位步长双环网络无限族)的方法．     

E*-酉范畴逆半群的结构

本文通过定义本原逆半群在集合上的部分作用及其整体化,给出了E*-酉范畴逆半群的结构．     

Metallic radii of nonmetals

Experimental data are used to determine the atomic volumes and radii of the elements of subgroups IV–VIIA in the structures of metallic phases at high pressures. Metallic radii of nonmetals are compared with values based on Pauling and Goldschmidt calculations.Translated fromIzvestiya Akademii Nauk. Seriya Khimicheskaya, No. 2, pp. 220–222, February, 1994.     

Some Invariance Principles for Random Vectors in the Generalized Domain of Attraction of the Multivariate Normal Law

For independent identically distributed random vectors belonging to the generalized Domain of Attraction of the multivariate normal law, we define two partial sum processes analogous to that of Donsker's Theorem. We prove that each converges in distribution to a Brownian Motion in the space of continuous functions. One process uses nonrandom operator normalization, and the other is a studentization of the first, using normalization by the empirical covariance operator.     

几类数列通项的矩阵求法

本利用矩阵给出了几类数列的通项公式的求法，把数列通项公式的求法转化为矩阵幂的计算，思路简单、计算简便，并能判别其敛散性。     

Linear Ramsey numbers of sparse graphs

The Ramsey number R(G₁,G₂) of two graphs G₁ and G₂ is the least integer p so that either a graph G of order p contains a copy of G₁ or its complement G^c contains a copy of G₂. In 1973, Burr and Erd?s offered a total of $25 for settling the conjecture that there is a constant c = c(d) so that R(G,G)≤ c|V(G)| for all d‐degenerate graphs G, i.e., the Ramsey numbers grow linearly for d‐degenerate graphs. We show in this paper that the Ramsey numbers grow linearly for degenerate graphs versus some sparser graphs, arrangeable graphs, and crowns for example. This implies that the Ramsey numbers grow linearly for degenerate graphs versus graphs with bounded maximum degree, planar graphs, or graphs without containing any topological minor of a fixed clique, etc. © 2005 Wiley Periodicals, Inc. J Graph Theory