基于公式真度的公式集约简

基于经典命题逻辑的真度理论,讨论了经典命题逻辑系统当中公式集的约简问题。提出了真度约简及α-真度约简的概念,为公式集的约简提供了一种可行的操作方法。     

Factorizations of complete graphs into caterpillars of diameter 5

We examine factorizations of complete graphs K_2n into caterpillars of diameter 5. First we present a construction generalizing some previously known methods. Then we use the new method along with some previous partial results to give a complete characterization of caterpillars of diameter 5, which factorize the complete graph K_2n.     

Polynomial factorization over

We describe algorithms for polynomial factorization over the binary field , and their implementation. They allow polynomials of degree up to to be factored in about one day of CPU time, distributing the work on two processors.

     

A fluctuation theory for Markov chains

A fluctuation theory for Markov chains on an ordered countable state space is developed, using ladder processes. These are shown to be Markov renewal processes. Results are given for the joint distribution of the extremum (maximum or minimum) and the first time the extremum is achieved. Also a new classification of the states of a Markov chain is suggested. Two examples are given.     

Kp,q-factorization of complete bipartite graphs

Let K_(m,n) be a complete bipartite graph with two partite sets having m and nvertices, respectively. A K_(p,q)-factorization of K_(m,n) is a set of edge-disjoint K_(p,q)-factorsof K_(m,n) which partition the set of edges of K_(m,n). When p=i and q is a prime number,Wang, in his paper "On K_(1,k)-factorizations of a complete bipartite graph" (Discrete Math,1994, 126; 359-364), investigated the K_(1,q)-factorization of K_(m,n) and gave a sufficientcondition for such a factorization to exist. In the paper "K_(1,k)-factorizations of completebipartite graphs" (Discrete Math, 2002, 259: 301-306), Du and Wang extended Wang'sresult to the case that q is any positive integer In this paper, we give a sufficient conditionfor K_(m,n) to have a K_(p,q)-factorization. As a special case, it is shown that the Martin's BACconjecture is true when p: q=k: (k+1) for any positive integer k.     

Fixed points of asymptotic contractions

Let be a contractive gauge function in the sense that φ is continuous, φ(s)<s for s>0, and if f:M→M satisfies d(f(x),f(y))?φ(d(x,y)) for all x,y in a complete metric space (M,d), then f always has a unique fixed point. It is proved that if T:M→M satisfies

     

Factorization in finite-codimensional ideals of group algebras

Let G be a -compact, locally compact group and I be a closed2-sided ideal with finite codimension in L¹(G). It is shownthat there are a closed left ideal L having a right boundedapproximate identity and a closed right ideal R having a leftbounded approximate identity such that I = L + R. The proofuses ideas from the theory of boundaries of random walks ongroups. 2000 Mathematics Subject Classification: primary 43A20;secondary 42A85, 43A07, 46H10, 46H40, 60B11.     

时滞惯性流形及近似时滞惯性流形族

时滞惯性流形是对耗散系统惯性流形、近似惯性流形的最新发展,它基于对 大小涡分量间相互作用更细致的观察,即改变了惯性流形和近似惯性流形方法中大小 涡分量间相互作用为瞬时行为的隐含假定,而认为这种作用与系统的历史相关的．本 文结出了一类耗散系统时滞惯性流形的存在性证明,由于其存在性不需要“谱间隔条 件”保证,因而时滞惯性流形是广泛存在的．随后我们引出了一类离散的时滞惯性流 形,并在此基础上构造了一种近似时滞惯性流形族,分别给出了它们近似时滞惯性流 形的误差估计,结果显示这种新方法为构造稳定和高精度的算法提供了可能．     

Factorization Systems and Adjunctions

Several results on the translation of factorization systems along adjunctions are proved. The first of these results is the answer to the question posed by G.Janelidze.