关于轴对称Navier-Stokes方程正则性的一个注记

建立了一个关于轴对称不可压Navier-Stokes系统的正则性准则.证明了如果局部的轴对称光滑解u满足‖ωr‖_{Lα1((0,T);Lβ1)}+‖ωθ/r‖_{Lα2((0,T);Lβ2)}<∞,其中2/α₁+3/β₁≤1+3/β₁,2/α₂+3/β₂≤2和β₁≥3, β₂>3/2,那么此强解将保持光滑性直至时刻T.     

关于Neyman-Pearson基本引理的几个注记

本文探讨了Neyman-Pearson基本引理.通过论证总体参数θ只有θ₀或θ₁两种可能时最优检验功效函数的唯一性,得到了两种假设T₁:θ=θ₀←→θ=θ₁和T₂:θ=θ₁←→θ=θ₀各自对应最优检验的两类错误概率可以互换的结论.     

β-变换中一致丢番图逼近问题的维数理论

令T_β(其中β> 1)为定义在区间[0,1)上的β-变换.该文研究了T_β中轨道具有一致丢番图逼近性质的点组成的集合的分形维数,具体而言,对两个给定的正函数ψ₁、ψ₂:N→R⁺,定义L(ψ₁):={x∈[0,1]:T_βⁿ x <ψ₁(n),对无穷多个n∈N},u(ψ₂):={x∈[0,1]:?N>>1,?n∈[0,N],s.t.T_βⁿ x <ψ₂(N)},其中>>表示足够大.该文计算了集合L(ψ₁)∩u(ψ₂)的豪斯道夫维数.作为推论,该文还得到了集合u(ψ₂)的豪斯道夫维数.该文将文献[4]中的结果进行了一般化,文献[4]中的函数ψ₁,ψ₂仅仅是指数函数.     

Spectrum and Spectral Singularities of a Quadratic Pencil of a Schr?dinger Operator with Boundary Conditions Dependent on the Eigenparameter

In this paper, we consider the following quadratic pencil of Schr?dinger operators L(λ)generated in L²(R⁺) by the equation ■ with the boundary condition ■ where p(x) and q(x) are complex valued functions and α₀, α₁, β₀, β₁ are complex numbers with α₀β₁-α₁β₀≠0. It is proved that L(λ) has a finite number of eigenvalues and spectral singularities,and each of them is of a finite multiplicity...     

拟周期系统的Floquet理论

在这篇文章,我们对拟周期系统dx/dt=A(ω₁t,ω₂t.…,ω_mt)x (0.1)建立了Floquet理论.其中n×n方阵A(u₁,u₂,…,u_m)是u₁,u₂,…,u_m以2π为周期的周期方阵,同时假定A(u₁,u₂,…,u_m)∈Cτ,τ=(N+1)τ₀,τ₀=2(m+1),N=1/2n(n+1).我们定义了(0.1)的特征指数根β₁,β₂,…,β_n,假设下式成立:其中K(ω),K(ω,β)>0,k_μ,i_v是整数,k₁,k₂…,k_m不全为零:i2=-1.那末有拟周期线性变换,把(0.1)化为常系数的线性系统.     

PROPERTIES OF SOLUTIONS TO A HARMONIC-MAPPING TYPE EQUATION WITH A DIRICHLET BOUNDARY CONDITION

In the present paper, we consider the problem ■ where β₁, β₂ > 0 and β₁ + β₂ < 1, and ? is a convex domain in Rⁿ. The existence, uniqueness,regularity and (2-β₂)/(1-β₁-β₂)-concavity of the positive solutions of the problem(0.1) are proven.     

一类四阶边值问题的多解结果

本文研究一类弹性梁方程边值问题y(1)-α₁y+β₁y"+g(x,y,y")=e,02(0.1),而g:[0,1]×R×R→R为连续有界函数,特征对(α₁,β₁)满足α₁+(0+0.5)2π2β₁=(0+0.5)4π4及α₁+(k+0.5)2π2β₁≠(k+0.5)4π4,?k∈N     

圆形杂质对裂纹扩展的影响

在单轴拉伸载荷作用下，运用分布位错方法对无限大平面内含有一个裂纹和一个任意方向的杂质问题进行求解，得到了裂纹尖端的应力强度因子、应力场以及应变能密度.利用最小应变能密度因子准则来判断裂纹扩展方向.结果显示:软杂质对裂纹尖端应力强度因子、应变能密度和应力场有增强作用，而硬杂质则具有屏蔽作用.在 -30°<θ<30°范围内，杂质对裂纹扩展方向的影响较小，而在 -90°<θ<-30°或30°<θ<90°范围内，杂质对裂纹扩展方向的影响较大.软杂质对裂纹扩展有吸引作用，而硬杂质具有排斥作用.     

循环准整环的构造

研究了一类特殊循环环即循环准整环的构造,得到的主要结论有:1)所有的无限循环准整环就是M~0和 1)的标准分解式为n=p₁^α₁p₂^α₂…p_s^α_s,ⅰ)若s=1,则n阶循环准整环共有α₁+1个,它们是dZ/ndZ,其中d=p₁^β₁,0≤β₁≤α₁;ⅱ)若s>1,则n阶循环准整环共有α₁α₂…α_s个,它们是dZ/ndZ,其中d=p₁^β₁p₂^β₂…p_s^β_s,...     

