Hilbert空间H上正交射影对的一个注记

本文研究了Hilbert空间H上正则射影对的性质和结构，证明了酉算子V与正交射影对（P，Q）交织（i．e．，VP=QV，PV=VQ）的充分必要条件是dim（R（P）∩N（Q））=dim（N（P）∩R（Q）），给出了满足上述条件均酉算子V均一般形式．     

A Note on a Problem of M. S. Berger

In this paper, we discuss the problem concerning global and local structure of solutions of an operator equation posed by M. S. Berger. Let f : U (?)E→ F be a C1 map, where E and F are Banach spaces and U is open in E. We show that the solution set of the equation f(x)=y for a fixed generalized regular value y of f is represented as a union of disjoint connected C1 Banach submanifolds of U, each of which has a dimension and its tangent space is given. In particular, a characterization of the isolated solutions of the equation f(x) = y is obtained.     

无穷维系统中算子Riccati方程解的注记[英文]

本文采用正交投影技巧研究无穷维系统中算子Riccati方程的解,利用有限维空间中一序列来逼近该算子Riccati方程的解.并给出一个数值例子来说明我们的结论.     

E.Ghys猜想的注记

通过类比自治动力系统中拓扑熵指数收敛的定义,给出了非自治拓扑熵指数收敛的定义及非自治Lipschitz系统中E.Ghys猜想成立的充分条件与必要条件,推广了自治动力系统中的相关结论.     

关于伪微分方程的几点注记

本文通过对文［１］的研究,在最小文集样条小波变换及方程的探讨中,得到一些新的结论．     

环T=(R M N S)(θ,ψ)整体维数的估计

给出了环T=(R M N S)_(θ,ψ) 整体维数的一个估计:若T为左Noether环,且M为平坦右S模,则max{LGD(R),LGD(S)}≤LGD(T)≤1+max{LGD(S),1+PD(s_N)+LGD(R/MN)}.     

关于一些级数取整值问题的注记

利用Pell方程的理论,讨论了与广义Lucas数有关的一些级数的取整值问题.在一定条件下,解决了一些级数的取整值问题.     

关于对偶扩张代数有限维数的注记

没A是一个有限维代数，R为A的对偶扩张代数．本我们讨论R的有限维数findim R of R，证明了，在—般情况下findim R≠2findim A，这就回答了惠昌常教授所提的一个问题．     

二次函数域理想类数问题的一个注记

应用F_q[t]上的Pell方程这一初等方法重新证明一个已知的结果:实二次函数域F_q(t)(D~(1/2))理想类数为1时,D只能为P或QR,其中P,Q,R是F_q[t]中的首一不可约多项式且Q,R次数为奇数.     

A Note on a Boundary Value Problem

In this note, we prove that, for Robins boundary value problem, a unique solution exists if f_x(t, x, x), f_x(t, x, x), (t), and (t) are continuous, and f_x -(t), f_x -(t), 4(t) ² + ²(t) ++ 2(t), and 4(t) ² + ²(t) + 2(t).AMS Subject Classification (2000) 34B15     

关于一个奇异Dirichlet问题的注记

The Dirichlet problem to a second order differential equation with some singularities is studied. Some existence results are established to the problem which generalize some results recently obtained by D. O‘Regan by eliminating some superfluous constrains to the problem. Also, some new results have been proven which may provide more useful information for the study of the problem.     

A Note on a Queueing Optimization Problem

Van Ackere and Ninios (VN) used discrete-event simulation to determine the optimal strategies for a monopolist who operates a single-server facility and uses advertising to attract customers. Their model was based upon an M/E _r /1/K queue. In this paper, we re-analyze their model using queueing theory and numerical optimization. Our results allow the optimal strategies to be characterized more precisely, and this leads to a reassessment and modification of the conclusions reached by VN.     

关于A.Menezes和S.Vanstone一文的注记

1987年,R.Schoof对于有限域Fq上的椭圆曲线的同构类数目得出了一个公式.1990年,A.M enezes和S.V anstone对此当q为偶数时给出了一个初等证明.本文利用Burnside引理对q为偶数时给出一个更简单的证明.     

Note on a problem of M. Talagrand

Answering a question of M. Talagrand, we show that there is a fixed L with the following property. For positive integers and , if is the set of subgraphs of K_n containing at least copies of K_k, then there is a set of subgraphs of K_n such that (i) each member of contains a member of and (ii) (where means number of edges). © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 47, 663–668, 2015     

A Note on a Two-dimensional Dynamic Programming Problem

A two-dimensional dynamic programming problem is posed. By relaxing some of the restraints on the problem it is reduced to a standard dynamic programming problem. Results are quoted from a particular case study.     

关于离散 Schrodinger谱问题及其方程族的一个注记

对一个离散Schrodinger 谱问题, 给出与其相联系方程族的双 Hamilton 结构.同时构造了该族的一个 Darboux 变换.     

关于Pugh问题的一个注

该文构造了一个4次多项式Abelian方程, 其系数为次数≤3的三角多项式, 此方程有6个孤立的2 ∏-周期解.换句话说,作者构造了一个关于Pugh问题的例子, 其中当n=4时,K(n)=6.这个例子比Smale在文献[1]中提到的Nirenberg例子简单.     

A Note on a Packing Problem in Transitive Tournaments

Let TT_n be a transitive tournament on n vertices. We show that for any directed acyclic graph G of order n and of size not greater than two directed graphs isomorphic to G are arc disjoint subgraphs of TT_n. Moreover, this bound is generally the best possible. The research partially supported by KBN grant 2 P03A 016 18