变更图的直径

P(t,n)和C(t,n)分别表示在阶为n的路和圈中添加t条边后得到的图的最小直径；f(t,k)表示从直径为k的图中删去t条边后得到的连通图的最大直径．这篇文章证明了t≥4且n≥5时,P(t,n)≤(n-8)/(t 1) 3；若t为奇数,则C(t,n)≤(n-8)/(t 1) 3；若t为偶数,则C(t,n)≤(n-7)/(t 2) 3．特别地,「(n-1)/5」≤P(4,n)≤「(n 3)/5」,「n/4」-1≤C(3,n)≤「n/4」．最后,证明了：若k≥3且为奇数,则f(t,k)≥(t 1)k-2t 4．这些改进了某些已知结果．     

带弦圈的最小2宽直径

设k为正整数,G是简单k连通图.图G的k宽直径,dk(G),是指最小的整数ι使得对任意两不同顶点x,y∈V(G),都存在k条长至多为ι的内部不交的连接x和y的路.用C(n,t)表示在圈Gn上增加t条边所得的图.定义h(n,t):min{d2(C(n,t))}.本文给出了h(n,2)=[n/2].而且,给出了当t较大时h(n,t)的界.     

方程(dx/dt)=x~n sum from i=0 to (n-1) a_i(t)x~2的闭解的个数及存在的条件

本文给出方程n＝3时分别正好存在1个闭解，3个闭解，以及至少存在2个闭解的充分条件，并研究了这些闭解的稳定性．当n＝4且ai（t）（i＝0，1，2，3）为t的P次多项式时，文[1]曾猜想其时闭解重数的上界为max｛4，p＋3｝．本文举例指出，即使p＝3，闭解重数的上界也可以大于7．这说明该猜想不成立     

蕴含K4＋P2-可图序列的刻划

对于给定的图H,若存在可图序列π的一个实现包含H作为子图,则称π为蕴含H-可图的．Gould等人考虑了下述极值问题的变形：确定最小的偶整数σ（H,n）,使得每个满足σ（π）≥σ（H,n）的n项可图序列π=（d1,d2,…,dn）是蕴含H-可图的,其中σ（π）=∑di．本文刻划了蕴含K4＋P2-可图序列,其中K4＋P2是向致的一个顶点添加两条悬挂边后构成的简单图．这一刻划导出σ（K4＋P2,n）的值．     

变更图的直径

对于给定的正整数t和d(≥2),用F(t,d)和P(t,d)分别表示在所有直径为d的图和路中添加t条边后得到的图的最小直径,用f(t, d)表示从所有直径为d的图中删去t条边后得到的图的最大直径. 已经证明P(1, d)=(d)/(2), P(2,d)=(d 1)/(3)和P(3, d)=(d 2)/(4). 一般地,当t和d≥4时有(d 1)/(t 1)-1≤P(t, d)≤(d 1)/(t 1) 3. 在这篇文章中,我们得到F(t, f(t, d))≤d≤f(t, F(t, d))和(d)/(t 1)≤F(t, d)=P(t, d)≤(d-2)/(t 1) 3,而且当d充分大时,F(t, d)≤(d)/(t) 1. 特别地,对任意正整数k有P(t, (2k-1)(t 1) 1)=2k,当t=4或5,且d≥4时有(d)/(t 1)≤P(t, d)≤(d)/(t 1) 1.     

关于蕴含3Gl可图序列的极值问题

设σ（3C1，n）是具有下述性质的最小正偶数，每个项和至少为σ（3C1，n）的n项可图序列π都有一个实现含有长为3，4，…，l的圈，本文确定了当7≤t≤8且n≥l≥以及当l=9且n≥12时σ（2C1，n）的值。     

完全图上的尾达渗流方差的上界估计

本文考虑完全图G_n=([n], En)上的尾达渗流,边通过时间{X_e, e∈E_n}独立同分布. W_n表示经自回避路从顶点1到顶点n的最长时间,本文给出W_n的方差的次线性上界估计,即Var_(Wn)Cn/logn,其中C与n无关.另外,本文给出集中不等式P(|W_n-E(W_n)|t√n/logn)C_(1e)~(-C2t).     

关于奇数维流形上规范化的Ricci流的一个注记

要设（Mn，go）（n奇数）是紧Riemannian流形，λ（go）〉0，这里λ（go）是算子-4△go＋R（go）的第一特征值，R（go）是（Mn，go）的数量曲率．设以（Mn，go）为初值的规范化的Ricci流的极大解g（t）满足｜R（g（t））｜≤C和λ（对某个常数C一致成立）．我们证明这个解有子列收敛于一个Ricci收缩孤立子．进一步，当n=3时，条件fM ｜Rm（g（t））＋n/2dμt ≤ C可去．     