非线性分数次边值问题改进的ADM解法(英文)

We use the modified Adomian decomposition method（ADM） for solving the nonlinear fractional boundary value problem {D（^α₀） + u（x） = f（x, u（x））, 0 < x < 1, 3 < α≤ 4 u（0） = α₀ , u’’ （0） = α₂ u（1） = β₀ , u’’（1） = β₂} （1） where D（₀^α）+u is Caputo fractional derivative and α₀,α₂,β₀,β₂ is not zero at all,and f:[0,1]×R→ R is continuous.The calculated numerical results show reliability and efficiency of the algorithm given.The numerical procedure is tested on linear and nonlinear problems.     

Changing cofinalities and collapsing cardinals in models of set theory

If a˜cardinal κ₁, regular in the ground model M, is collapsed in the extension N to a˜cardinal κ₀ and its new cofinality, ρ, is less than κ₀, then, under some additional assumptions, each cardinal λ>κ₁ less than cc(P(κ₁)/[κ₁]^<κ₁) is collapsed to κ₀ as well. If in addition N=M[f], where f : ρ→κ₁ is an unbounded mapping, then N is a˜|λ|=κ₀-minimal extension. This and similar results are applied to generalized forcing notions of Bukovský and Namba.     

Ordinal notations and well-orderings in bounded arithmetic

This paper investigates provability and non-provability of well-foundedness of ordinal notations in weak theories of bounded arithmetic. We define a notion of well-foundedness on bounded domains. We show that T₂¹ and S₂² can prove the well-foundedness on bounded domains of the ordinal notations below ₀ and Γ₀. As a corollary, the class of polynomial local search problems, PLS, can be augmented with cost functions that take ordinal values below ₀ and Γ₀ without increasing the class PLS.     

自伴标准算子代数上强保持k-斜交换性映射的刻画

令H是维数大于2的复Hilbert空间,A是H上自伴标准算子代数.对于给定的正整数k≥1,H上算子A与B的k-斜交换子递推地定义为_*[A,B]_k=_*[A,_*[A,B]_k-1],其中_*[A,B]₀=B,_*[A,B]₁=AB-BA^*.设k≥4,φ是A上的值域包含所有一秩投影的映射.本文证明了φ满足_*[φ（A）,φ（B）]_k=_*[A,B]_k对任意A,B∈A都成立的充分必要条件是φ（A）=A对任意A∈A都成立,或φ（A）=-A对任意A∈A都成立.当k是偶数时后一情形不出现.     

Error bounds on the power method for determining the largest eigenvalue of a symmetric, positive definite matrix

Let A be a positive definite, symmetric matrix. We wish to determine the largest eigenvalue, λ₁. We consider the power method, i.e. that of choosing a vector v₀ and setting v_k = A^kv₀; then the Rayleigh quotients R_k = (Av_k, v_k)/(v_k, v_k) usually converge to λ₁ as k → ∞ (here (u, v) denotes their inner product). In this paper we give two methods for determining how close R_k is to λ₁. They are both based on a bound on λ₁ − R_k involving the difference of two consecutive Rayleigh quotients and a quantity ω_k. While we do not know how to directly calculate ω_k, we can given an algorithm for giving a good upper bound on it, at least with high probability. This leads to an upper bound for λ₁ − R_k which is proportional to (λ₂/λ₁)^2k, which holds with a prescribed probability (the prescribed probability being an arbitrary δ > 0, with the upper bound depending on δ).     

Sometimes slow growing is fast growing

The slow growing hierarchy is commonly defined as follows: G₀(x) = 0, G_x−1(x) := G_x(x) + 1 and G_λ(x) := G_λ[x](x) where λ<₀ is a limit and ·[·]:₀∩ Lim × ω → ₀ is a given assignment of fundamental sequences for the limits below ₀. The first obvious question which is encountered when one looks at this definition is: How does this hierarchy depend on the choice of the underlying system of fundamental sequences? Of course, it is well known and easy to prove that for the standard assignment of fundamental sequence the hierarchy (G_x)_x<0 is slow growing, i.e. each G_x is majorized by a Kalmar elementary recursive function.

It is shown in this paper that the slow growing hierarchy (G_x)_x<0 — when it is defined with respect to the norm-based assignment of fundamental sequences which is defined in the article by Cichon (1992, pp. 173–193) — is actually fast growing, i.e. each PA-provably recursive function is eventually dominated by G_x for some <₀. The exact classification of this hierarchy, i.e. the problem whether it is slow or fast growing, has been unsolved since 1992. The somewhat unexpected result of this paper shows that the slow growing hierarchy is extremely sensitive with respect to the choice of the underlying system of fundamental sequences.

The paper is essentially self-contained. Only little knowledge about ordinals less than ₀ — like the existence of Cantor normal forms, etc. and the beginnings of subrecursive hierarchy theory as presented, for example, in the 1984 textbook of Rose — is assumed.