给定最大度的单圈偶图的谱半径

单圈偶图是边数等于顶点数的简单连通偶图.Δ（G）表示图G的最大度.文中给出了最大度为Δ(≥ⁿ⁺¹/2)的n阶单圈偶图的谱半径的上界,并刻画了达到该上界的图.文中还证明了当Δ（G）≥[（2n+1）/3]+1时,n（≥8）阶单圈偶图G的谱半径随着最大度的递增而严格递增,并在此基础上给出了谱半径排在前17位的n（≥16）阶单圈偶图.     

给定团数的连通图的最小代数连通度

图G的拉普拉斯矩阵的第二小特征值称为图G的代数连通度.在给定团数ω的n阶连通图中,本文刻画了具有最小代数连通度的图为风筝图PK_(n-ω,ω),其中风筝图PK_(n-ω,ω)是由完全图K_ω在某一点上引出一条悬挂路P_(n-ω)而得到的图.同时,对风筝图PK_(n-ω,ω)的代数连通度的一些性质也做了讨论.     

无爪图中的最长圈

本文证明了:n阶3—连通无爪图G中的最长圈的长至少为min{4k—5,n},这里k是G的最小度.     

连通图的谱半径上界

图谱理论是图论研究的重要的领域之一.设图G是n阶简单连通图,具有n顶点和m条边的连通图,p(G)为图G的邻接矩阵的谱半径.利用代数的方法得出两个ρ(G)的上界为:■与■和达到上界的图.     

直径为2图中的长圈

经过图的每个点恰一次的圈称为是图的Hamiltonian圈.假设G是直径为2的n阶连通图.通过研究顶点的邻域,给出一些G包含长圈的充分条件.     

c-圈图的Laplace谱半径和最大度

设G是一个n阶的简单连通图,符号(d_1,d_2,...,d_n)表示G的度序列,其中d_1≥d_2≥···≥d_n,用符号?(G)表示G的最大度,而符号λ(G)表示G的Laplace谱半径.一个c-圈图是一个恰有n+c-1条边的n阶简单连通图,而符号C(n,?;c)表示最大度等于?的所有n阶c-圈图的集合.本文确定了当0≤c≤1/2(?-1)(?-2)时,C(n,?;c)中所有取得最小Laplace谱半径的极图,并分别确定了当?≥[n+2/3]且d_4≥2或?≥[n/3]+1且d_4=1时,C(n,?;1)中唯一取得最大Laplace谱半径的极图.进一步地,还证明了对于两个n阶的单圈图G和G′,如果?(G)≥[11n/30]+2且?(G)?(G′),则λ(G)λ(G′),并且界"[11n/30]+2"是最佳的.     

单圈图和双圈图的最大无符号拉普拉斯分离度

设G是一个n阶简单图,q_{1}(G)\geq q_{2}(G)\geq \cdots \geq q_{n}(G)是其无符号拉普拉斯特征值. 图G的无符号拉普拉斯分离度定义为S_{Q}(G)=q_{1}(G)-q_{2}(G). 确定了n阶单圈图和双圈图的最大的无符号拉普拉斯分离度,并分别刻画了相应的极图.     

一类混合图的结构及其特征空间

主要讨论具有如下性质的一类连通混合图G:其所有非奇异圈恰有一条公共边,且除了该公共边的端点外,任意两个非奇异圈没有其它交点.本文给出了图G的结构性质,建立了其最小特征值λ1(G)(以及相对应的特征向量)与某个简单图的代数连通度(以及Fiedler向量)之间联系,并应用上述联系证明了λ1(■)≤α(G),其中G是由G通过对其所有无向边定向而获得,α(■)为■的代数连通度.     

Bondy的泛圈图定理的改进

记G=(V,E)是简单图,1971年Bondy得到O re条件下的泛圈图的著名结果:若2连通n阶图G的不相邻的任两点x、y均有d(x) d(y)≥n,则G是泛圈图或G=Kn/2,n/2.这里进一步研究条件d(x) d(y)≥n-1,得到:若2连通n阶图G的不相邻的任两点x、y均有d(x) d(y)≥n-1,则G是泛圈图或G∈{K(Cn 1)/2∨G(n-1)/2,Kn/2,n/2}.本文作者得知最近国际著名权威专家Ho lton等人也得到完全相同的结果,但本证明更简捷.     