与一类算术函数关联的矩阵的行列式的下界

设f为一个算术函数，S=｛x1，…，xn｝为一个n元正整数集合．称S为gcd-封闭的，如果对于任意1≤i，j≤n，均有（xi，xj）∈S．以S=｛y1，…，ym）表示包含S的最小gcd-封闭的正整数集合．设（f｛xi,xj））表示一个n×n矩阵，其（i,j）项为f在xi与xj的最大公因子（xi,xj）处的值．设（f[xi,xj]）表示一个n×n矩阵，其（i,j）项为f在xi与xj的最小公倍数[xi.xj]处的值．本文证明了。(i)如果f∈Cs=｛f:(f*μ)(d)＞0，x∈S,d|x｝这里f*μ表示f与μ的Dirichlet来积，μ表示Mobius函数，那么并且（1）取等号当且公当S=（ii）如果f为乘法函数，并且1/f∈Ca,那么并且（2）取等号当且仅当S=。不等式（1）和（2）分别改进了Bourque与Ligh在1993年和1995年所得到的结果。＃且（1）＄＄95llttgS－g；（n）toilk＃ffed数，＃if｝。C。，W4并且问取等号当且仅当S一S．不等式（1）和（2）分别改进了Bourque与Li少在1993年和1995年所得到的结果     

7阶循环图C（7，2）Pn的笛卡儿积的交叉数

C（7，2）表示由圈C7（v1v2…v7v1）增加边vivi＋2（i=1，2，…，7，i＋2（mod7））所得的循环图．目前没有有关七阶图与路、星和圈的笛卡尔积交叉数的结果，我们证明了7阶循环图C（7，2）与路R的笛卡儿积的交叉数是8n．     

半无限圆柱体中半线性抛物线型问题不同的渐近估计

就变截面的半无限圆柱体,当横向边界值为0时,研究半线性抛物线型方程的初边值问题解的空间衰减.对其解的一个L2p横截面量,导出的2阶微分不等式表明,空间衰减呈D(exp｛-z2/[4(t+t0)]｝).同时导出了引起增长或衰减的1阶微分不等式.在爆破空间中得到增长情况下的上界,当衰减情况时,根据已知的数据,得到总能量的上界.     

具有偏差变元的双曲型微分方程组解的振动性

本文获得了双曲型方程组在齐次Neumann,Dirichlet和Robin边值条件下,所有解振动的充分条件.     

恰有t行含s圈正元的布尔方阵的幂敛指数

设Ｄｎ，ｓ（ｔ）是恰有ｔ行含ｓ圈正元的ｎ阶布尔方阵的集合，ｓｔｎ．本文给出了当ｓ＝１或ｓ为素数时Ｄｎ，ｓ（ｔ）中矩阵的幂敛指数的一个上界，证明了除ｔ＞ｎ－ｓ（ｎ－１）＋１／４－３／２，且ｓ与ｎ不互素外，这个上界可以达到，对Ｄｎ，ｓ（ｔ）中幂敛指数达到这个上界的矩阵作了部分刻划．     

连通图的度序列及连通平面图的低度点个数

美国数学家Bondy给出了一个非负整数序列为简单图的度序列的充要条件.本文对此进行了发展,证明了一个正整数序列为连通简单图的度序列的充要条件;然后在此基础上又探讨了平面图的低度点个数问题并定义了描述连通平面图的低度点个数的一个概念φ(n,m),并对某些低阶平面图求出了φ(n,m)的值.最后给出了φ(n,m)的上下界.     

恰有t行含s圈正元的布尔矩阵幂敛指数的估计

设D_n,s(t)是恰有t行含s圈正元的n阶布尔矩阵的集合,本文得到了当s为素数时D_n,s(t)中矩阵的幂敛指数的一个新上界。     

Thue inequalities with a small number of primitive solutions

