Petersen图的点传递正则覆盖图

运用基图自同构能被提升的线性准则 ,对满足 :1覆叠变换群 K =Znp,2覆盖图的保簇变换群是点传递的 Petersen图的连通正则覆盖图进行了完全分类 .这种图共有 1 2种类型 .     

Some New Results for McKean’s Graphs with Applications to Kac’s Equation

The main goal of the present paper is to sharpen some results about the error made when the Wild sums, used to represent the solution of the Kac analog of Boltzmann’s equation, are truncated at the n-th stage. More precisely, in Carlen, Carvalho and Gabetta (J. Funct. Anal. 220: 362–387 (2005)), one finds a bound for the above-mentioned error which depends on (an ^Λ+ε). On the one hand, it is shown that Λ, the least negative eigenvalue of the linearized collision operator, is the best possible exponent. On the other hand, ε is an extra strictly positive number and a a positive coefficient which depends on ε too. Thus, it is interesting to check whether ε can be removed from the above bound. According to the aforesaid reference, this problem is studied here by means of the probability distribution of the depth of a leaf in a McKean random tree. In fact, an accurate study of the probability generating function of such a depth leads to conclude that the above bound can be replaced with (a′ n ^Λ).     

简单完整正则平面图

对简单完整正则平面图的特性和结构进行了分析和讨论 ,找出了简单完整正则平面图的可能的种类 .此外 ,对各种简单完整正则平面图的色数进行了求解 ,并用不同的方法给出了各个简单完整正则平面图的作色方案 .     

Vertices of Degree 5 in a Contraction Critically 5-connected Graph

An edge of a k-connected graph is said to be k-contractible if the contraction of the edge results in a k-connected graph. A k-connected graph with no k-contractible edge is said to be contraction critically k-connected. We prove that a contraction critically 5-connected graph on n vertices has at least n/5 vertices of degree 5. We also show that, for a graph G and an integer k greater than 4, there exists a contraction critically k-connected graph which has G as its induced subgraph.     

The Two-dimensional Electromagnetic Scattering from Periodic Chiral Structures and Its Finite Element Approximation

In this paper, we consider the electromagnetic scattering from periodic chiral structures. The structure is periodic in one direction and invariant in another direction. The electromagnetic fields in the chiral medium are governed by the Maxwell equations together with the Drude-Born-Fedorov equations. We simplify the problem to a two-dimensional scattering problem and we show that for all but possibly a discrete set of wave numbers, there is a unique quasi-periodic weak solution to the diffraction problem. The diffraction problem can be solved by finite element method. We also establish uniform error estimates for the finite element method and the error estimates when the truncation of the nonlocal transparent boundary operators takes place.     

Frobenius Pairs with Perfect Involutions

An involution i of a group G is said to be perfect in G if any two non-commuting involutions in i^G are conjugated by an involution in the same class. We generalize theorems of Jordan and M. Hall concerning sharply doubly transitive groups, and the Shunkov theorem on periodic groups with a finite isolated subgroup of even order. __________ Translated from Algebra i Logika, Vol. 44, No. 6, pp. 751–762, November–December, 2005.     

EXISTENCE AND ATTRACTIVITY OF ALMOST PERIODIC SOLUTION FOR SHUNTING INHIBITORY CELLULAR NEURAL NETWORKS WITH CONTINUOUSLY DISTRIBUTED DELAYS AND VARIABLE COEFFICIENTS

In this paper, a class of two-dimensional shunting inhibitory cellular neural networks with distributed delays and variable coefficients system is studied. By using the Schauder's fixed point theorem and Lyapunov function, we obtain some sufficient conditions about the existence and attractivity of almost periodic solutions to the above system, and all its solutions converge to such almost periodic solution. An example is given to illustrate that the conditions of our results are feasible.     

组合计数的群论与计算机方法

本文综述组合数学和图论中解决计数问题的群论与计算机方法及其最新发展。传统的计数方法得到有限的计数公式或递推公式等，然而许多复杂的问题很难得到有限的表达式，即使能得到，公式也往往非常复杂。由于计算机技术的发展不仅使复杂的计数公式有了实际意义，而且可以设计恰当的计算方法进行数值计算，使计数问题有更为广阔的发展领域。另一方面，为了计算不同构的图或组合结构，最有效的方法是群论方法，因此把群论方法与计算机方     

Existence of periodic solutions

An apparatus for proving existence theorems for periodic solutions of equations with discontinuous right-hand side and differential inclusions is developed. Translated fromMatematischeskie Zametki, Vol. 61, No. 5, pp. 769–784, May, 1997. Translated by V. N. Dubrovsky