无爪图中不相邻子图P_4和K_1度和条件下的哈密尔顿连通性

研究子图的度和图的哈密尔顿性的关系,证明图G是一个n阶3-连通无爪图且最小度δ(G)≥4,如果图G中任意两个分别同构于P_4,K_1的不相邻子图H_1,H_2满足d(H_1)+d(H_2)≥n,则图G是哈密尔顿连通.     

Distribution of types of symmetry of tensors of high degree

The asymptotic distribution of tensors of degree N in symmetry types is studied in this paper.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 155, pp. 181–186, 1986.     

Estimates of stability of characterization of additive types of distributions

An estimate of stability of characterization of distribution types is obtained for the case of additive types. Under some conditions, the estimate has the order ε^1/3L(ε), where L(ε) is a slowly varying function. Proceedings of the Seminar on Stability Problems for Stochastic Models, Moscow, Russia, 1996, Part I.     

Study of the blow-up of solutions of systems of equations of hydrodynamic type

Mathematical Notes - We study the initial boundary-value problem for three-dimensional systems of equations of pseudoparabolic type. The system is similar to the Oskolkov system, but differs from...     

一类完全正则半群簇子簇格的性质

本文研究了完全正则半群簇的子簇格［Ｖ＋∩ＰＶ，Ｖ＋∩ＰＶ］的某些格运算性质，我们证明了簇Ｖ＋∩ＰＶ可分解为Ｖ与Ｖ＋∩ＰＶ的并；对任意完全正则半群簇Ｗ，有Ｗ∩（Ｖ∨Ｖ＋∩ＰＶ）＝（Ｗ∩Ｖ）∨（Ｗ∩Ｖ＋∩ＰＶ）．特别地，我们得到了等式Ｖ＋∩ＰＶ＝Ｖ成立的若干条件．     

Characterization of types of asymptotic discernibility of families of hypotheses

We give a characterization of the types of asymptotic discernibility of families of hypotheses in the case of hypothetical measures that are not, in general, mutually absolutely continuous. The case when the logarithm of the likelihood ratio admits an asymptotic expansion of the type of an expansion with local asymptotic normality is examined in detail. Examples are studied.Translated fromTeoriya Sluchainykh Protsessov, Vol. 15, pp. 64–71, 1987.     

Bases of the identities of products of certain varieties of groups

The following theorem is proved: The product of any variety of two-step solvable groups and a variety having a finite basis of identity relations has a finite basis of identity relations.Translated from Matematicheskie Zametki, Vol. 5, No. 1, pp. 137–144, January, 1969.     

Preservation of equivalence of derivations under reduction of depth of formulas

In this paper we consider derivations in the (&, )-fragment of the intuitionistic propositional calculus. As is known, replacement of any occurrence of a formula [F] in a sequent S by an occurrence of the formula [p], where p is a new propositional variable, with the simultaneous addition to the antecedent of the formula F p or p F depending on the sign of the occurrence of F in S, leaves the derivability unchanged. We give a proof of the fact that the natural extension of this transformation to derivations preserves the relation of equivalence of derivations, i.e., transformed derivations are equivalent if and only if the originals are equivalent. (Derivations are considered equivalent if certain of their normal forms coincide, or, what is the same, if their deductive terms coincide.) It is proved that by the iteration of this transformation, each derivation of an arbitrary sequent S can be transformed into a derivation of a sequent S, depending only on S, whose succedent is a variable, and in the antecedent there occur only formulas of the form a,a & b, a b,,(a b) c, a & b c, a (b & c), wherea, b, c are variables. Here if S is balanced, then S is also balanced. (A sequent is called balanced if each variable occurs in it no more than twice.) The familiar correspondence between certain concepts of the theory of categories and concepts of the theory of proofs allows one to assert that there has been constructed a univalent functor, mapping a free Cartesian closed category into itself.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 88, pp. 197–207, 1979.