L^∞（G）中的一个闭凸不变集

设G是局部紧群,f是G上的右一致连续函数.本文讨论L(G)中一个闭凸不变集的关系式Co{Lxfx∈G}11@11={φ*fφ∈P＇(G)}11@11(f∈R∪C(G)).由此式易得出RUC(G)上的左不变平均与拓扑左不变平均的等价关系.     

C~n中单位球面上的不变g-函数及BMOA

设B是C~n中的单位球,S是C~n中的单位球面。■(f)是定义在S上的不变g-函数．设f∈ BMOA,若存在正测度集ES,使■(f)＜ ∞在E上成立,则■(f)＜ ∞在S上几乎处处成立,同时■(f)∈BMO(S)且存在常数C,使得‖■(f)‖≤C‖f‖.     

某些平均压缩迭代函数系的不变测度的L2维数的估计

假设f={f1,……,fm}是定义在R^d上的m个Lipschitz函数，形如fi(x)=λi^-1x bi(λi∈Z),假定由f产生的迭代函数系(IFS)是平均压缩的，本文给出了这种迭代函数系的不变测度的L^2-维数的上、下界的估计。     

Fourier-Laplace级数的强逼近

设f是Rn(n≥3)中单位球面∑n-1上的可积函数,Sθ(f)是步长为θ∈R的平移算子.σδN(f)是Fourier-Laplace级数的δ阶Ceaaro平均.如果∫π0 |Sθ(f)-f|p/θ2dθ∈ L∞ (∑n- 1 ),则∑∞k=0 |σλk(f)-f|p∈L∞(∑n-1)且∑∞k=0(f)-f|p∈L∞(∑n-1 ),其中Eλk(f)为Cesaro平均σλk的等收敛算子.     

联图Fn∨Pm的邻点可区别全染色

设G(V,E)是阶数至少为2的简单连通图,k是正整数,V∪E到{1,2,3,…k}的映射f满足:对任意uv,uw∈E(G),u≠w,有f(uv)≠f(vw);对任意uv∈E(G),有f(u)≠f(v), f(u)≠f(uv),f(v)≠f(uv);那么称f为G的k-正常全染色,若f还满足对任意uv∈E(G),有G(u)≠C(v),其中C(u)={f(u)}∪{f(uv)|uv∈E(G),v∈V(G)}那么称f为G的k-邻点可区别的全染色(简记为k-AVDTC),称min{k|G有k-邻点可区别的全染色}为G的邻点可区别的全色数,记作Xat(G)．本文得到了联图Fn∨Pm的全色数．     

若干Mycielski图的邻点可区别E-全染色

设G(V,E)是简单连通图,k是正整数,若V∪到{1,2,3,…,k}的映射f满足对任意uv∈E(G),有f(U)≠f(v),f(u)≠f(uv)f(v)≠f(uv),且C(u)≠C(v),其中C(u):{f(u)}∪{f(uv)|uv∈E(G)}.那么称f为G的k-邻点可区别的E-全染色(简记为k-AVDETC),并称X_(at)~e(G)=min{k|G有k-邻点可区别的E-全染色}为G的邻点可区别的E-全色数.本文讨论了路、圈、扇、星、轮及完全图的Mycielski图的邻点可区别E-全染色,得到了该类图的邻点可区别的E-全色数.     

图映射的非游荡集

§ 1　IntroductionLet N be the set of all natural numbers.Write Z+=N∪ { 0 } ,Nn={ 1 ,2 ,...,n} andZn={ 0 }∪Nnfor any n∈N.Let X be a topological space and f:X→X be a continuous map.Forx∈X,O(x,f) ={ fk(x) :k∈ Z+} is called the orbit of x.The set of periodic points,the set of recurrentpoints,the set ofω-limit points for some x∈X and the set of non-wandering points of fare denoted by P(f) ,R(f) ,ω(x,f) andΩ(f) ,respectively(for the definitions see[1 ] ) .Let A X,we use int(A) ,A…     

符号混合控制问题的某些NP-完全性结果

Let G =(V, E) be a simple graph with vertex set V and edge set E. A signed mixed dominating function of G is a function f:V∪E→ {-1, 1} such that ∑_(y∈N_m(x)∪{x})f(y)≥ 1for every element x∈V∪E, where N_m(x) is the set of elements of V∪E adjacent or incident to x. The weight of f is w(f) =∑_(x∈V∪E)f(x). The signed mixed domination problem is to find a minimum-weight signed mixed dominating function of a graph. In this paper we study the computational complexity of signed mixed domination problem. We prove that the signed mixed domination problem is NP-complete for bipartite graphs, chordal graphs, even for planar bipartite graphs.     

A MIXED SUPERLINEARLY CONVERGENT ALGORITHM WITH NONMONOTONE SEARCH FOR CONSTRAINED OPTIMIZATIONS

§ 1　 IntroductionConsider the optimization problemmin{ f(x) :gj(x)≤ 0 ,j∈ I,gj(x) =0 ,j∈ L,x∈ Rn} ,(1 )where f(x) ,gj(x) :Rn→R,j∈I∪L.I={ 1 ,2 ,...,m} ,L={ m 1 ,...,m p} .We know thatthe sequential quadratic programming(SQP) [1～ 4] is one of the mostef-ficient methods to solve problem(1 ) because of its superlinear convergence.In order toovercome the Maratos effect[5] ,SQP should solve two quadratic sub-programmings ateachiteration,which,however,causes the amountof computation…     

完全图全符号控制数的较小上界和下确界

设图G=G(V,E),令函数f∶V∪E→{-1,1},f的权w(f)=∑x∈V∪Ef[x],对V∪E中任一元素,定义f[x]=∑y∈NT[x]f(y),这里NT[x]表示V∪E中x及其关联边、邻点的集合.图G的全符号控制函数为f∶V∪E→{-1,1},满足对所有的x∈V∪E有f[x]1,图G的全符号控制数γT(G)就是图G上全符号控制数的最小权,称其f为图G的γT-函数.本文得到了完全图全符号控制数的一个较小上界和下确界.