Sufficient Conditions for a Digraph to be Supereulerian

A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs.     

Every diassociative A-loop is Moufang

An A-loop is a loop in which every inner mapping is an automorphism. A problem which had been open since 1956 is settled by showing that every diassociative A-loop is Moufang.

     

一类NLS-mKdV方程族的扩展可积系统

利用代数变换，构造了与文献［５］中的loop代数₂的子代数等价的loop代数1的一个子 代数₁.再将₁扩展为一个高维的loop代数.利用设计了一个等谱问题 ，结合子代数间的直 和运算和同构关系，得到了NLS_mKdV方程族的一类扩展可积系统.作为约化情形，求得了著 名的Schrdinger方程与mKdV方程的可积耦合系统. 关键词： loop代数 可积系统 等谱问题     

非线性光纤环形镜的脉冲透过特性研究

研究了光纤反常色散区非线性环形镜（NOLM）的脉冲透过特性，得到NOLM周期性透过率函数 第一极大值处透过率、压缩比和对应的孤子阶数与环长之间的函数关系图.通过比较长环和 短环NOLM对无啁啾、啁啾脉冲的透过率和压缩比特性，得出了长环有利于脉冲整形而短环有 利于脉冲压缩的结论. 关键词： 非线性环形镜 透过率 压缩比 孤子阶数     

Timelike Minimal Surfaces via Loop Groups

This work consists of two parts. In Part I, we shall give a systematic study of Lorentz conformal structure from structural viewpoints. We study manifolds with split-complex structure. We apply general results on split-complex structure for the study of Lorentz surfaces.In Part II, we study the conformal realization of Lorentz surfaces in the Minkowski 3-space via conformal minimal immersions. We apply loop group theoretic Weierstrass-type representation of timelike constant mean curvature for timelike minimal surfaces. Classical integral representation formula for timelike minimal surfaces will be recovered from loop group theoretic viewpoint.     

A Note on Topological Entropy of Maps

For a given collection of subsets of a compact metric space X which cover X,the entropies,hm(f)and hi(f),are introduced for a continuous map f of X to itseif. Also the concept of shadowing property with same end point (SPSEP for short) is introduced. The main results are,(1)H(f)≤hi(f)+hm(f)and,(2)h(f)=hm(f)whenever f has SPSEP,where h(f) is the topological entropy of f. Moreover,several corollaries are obtained.     

具有奇异值分解性质的代数

设F为一个域,R为一个带有对合的F-代数,如果R上每一个矩阵都有奇异值分解(简称SVD),则称R为一个有SVD性质的F-代数.本文指出:R为一个有SVD性质的F-代数的充要条件是:R同构于R~+,或R~+上二次扩域,或R~+上四元数体((-1,-1)/R~+),其中R~+为R的对称元集合,并且R~+为一个Galois序闭域.     

Browder-Petryshyn 型的严格伪压缩映射的粘滞迭代逼近方法

主要研究Browder-Petryshyn型的严格伪压缩映射的粘滞迭代逼近过程,证明了Browder-Petryshyn型的严格伪压缩映射的不动点集F(T)是闭凸集．在q-一致光滑且一致凸的Banach空间中,对于严格伪压缩映射T,利用徐洪坤在2004年引进的粘滞迭代得到的序列弱收敛于T的某个不动点．同时证明了Hilbert空间中Browder-Petryshyn型的严格伪压缩映射的相应迭代序列强收敛到T的某个不动点,其结果推广与改进了徐洪坤2004年的相应结果．     

Dual Characterizations of Set Containments with Strict Convex Inequalities

Characterizations of the containment of a convex set either in an arbitrary convex set or in the complement of a finite union of convex sets (i.e., the set, described by reverse-convex inequalities) are given. These characterizations provide ways of verifying the containments either by comparing their corresponding dual cones or by checking the consistency of suitable associated systems. The convex sets considered in this paper are the solution sets of an arbitrary number of convex inequalities, which can be either weak or strict inequalities. Particular cases of dual characterizations of set containments have played key roles in solving large scale knowledge-based data classification problems where they are used to describe the containments as inequality constraints in optimization problems. The idea of evenly convex set (intersection of open half spaces), which was introduced by W. Fenchel in 1952, is used to derive the dual conditions, characterizing the set containments.     

A new method for constructing infinite families of k-tight optimal double loop networks

The double loop network (DLN) is a circulant digraph with n nodes and outdegree 2. DLN has been widely used in the designing of local area networks and distributed systems. In this paper, a new method for constructing infinite families of k-tight optimal DLN is presented. For k = 0,1,…,40, the infinite families of k-tight optimal DLN can be constructed by the new method, where the number nk(t,a) of their nodes is a polynomial of degree 2 in t and contains a parameter a. And a conjecture is proposed.