符号圈拼接图的零度

令$\eta(\Gamma)$和$c(\Gamma)$是符号图$\Gamma$的零度和基本圈数. 一个符号圈拼接图是指每个块都是圈的连通符号图. 本文证明了对任意符号拼接图$\eta(\Gamma)\le c(\Gamma)+1$成立, 并且刻画了等号成立的极图, 推广了王登银等人(2022)在简单圈拼接图上的结果. 此外, 我们证明了任意的符号拼接图$\eta(\Gamma)\neq c(\Gamma)$, 给出了满足$\eta(\Gamma)=c(\Gamma)-1$的符号拼接图的一些性质并刻画处$\eta(\Gamma)=c(\Gamma)-1$的二部符号拼接图.     

Entropy,Periodicity, and Graphs with Zero Euler Characteristic

Let G be a graph which contains exactly one simple closed curve. We prove that a continuous map f : G → G has zero topological entropy if and only if there exist at most k ≤ |(Edg(G) End(G) 3)/2] different odd numbers n1,...,nk such that Per(f) is contained in ∪i=1^k ∪j=0^∞ ni2^j, where Edg(G) is the number of edges of G and End(G) is the number of end points of G.     

具有较小秩的带号图的刻画

带号图是每条边带有符号（正或负）的简单图.探讨了带号图的秩,刻画了秩为2与3的带号图,以及秩为4的带号二部图.     

Two operators related to Marcinkiewicz integrals

In this paper, the authors consider the boundedness of generalized higher commutator of Marcinkiewicz integral μΩ^b, multilinear Marcinkiewicz integral μΩ^A and its variation μΩ^A on Herz-type Hardy spaces, here Ω is homogeneous of degree zero and satisfies a class of L^s-Dini condition. And as a special case, they also get the boundedness of commutators of Marcinkiewicz integrals on Herz-type Hardy spaces.     

幂零Fuzzy矩阵的一些结论及幂零度的求法

本文给出计算幂零Fuzzy矩阵的幂零度的两个办法,同时给出一个有有向Hamilton路的有向图的一个充分条件.     

大洋彼岸,零度以下

盛夏,美国资本市场的中国概念股却经受着寒冰暴雪。从信任危机发展到生存危机,从个案诉讼发展到全面围猎,而嘉汉林业与＂浑水＂的交战,更表明诉讼浪潮已漫延至其他海外市场上市的中国企业。全世界都在追问原因,但对于CFO来说,如何行动,才应是思考的重点。     

幂等矩阵的组合的零度与秩

本文研究了两个幂等矩阵P与Q的组合Ap Bq-Cpq(a≠0,b≠0)的秩.利用矩阵的核子空间及线性空间的同构的有关性质,得到了:当c＝a b时,Ap Bq-Cpq的秩为一个常数,且等于P-Q的秩;当c≠a b时,Ap Bq-Cpq的秩为一个常数,且等于P Q的秩,推广了J. J. Koliha和V. Rakoeeie[3]的结果.     

给定匹配数和独立数时图零度的上界

设G是一个有n个点的简单图,分别记η(G),m(G)和α(G)为图G的零度、匹配数和独立数.设θ(G)是一个非负整数,定义为使图G成为二部图至少需要从G的边集中删去的边数.本文运用二部划分运算,证明了对于有n个点并且不含有圈长为2的倍数的圈为子图的简单图G,有η(G)≤n-2m(G)+20(G)和η(G)≤2α(G)+2θ(G)-n.     

双圈图的零度与其匹配数之间的关系

Let G be a graph with n(G) vertices and m(G) be its matching number.The nullity of G,denoted by η(G),is the multiplicity of the eigenvalue zero of adjacency matrix of G.It is well known that if G is a tree,then η(G) = n(G)-2m(G).Guo et al.[Jiming GUO,Weigen YAN,Yeongnan YEH.On the nullity and the matching number of unicyclic graphs.Linear Alg.Appl.,2009,431:1293 1301]proved that if G is a unicyclic graph,then η(G)equals n(G)-2m(G)-1,n(G)-2m(G),or n(G)-2m(G) +2.In this paper,we prove that if G is a bicyclic graph,then η(G) equals n(G)-2m(G),n(G)-2m(G)±1,n(G)-2m(G)±2or n(G)-2m(G) + 4.We also give a characterization of these six types of bicyclic graphs corresponding to each nullity.     

链环的零度和符号差的不等式估计

An inequality estimate of signature and nullity for links and those for its satelites has been given in this paper,which is an improvement of the result obtained by Japanese mathematician Tetsuo Shibuya.