正则m叉树T的S(n)={Ki:1≤i≤n}-因子数的递归公式

在正则m叉树T中,删除K2及端点关联边,通过所得子正则m叉树中分枝点、叶数和m之间内在联系,本文导出正则m叉树T的S(n)={Ki:1≤i≤n}-因子数递归公式.特别当m=2时,正则2叉树递归公式为:At=A2t/2+2A2t/4At/2,t为正则2叉树T的叶数.     

关于某类带参数λ的四阶非对称微分算子性状之研究

考虑如下具有振动背景的带参数λ的四阶非对称微分算子A_λ及其一般化?_λ:A_λ:(K_(i,j),‖·‖_H⁴)→(A_λK_(i,j),‖·‖_L²),0≤iλ:(K_(i,j),‖·‖_H⁴)→(A相似文献   

三角域上Bernstein多项式的Lipschitz常数

设T是平面上以T₁,T₂,T₃为顶点的三角形,f(p)为定义在T上的函数,称Bⁿ(f,P):=(?)f(i/n,j/n,k/n)B_i,j,kⁿ(P),为f的n次Bernstein多项式,这儿B_i,j,kⁿ(P):(n!)/(i!j!k!)uⁱv^jω^k是Bernstein基函数,(u,v,w)是P关于T的重心坐标。 B.M.Brown等人对单变量的Bernstein多项式证明了如果f∈Lip_Aλ,0<λ≤1,则对所有的n,都有B^α(f,x)∈Lip_Aλ。本文的目的是对定义在三角域T:{(x,y):x≥0,y≥0,x+y≤1}上的Bernstein多项式证明了类似的结果: 设f(P)∈Lip_Aλ,0<λ≤1,则对所有的n,Bⁿ(f,P)∈Lip_(2^1/2λA)λ,并且,在一定意义上,常数2^1/2λA是最好的。 上述结果对于任意的锐角或直角三角形T,也是成立的。 最后还指出,当T可为钝角三角形时,则不存在同一常数C,使对所有的n和任意三角形T,有Bⁿ(f,P)∈Lip_cλ。     

关于P2(C)全纯曲线唯一性问题的注记*

本文讨论P²(C)中全纯曲线相交处于次一般位置超平面的唯一性.设f₁, f₂, · · · , f_λ为P²(C)中线性非退化的全纯曲线,H₁, H₁, · · · , H_q为P²(C)上处于m-次一般位置的超平面,满足A_j :f₁^-1(H_j) = · · · =f_λ^-1(H_j) (1 ≤ j ≤ q)且A_i ∩ A_j = ?(i = j).假设存在整数l (2 ≤ l ≤ λ),使得f_j1(z) ∧ f_j2(z) ∧ · · · ∧ f_jl(z) = 0 (z ∈ A_j)对任意l个指标1 ≤ j₁ < j₂ < · · · < j_l < λ成立.那么当 q > 2λ/λ-l+1 + 3/2 m时, f₁ ∧ · · · ∧ f_λ ≡ 0.关键技术是第二基本定理中不等式改进为: ∥(q - 3m/2)T_ft(r)≤ Pjq=1N²(f_t,H_j )(r, 0) + o(T_ft(r))(1 ≤ t ≤ λ).     

n阶泛函微分方程边值问题

本文研究下列n阶RFDE边值问题:x⁽ⁿ⁾(t)=f(t,x_t,x(t),x′(t),…,x^(n-1)(t)),　t∈［0,T ］,x(t)=φ(t),t∈［-r,0］;x′(0)=η,x″(0)=η₂,…,x^(n-2) (0)=η_n-2,x^(j)(T)=A,其中j∈I={0,1,2,…,n-1},得到了解的存在性和唯一性新的结果.     

某些K2OF的结构

本文研究二次数域F=Q(d^1/2)的K₂O_F结构,其中d≡-3mod9和d≠-3.找到了关于F=Q((-21)^1/2)的K₂O_F的3阶元和F=Q((15)^1/2)的K₂O_F的生成元.推广了Bass和Tate的一个定理和给出了F=Q((29)^1/2)的K₂O_F的结构以及sL_n(O_F)(n≥3)的表示关系.     

解在QK 型及Dirichlet 型空间中的线性微分方程

对于单位圆盘上系数函数是解析函数的复微分方程
f⁽ⁿ⁾+A_n-1(z)f^(n-1)+…+A₁(z)f''+A₀(z)f=0,
给出了方程的系数函数和解函数之间的关系, 即当系数函数A_j 满足给定的条件时, 方程的所有解属于Q_K型空间和Dirichlet 型空间.     

由分数次导数所确定的L2(T)中的一元周期函数类在Lq(T)中的相对宽度

作者研究了相对宽度K_n(W₂^α(T), MW₂^β(T), L₂(T)), T=[0,2π], 确定了使等式K_n(W₂^α(T), MW₂^β(T), L₂(T))=d_n(W₂^α(T), L₂(T))成立的最小M值, 得到了相对宽度K_n(W₂^α(T), W₂^α(T), L_q(T))的渐近阶, 其中α≥β>0, 1≤q≤∞, K_n(., ., L_q(T)) 和 d_n(., L_q(T))分别表示Kolmogorov意义下L_q(T)尺度下的相对宽度和宽度, MW_p^α(T), 1≤ p≤∞, 表示有如下卷积表达式的2π 周期函数类, f(t)=c+(B_α* g)(t),c∈ R, B_α*g 表示 B_α 和g 的卷积, g∈L_p(T) 满足∫₀^2πg(τ)dτ=0 和||g||_p≤M, B_α∈ L₁(T) 有如下Fourier展开: B_α(t)=1/2π∑' _{k∈ Z}(ik)^-αe^ikt,∑^'表示去掉 k=0的项.     

关于张量最小长度的一些结果

本文根据不同重数张量空间之间的关系,采用对张量空间分划的方法,得到了张量空间中张量达到最小长度的一个充分条件和一个必要条件.此外,本文还讨论了最小长度的上界K_max,得到了如下估计:对n维向量空间上的m阶张量空间,n^[m/2]≤K_max≤n^m-1。     

二阶抛物方程组解的Lp-正则性和Hölder连续性

在可控和自然增长条件下,非线性抛物组 u''_t-D_aA_i^a(x,t,u,Du)= B_i(x,t,u,Du),i=1,…,N,(x,t)∈Q之解。u∈L²(0,T;H¹(Ω,R^N))∩L^∞(0,T;L²(Ω,R^N))(或∩L^∞(Q,R^N))的空间导数D_au事实上属于L_loc^p(Q,R^N),p>2;拟线性抛物组 u''_t-Dα[A_ij^αβ(x,t,u)D_βu^j+a_j^a(x,t,u)]=B_i(x,t,u,Du),i=1,…,N的每一个解都在一开集 Q₁?Q上 Holder连续,且H^n+2-p(Q\Q₁)=0;若当j>i时A_ij^αβ=0,且B_i(x,t,u,p)关于|p|的增长阶小于2,则Q₁=Q;若A_ij^αβ和a_i^a都Holder连续,则D_au也在Q₁上 Holdler连续.     

單葉函數的係數(Ⅱ)

<正> §1.引言 在[1]文中,作者曾經對於單葉函數的係數進行討論,在本文中,將繼續之.在本文中所用的記號與[1]相同,不再一一重複定義,例如:記在單位圓|z|<1中k次對稱正则單葉函數的全體為S_k,特別記S_1,=S等等.     

Wallis公式的精致化

证明了∫_0~(π/2)sin~αxdx(α→+∞)渐进展开式的存在性,并给出了展开式系数的递推公式,进而得到了((2n-1)!!)/((2n)!!)/((2n)!!)的渐进展开式和精致化的Wallis公式.在精致化的Wallis公式中取到1/n~m项,对π的逼近精度可达O(1/(n~(m+1))),比原来的Wallis公式的精度大为提高.     

On a cubic-quintic Ginzburg-Landau equation with global coupling

We study standing wave solutions in a Ginzburg-Landau equation which consists of a cubic-quintic equation stabilized by global coupling

We classify the existence and stability of all possible standing wave solutions.

     

一族特殊的星像函數

<正> 設函數w=f(z)在單位圓|z|<1中是正則的.f(0)=0,f′(0)=1.假如f(z)是單葉的,那末w=f(z)映照|z|<1於w平面上的單葉的像D_f.記這種單葉函數的全體為S.若D_f以原點w=0為星形中心,就稱f(z)是|z|<1中的星     

An exact and polynomial distance-based algorithm to reconstruct single copy tandem duplication trees

The problem of reconstructing the duplication tree of a set of tandemly repeated sequences which are supposed to have arisen by unequal recombination, was first introduced by Fitch (1977), and has recently received a lot of attention. In this paper, we place ourselves in a distance framework and deal with the restricted problem of reconstructing single copy duplication trees. We describe an exact and polynomial distance based algorithm for solving this problem, the parsimony version of which has previously been shown to be NP-hard (like most evolutionary tree reconstruction problems). This algorithm is based on the minimum evolution principle, and thus involves selecting the shortest tree as being the correct duplication tree. After presenting the underlying mathematical concepts behind the minimum evolution principle, and some of its benefits (such as statistical consistency), we provide a new recurrence formula to estimate the tree length using ordinary least-squares, given a matrix of pairwise distances between the copies. We then show how this formula naturally forms the dynamic programming framework on which our algorithm is based, and provide an implementation in O(n³) time and O(n²) space, where n is the number of copies.     

Regular n-simplices in R~n with vertices in Z~n

In this paper the Ⅰ and Ⅱ regular n-simplices are introduced. We prove that the sufficient and necessary conditions for existence of an Ⅰ regular n-simplex in Rn are that if n is even then n = 4m(m + 1), and if n is odd then n = 4m + 1 with that n + 1 can be expressed as a sum of two integral squares or n = 4m - 1, and that the sufficient and necessary condition for existence of a Ⅱ regular n-simplex in Rn is n = 2m2 - 1 or n = 4m(m+1)(m 6 N). The connection between regulars-simplex in Rn and combinational design is given.     

Asymptotic Behavior of Solutions of Some Linear Difference Equations with Oscillatory Decreasing Coefficients

We investigate the asymptotic behavior of solutions of the system x ( n +1)=[ A + B ( n ) V ( n )+ R ( n )] x ( n ), n S n 0 , where A is an invertible m 2 m matrix with real eigenvalues, B ( n )= ~ j =1 r B j e i u j n , u j are real and u j p ~ (1+2 M ) for any M ] Z , B j are constant m 2 m matrices, the matrix V ( n ) satisfies V ( n ) M 0 as n M X , ~ n =0 X Á V ( n +1) m V ( n ) Á < X , ~ n =0 X Á V ( n ) Á 2 < X , and ~ n =0 X Á R ( n ) Á < X . If AV ( n )= V ( n ) A , then we show that the original system is asymptotically equivalent to a system x ( n +1)=[ A + B 0 V ( n )+ R 1 ( n )] x ( n ), where B 0 is a constant matrix and ~ n =0 X Á R 1 ( n ) Á < X . From this, it is possible to deduce the asymptotic behavior of solutions as n M X . We illustrate our method by investigating the asymptotic behavior of solutions of x 1 ( n +2) m 2(cos f 1 ) x 1 ( n +1)+ x 1 ( n )+ a sin n f n g x 2 ( n )=0 x 2 ( n +2) m 2(cos f 2 ) x 2 ( n +1)+ x 2 ( n )+ b sin n f n g x 1 ( n )=0 , where 0< f 1 , f 2 < ~ , 1/2< g h 1, f 1 p f 2 , and 0< f <2 ~ .     

