包装{(p,p-1),(p,p)}图对和 Slater 问题

设 G 是一个简单无向图.V(G),E(G)分别表示 G 的顶点集和边集.(?)表示 G 的补图.我们以 S_(?) 表示 n 1阶星图 k_(1,n-1).称 G 是(p,p—k)图,如果|E(G)|=|V(G)|—k.称|V(G)|为图 G 的阶.设 G_1,G_2是同阶图,(?)_1是 V(G_1)到 V(G_2)的一个双射,(?)_2是 V(G_2)上的一个置换,我们用(?)_2(?)_1表示 V(G_1)到 V(G_2)的双射,其作用为     

多叶解析函数族子类的一些结果(英文)

本文研究了在单位开圆盘U={z:|z|1}内多叶解析的函数族G_(p,c)~*(a,b,σ)的性质.利用函数论的方法,获得了G_(p,c)~*(a,b,σ)族相关的准哈达玛乘积的一般化结果及G_(p,c)~*(a,b,σ)的极值点与支撑点.推广了先前相应的一些研究工作。     

利用微分从属定义的积分算子函数族的性质研究

介绍了利用微分从属关系定义的一类函数类v_k[p,A,B]和一类算子函数I_p~λ(μ,η)(z),在上述算子函数的基础上定义了两类积分算子函数F_(p,μ,η)~(n,λ)(z),G_(p,μ,η)~(n,λ)(z),利用微分从属和凸函数理论,得到了积分算子函数F_(p,μ,η)~(n,λ)(z),G_(p,μ,η)~(n,λ)(z)包含于函数类v_k[p,A,B]的条件,结论推广了部分已有的研究成果.     

The Decision Problems for Properties of Transformation Groups

In this paper the fundamental result about the decision problems for properties of FRT-groups (i. e. the groups each of which is isomorphic with a group generated by a finite number of recursive transformations) has been proved: Let p be any algebraic property for groups such that there is a FRT-group G_1 which has the property p, a FRT-group G_2 which has not the property p, and G_2 is not isomorphic with any subgroup of any FRT-group which has the property p. Then the problem of deoiding, for any given groap P genetated by a finite number of recursive transformations, whether or not the group G isomorphic with P has the property p is unsolvable.     

一类稀疏随机图的距离匹配数（英文）

对于任意给定的正整数k,图G的距离匹配数um_k(G)是指任意两条边之间距离大于k的最大边数的集合.令G_(n,p)为经典Erds-Rényi随机图.Kang和Manggala刻画得到了当k≥2,边概率为p=c/n时稀疏Erds-Rényi随机图距离匹配数um_k(G_(n,p))的上界,其中c为足够大的常数.本文第一次利用二阶矩方法获得当k≥2时此类稀疏随机图距离匹配数的下界.     

关于“2~3p阶群(p为奇素数,p≠3,7)的构造”

文献[1]中利用五种2~2p阶群被2阶循环群的扩张找出2~3p阶群(p为奇素数,p≠3,7)的构造。本文力求用更简便的方法找出之,并给出2~4p阶群(p为奇素数)的构造。 我们知道2~3p阶群(p为奇素数,p≠3,7)G是超可解群,因此换位子群G'幂零。有G'≤F(G),F(G)是Fitting-子群,从而G是F(G)被交换群的扩张。设O,P分别为G之Sylow 2-子群,Sylowp-子群,则P≤F(G)。因而P≤Z(F(G))。且|F(G)|=p,2p,2~2p,或2~3p。由此可得:     

KERNEL WORDS AND GAP SEQUENCE OF THE TRIBONACCI SEQUENCE

In this paper, we investigate the factor properties and gap sequence of the Tribonacci sequence, the fixed point of the substitution σ(a, b, c) =(ab, ac, a). Let ωpbe the p-th occurrence of ω and Gp(ω) be the gap between ωpand ω_(p+1). We introduce a notion of kernel for each factor ω, and then give the decomposition of the factor ω with respect to its kernel. Using the kernel and the decomposition, we prove the main result of this paper:for each factor ω, the gap sequence {Gp(ω)}p≥1is the Tribonacci sequence over the alphabet{G_1(ω), G_2(ω), G_4(ω)}, and the expressions of gaps are determined completely. As an application, for each factor ω and p ∈ N, we determine the position of ωp. Finally we introduce a notion of spectrum for studying some typical combinatorial properties, such as power, overlap and separate of factors.     

具次约束的最优树形图问题

给定一有向图G_0,其某一结点v_s称为特定结点,它共有p条出弧:α_1,α_2,…,α_p,分别指向结点v_1,v_2,…,v_p,这p个结点称为(v_s的)邻点。令T为G_0的一个支撑树形图,若其结点v_s有且仅有k条出弧,则T称为(k)支撑树形图。设对G_0的每一条弧α,均给以一弧长w_0(α),则弧长之和最小的支撑树形图称为最优树形图。若在一个最优树形图中,其结点v_s有且仅有k条出弧,则此最优树形图称为最优(k)树形图。而在所有(k)支撑树形图中,其弧长之和最小者称为(k)最优树形图。显然,一个最优(k)树形图必为     

笛卡尔乘积图的圈点连通度

图G的圈点连通度,记为κ_c(G),是所有圈点割中最小的数目,其中每个圈点割S满足G-S不连通且至少它的两个分支含圈.这篇文章中给出了两个连通图的笛卡尔乘积的圈点连通度:(1)如果G_1≌K_m且G_2≌K_n,则κ_c(G_1×G_2)=min{3m+n-6,m+3n-6},其中m+n≥8,m≥n+2,或n≥m+2,且κ_c(G_1×G_2)=2m+2n-8,其中m+n≥8,m=n,或n=m+1,或m=n+11;(2)如果G_1≌K_m(m≥3)且G_2■K_n,则min{3m+κ(G_2)-4,m+3κ(G_2)-3,2m+2κ(G_2)-4}≤κ_c(G_1×G_2)≤mκ(G2);(3)如果G_1■K_m,K_(1,m-1)且G_2■K_n,K_(1,n-1),其中m≥4,n≥4,则min{3κ(G_1)+κ(G_2)-1,κ(G_1)+3κ(G_2)-1,2_κ(G_1)+2_κ(G_2)-2}≤κ_c(G_1×G_2)≤min{mκ(G_2),nκ(G_1),2m+2n-8}.     

群的形变收缩及Toeplitz代数

设G为一个离散群,(G,G_ )为一个拟偏序群使得G_ ~0=G_ ∩G_ ~(-1)为G的非平凡子群。令[G]为G关于G_ ~0的左倍集全体,|G_ |为[G]的正部。记T~(G_ )和T~([G_ ])为相应的Toeplitz代数。当存在一个从G到G_ ~0上的形变收缩映照时,我们证明了T~(G_ )酉同构于T~([G_ ])×C_r~*(G_ ~0)的一个C_-~*c子代数。若进一步,G_ ~0还为G的一个正规子群,则T~(G_ )与T~([G_ ])×C_r~*(G_ ~0)酉同构。