关于笛卡尔乘积图的优美性

研究了笛卡尔乘积图Pm×Pn×P1的优美标号算法,并且给出了他们都是优美图的证明,同时推广了笛卡尔乘积图Pm×Pn是优美图的结论.     

K2,3 ∨ Pn的交叉数

已经确定的五阶图与路Pn的联图的交叉数较少,作者继续深化这方面的研究,得到了联图K2,3 V Pn与{K2,3+e}V Pn的交叉数为Z(5,n)+n+1.     

K_(1,1,m)□P_n的交叉数

借助拉链积运算,Cartesian积图K(1,m)□Pn和K(2,m)□Pn的交叉数最近被先后确定.本文进一步证明了:对于m,n≧1,有cr(K(1,1,m)□Pn)=2n[m/2][(m-1)/2]+(n-1)[m/2].结论的证明基于Bokal关于树的Cartesian积图交叉数的有关结果.另外,我们也给出了确定K(2,m)□Pn交叉数的一个简洁方法.     

Wm∨Pn的交叉数

在Klesc M给出的联图W_3 V P_n的交叉数的基础上,继续对联图Wm V Pn（m=4,5）的交叉数cr进行了研究,得到了cr（W3 V Pn）=Z（5,n）＋n＋「n/2＋1」以及cr（W5 V Pn）=Z（6,n）＋n＋3[n/2」＋1,n≥2.     

图Pn∨Km,n的全色数

对两个不交的图G,H,V(G∨H)=V(G)∪V(H),E(G∨H)=E(G)∪E(H)∪{uv u∈V(G),v∈(H)},G∨H称为G和H的联图.本文得到了路Pn与完全二部图Km,n的联图Pn∨Km,n的全色数.     

(邻接)树图的同构及平面性

树图是非常有用的一类图.本文刻画了(邻接)树图分别为Pn,Cn,Kn的图类并且讨论了(邻接)树图的平面性.     

路及其相关图的序列性

设G是一个简单图,在G上当且仅当两个顶点的距离为2时增加一条边,所得的图称为G的平方,记作G2;在G上每个顶点都增加一条悬挂边所得的图称为G的冠,记作I(G).设Pn是n个顶点的路,本文给出了I(Pn2)、I(Fn)、F2n徊和I(Fn2)的序列标号.     

k×n格图Pk×Pn的控制数

k×n格图Pk×Pn是长为k-1的路与长为n-1的路的积.我们证明了对充分大的k和n,Pk×Pn的控制数不超过[(k+2)(n+2)/5]-4.     

K1,m∨Pn的均匀全染色

对一个正常的全染色满足各种颜色所染元素数(点或边)相关不超过1时,称为均匀全染色,其所用最少染色数称为均匀全色数.就星K1,m与路Pn的联图K1,m∨Pn,得到了在m,n不同取值情况下的均匀全色数.     

梯子细分图Ln＊的排斥（下整）和数

（下整）和标号与排斥（下整）和标号是图的一种压缩表示．一个图G称为下整和图,若它同构于某个S Q＋的下整和图．图Pn×K2称为梯子．本文给出了梯子细分图Ln＊的定义,并确定了梯子细分图Ln＊的排斥（下整）和数．     

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.     

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.     

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.     

Estimate of growth of Lebesgue functions of linear methods of summation

Sufficient conditions are obtained in terms of matrix elements for the boundedness of Lebesgue functions of linear methods of summation of expansions in orthogonal systems of polynomial type.Translated from Matematicheskie Zametki, Vol. 6, No. 3, pp. 277–286, September, 1969.