單葉函數的係數與開始多項式

<正> 以fk(z)表單位圓內的K次對稱單葉全純函數,亦即fk(z)=z+a_I~((k))z~(k+1)+a_2~((k))z~(2k+1)+…,|z|<1.以S_k表此種函數之全體.特別,書S以代S_1.     

正多边形的最优分割问题

记平面边长为1的正m边形为S_m,将S_m剖分成n块:S_(m1),S_(m2),…,S_(mn),这样的剖分称S_m的n剖分,并以T(m,n)表示.以d_(mi)表示区域S_(mi)(i=1,2,…,n)的直径(即区域S_(mi)任意两点之间距离的最大者).记D(m,n)=max{d_(m1),d_(m2),…,d_(mn)}及Ψ(m,n)=■{D(m,n)}.本文将估计Ψ(m,n)的上下界.证明Ψ(6,3)=3/2,Ψ(6,4)=3-3~(1/2),Ψ(6.6)=1,Ψ(6,7)=3/2,估计Ψ(6,n)的渐进性.提出几个猜想.     

一类特殊的有限循环环

证明了一类n阶(n=P_1P_2…p_m,p_i(i=1,2,…,m)互异为素数)环是有限循环环,并讨论了他们的结构及相关性质,最后给出了这类n阶环有零因子或有子域的充要条件.主要结果:P_1P_2…P_m阶环共有2^m个,它们是(p_(1m个,它们是(p_(1^k_1) p_(2k_1) p_(2^k_2)…p_(mk_2)…p_(m^k_m)Z)/(p_(1k_m)Z)/(p_(1^k_1+1)p_(2k_1+1)p_(2^k_2+1)…p_(mk_2+1)…p_(m^k_m+1)Z),其中k_i=0或1,1≤i≤m;阶是n=P_1P_2…p_m的环R可唯一分解为m个素数阶理想的直和,即R=〈α〉=(?);含pi(1≤i≤m)阶子域的P_1P_2…P_m阶环共有2k_m+1)Z),其中k_i=0或1,1≤i≤m;阶是n=P_1P_2…p_m的环R可唯一分解为m个素数阶理想的直和,即R=〈α〉=(?);含pi(1≤i≤m)阶子域的P_1P_2…P_m阶环共有2^(m-1)个,它们是p_(1(m-1)个,它们是p_(1^k_1) p_(2k_1) p_(2^k_2)…p_(mk_2)…p_(m^k_m)Z)/(p_(1k_m)Z)/(p_(1^k_1+1)p_(2k_1+1)p_(2^k_2+1)…p_(mk_2+1)…p_(m^k_m+1)Z),其.中k_i=0,k_j=0或1,1≤j≤m,j≠i.