Several upper bounds are known for the numbers of primitive solutions (x; y) of the Thue equation (1) j F(x; y) j = m and the more general Thue inequality (3) 0 < j F(x; y) j m. A usual way to derive such an upper bound is to make a distinction between "small" and "large" solutions, according as max( j x j ; j y j ) is smaller or larger than an appropriate explicit constant Y depending on F and m; see e.g. [1], [11], [6] and [2]. As an improvement and generalization of some earlier results we give in Section 1 an upper bound of the form cn for the number of primitive solutions (x; y) of (3) with max( j x j ; j y j )Y0 , wherec 25 is a constant and n denotes the degree of the binary form F involved (cf. Theorem 1). It is important for applications that our lower bound Y0 for the large solutions is much smaller than those in [1], [11], [6] and [4], and is already close to the best possible in terms of m. ByusingTheorem1 we establish in Section 2 similar upper bounds for the total number of primitive solutions of (3), provided that the height or discriminant of F is suficiently large with respect to m (cf. Theorem 2 and its corollaries). These results assert in a quantitative form that, in a certain sense, almost all inequalities of the form (3) have only few primitive solutions. Theorem 2 and its consequences are considerable improvements of the results obtained in this direction in [3], [6], [13] and [4]. The proofs of Theorems 1 and 2 are given in Section 3. In the proofs we use among other things appropriate modifications and refenements of some arguments of [1] and [6].     

Una generalizzazione di un teorema di B. Segre sui punti regolari rispetto ad una ellisse di un piano affine di Galois

Summary Let E be an ellipse in the affine plane AG(2, q), and let be the cyclic linear collineation group of order q + 1 fixing E. The points of E form a single cycle under . More generally, the points of E fall into cycles of the same size under the action of the subgroup (d) of F of order d. If Ed) is one such cycle of sixe d and t is a point not on E, let n_d (t) the number of chords of E(d) passing through t. An upper bound for n_d (t) is obtained, from which we deduce, in the case d=(q + l)/2, a theorem of B. Segre [8].     

Über Normminimale Steuerungen von L-Prozessen und Lineare Optimierung bei Normbeschränkten Steuerungen

This paper is devoted to two problems in the theory of optimal control for linear processes. The first one is characterized by a cost of the form ess sup {p(u(t)):t∈[a, b]}, whereby p denotes the distance function of a compact convex set C ° ?^m containing the origin as an interior point and u:[a, b] → ?^m represents the control. In the second problem the cost depends linear on the controls, which are limited by a bound for ess sup {p(u(t)):t∈[a, b]}. There will be proved two duality theorems leading to a method for the construction of optimal controls in the case of a strict convex C. For linear processes defined by piecewise analytic functions these controls are piecewise continuous.     

关于大偏差概率的一个界

研究得到了关于随机和S(t)=∑N(t)i=1Xi,t≥0大偏差的幂的一个界,其中(N(t))t≥0是一族非负整值随机变量,(Xn)n∈N是独立同分布的随机变量,其共同的分布函数是F与(N(t))t≥0独立.本结论是在假设分布函数F的右尾属于ERV族的情况下得到的.     

Optimal trajectories for aeroassisted,coplanar orbital transfer

This paper considers both classical and minimax problems of optimal control which arise in the study of aeroassisted, coplanar orbital transfer. The maneuver considered involves the coplanar transfer from a high planetary orbit to a low planetary orbit. An example is the HEO-to-LEO transfer of a spacecraft, where HEO denotes high Earth orbit and LEO denotes low Earth orbit. In particular, HEO can be GEO, a geosynchronous Earth orbit.The basic idea is to employ the hybrid combination of propulsive maneuvers in space and aerodynamic maneuvers in the sensible atmosphere. Hence, this type of flight is also called synergetic space flight. With reference to the atmospheric part of the maneuver, trajectory control is achieved by means of lift modulation. The presence of upper and lower bounds on the lift coefficient is considered.Within the framework of classical optimal control, the following problems are studied: (P1) minimize the energy required for orbital transfer; (P2) minimize the time integral of the heating rate; (P3) minimize the time of flight during the atmospheric portion of the trajectory; (P4) maximize the time of flight during the atmospheric portion of the trajectory; (P5) minimize the time integral of the square of the path inclination; and (P6) minimize the sum of the squares of the entry and exit path inclinations. Problems (P1) through (P6) are Bolza problems of optimal control.Within the framework of minimax optimal control, the following problems are studied: (Q1) minimize the peak heating rate; (Q2) minimize the peak dynamic pressure; and (Q3) minimize the peak altitude drop. Problems (Q1) through (Q3) are Chebyshev problems of optimal control, which can be converted into Bolza problems by suitable transformations.Numerical solutions for Problems (P1)–(P6) and Problems (Q1)–(Q3) are obtained by means of the sequential gradient-restoration algorithm for optimal control problems. The engineering implications of these solutions are discussed. In particular, the merits of nearly-grazing trajectories are considered.This research was supported by the Jet Propulsion Laboratory, Contract No. 956415. The authors are indebted to Dr. K. D. Mease, Jet Propulsion Laboratory, for helpful discussions. This paper is a condensation of the investigation reported in Ref. 1.