Vertex-disjoint rainbow triangles in edge-colored graphs

Let $G$ be an edge-colored graph of order $n$. The minimum color degree of $G$, denoted by ${\delta }^c\left(G\right)$, is the largest integer $k$ such that for every vertex $v$, there are at least $k$ distinct colors on edges incident to $v$. We say that an edge-colored graph is rainbow if all its edges have different colors. In this paper, we consider vertex-disjoint rainbow triangles in edge-colored graphs. Li (2013) showed that if ${\delta }^c\left(G\right)\ge (n+1)∕2$, then $G$ contains a rainbow triangle and the lower bound is tight. Motivated by this result, we prove that if $n\ge 20$ and ${\delta }^c\left(G\right)\ge (n+2)∕2$, then $G$ contains two vertex-disjoint rainbow triangles. In particular, we conjecture that if ${\delta }^c\left(G\right)\ge (n+k)∕2$, then $G$ contains $k$ vertex-disjoint rainbow triangles. For any integer $k\ge 2$, we show that if $n\ge 16k-12$ and ${\delta }^c\left(G\right)\ge n∕2+k-1$, then $G$ contains $k$ vertex-disjoint rainbow triangles. Moreover, we provide sufficient conditions for the existence of $k$ edge-disjoint rainbow triangles.     

The Chang-Łoś-Suszko theorem in a topological setting

The Chang-Łoś-Suszko theorem of first-order model theory characterizes universal-existential classes of models as just those elementary classes that are closed under unions of chains. This theorem can then be used to equate two model-theoretic closure conditions for elementary classes; namely unions of chains and existential substructures. In the present paper we prove a topological analogue and indicate some applications.     

Dielectric relaxation analysis of starch oligomers and polymers with respect to their chain length

Starch belongs to the polyglucan group. This type of polysaccharide shows a broad β-relaxation process in dielectric spectra at low temperatures, which has its molecular origin in orientational motions of sugar rings via glucosidic linkages. This chain dynamic was investigated for α(1,4)-linked starch oligomers with well-defined chain lengths of 2, 3, 4, 6, and 7 anhydroglucose units (AGUs) and for α(1,4)-polyglucans with average degrees of polymerization of 5, 10, 56, 70, and so forth (up to 3000; calculated from the mean molecular weight). The activation energy (E_a) of the segmental chain motion was lowest for dimeric maltose (E_a = 49.4 ± 1.3 kJ/mol), and this was followed by passage through a maximum at a degree of polymerization of 6 (E_a = 60.8 ± 1.8 kJ/mol). Subsequently, E_a leveled off at a value of about 52 ± 1.5 kJ/mol for chains containing more than 100 repeating units. The results were compared with the values of cellulose-like oligomers and polymers bearing a β(1,4)-linkage. Interestingly, the shape of the E_a dependency on the chain length of the molecules was qualitatively the same for both systems, whereas quantitatively the starch-like substances generally showed higher E_a values. Additionally, and for comparison, three cyclodextrins were measured by dielectric relaxation spectroscopy. The ringlike molecules, with 6, 7, and 8 α(1,4)-linked AGUs, showed moderately different types of dielectric spectra. © 2003 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 42: 188–197, 2004     

行波管内不连续性的简易模型分析

 根据行波管内微波信号在输能装置和切断衰减器处两个不连续性之间来回反射的物理现象，建立行波管输出段的简易网络串模型，并对行波管输出段传输特性参数的幅频特性、相频特性进行计算分析。结果表明：输能装置和切断衰减器的不连续性是造成幅相一致性行波管相位不可补偿的重要因素之一。     

On potentially <Emphasis Type="Italic">H</Emphasis>-graphic sequences

For given a graph H, a graphic sequence π = (d ₁, d ₂,..., d _n) is said to be potentially H-graphic if there is a realization of π containing H as a subgraph. In this paper, we characterize the potentially (K ₅ − e)-positive graphic sequences and give two simple necessary and sufficient conditions for a positive graphic sequence π to be potentially K ₅-graphic, where K _r is a complete graph on r vertices and K _r-e is a graph obtained from K _r by deleting one edge. Moreover, we also give a simple necessary and sufficient condition for a positive graphic sequence π to be potentially K ₆-graphic. Project supported by National Natural Science Foundation of China (No. 10401010).     

Fourth-order problems with fully nonlinear boundary conditions

Differential inequality method, bounding function method and topological degree are applied to obtain the existence criterions of at least one solution for the general fourth-order differential equations under nonlinear boundary conditions, and many existing results are complemented.     

一类广义Bent型S-Box的构造

S-box是密码理论与实践中十分重要的一种装置 ,它的密码性能由其分量函数所决定 .于是 ,选择适当的分量函数来构造 S-box就成了一个重要的研究课题 .在一定意义上 ,Bent函数是最优良的密码函数 .本文通过函数序列半群和置换群来构造其任何非零线性组合为 Bent函数与线性函数之和的函数组 ,从而可由 Bent函数构造出具有高度非线性度和其他良好性状的 S-box     

The Existence of Periodic Orbits for Higher Dimensional Autonomous Systemswith Small Perturbations

ＴｈｅＥｘｉｓｔｅｎｃｅｏｆＰｅｒｉｏｄｉｃＯｒｂｉｔｓｆｏｒＨｉｇｈｅｒＤｉｍｅｎｓｉｏｎａｌＡｕｔｏｎｏｍｏｕｓＳｙｓｔｅｍｓｗｉｔｈＳｍａｌｌＰｅｒｔｕｒｂａｔｉｏｎｓＪｉａｎｇＬｉｑｉｎｇ（蒋里强）；ＺｈｏｕＹｉ（周毅）；ＦａｎＹｅ（范晔）（...