一类商代数上的双-Frobenius代数结构

设C[X]为复数域上的一元多项式代数,I为n+1次Dickson多项式E_(n+1)(X)生成的C[X]的理想,C[X]/I为商代数.证明了商代数C[X]/I既是Frobenius代数,又是Frobenius余代数.进一步,该商代数在恒等对极下还是双-Frobenius代数.     

零多项式的性质与应用

各项系数均为零的多项式叫做零多项式。它的一条重要性质是 定理1 (零多项式性质定理)数域P上的n元多项式g(x_1,…x_n)为零多项式的充要条件是:存在无穷多的数a∈P,使得 g(x_1,…,x_(n-1),a)≡0 证明 必要性显然,下面证充分性。 当n=1时,由于有无穷多个a使g(a)=     

弱化希尔伯特第16问题及其研究现状

V.I.Arnold多次提出如下问题:对于给定的自然数n≥2,所有n次多项式1-形式,沿一切可能的m≥3次闭代数曲线族的阿贝尔积分的孤立零点的最大个数Z(m,n)=?由Poincare-Pontryagin定理可知,当阿贝尔积分不恒为零时,A(n)=Z(n+1,n)给出n次Hamilton系统在n次多项式扰动下从原有周期环域分支出极限环的最大个数,因此Arnold把这个问题称为弱化的希尔伯特第16问题.30多年来,对此问题的研究取得了一定进展,也遇到了很大困难.本文拟对这个问题和相关研究工作做一个粗浅的介绍.     

自正则Chung型重对数律的精确渐近性

设X,X1,X2,…为零均值、非退化、吸引域为正态吸引场的独立同分布随机变量序列.记Sn=n∑j=1Xj,Mn=maxk≤n|Sk|,V2n=n∑j=1X2j,n≥1.证明了当b＞-1时,limε↗∞ε-2(b+1)∞∑n=1(loglogn)b/nlognP(Mn/Vn≤ε√π2/8loglogn)=4/πΓ(b+1)∞∑k=0(-1)k/(2k+1)2b+3.     

具有与多项式复合齐次相容的项序

设K[x1,X2,…,xn]是域K上关于变量x1,x2,…,xn的多项式环,θ=(θ1,…,θn)是K[x1,x2,…,xn]的一组有序多项式.多项式复合θ是用θi代替xi的一种运算.我们说多项式复合θ与项序>齐次相容,是指对任意项P与q,p>q,deg p=deg q(→)polt(θ)>qolt(θ).怎样判断多项式复合与项序>是否齐次相容是困难的.将给出明确的判定方法.     

有限维张量积空间上的强可分算子

设F是一个域,a∈F~nF~m.若存在h∈F~m,k∈F~m,使得a=hk,则称a是可分的.空间F~nF~m上的线性算子A称为是强可分的,是指x∈F~nF~m,x可分Ax可分.本文证明了F~nF~n上的线性算子A是强可分的当且仅当存在F~n上的线性双射A_1与A_2,使得A=A_1A_2或A=A_1~T A_2;证明了F~nF~m(n≠m)上线性算子A是强可分的当且仅当存在F~n与F~m上的线性双射A_1与A_2,使得A=A_1A_2.最后,给出了可分算子、强可分算子和秩1保持映射之间的关系.     

GL(1+n,k)的Borel子群的么幂根的自同构

本文给出了当n≥4,K非二元域时,GL(1+n,K)的Borel子群的么幂根的自同构的结构;本文还在最后构造了两个反例,分别说明了当n=3和n≥4,K为二元域时,前述自同构不能有标准刻画.     

微分方程组(dX)/(dt)=AX+e~(αt)(cosβt·P_m~((1))(t)+sinβt·P_m~((2))(t))具有重特征根α+iβ时的特解结构定理及应用

对于一阶常系数非齐线性微分方程组dX/dt=AX+eαt(cosβt.P(1)m(t)+sinβt.P(2)m(t)),P(1)m(t),P(2)m(t)为次数不超过m关于实变量t的n维向量实值多项式,当n级实方阵A具有s≥1重特征根α+iβ时,给出了其特解珟X(t)的结构定理和计算方法,使求特解珟X(t)的积分运算转化为简单的代数运算.解决了利用计算机求特解珟X(t)的计算问题.     

关于n连贯多项式的几个结论

数集K上的多项式f（x）＋i（i＝0，1，…，n－1，整数n≥2）均在K上可约，则称f（x）为K上的n连贯多项式，二连贯多项式简称连贯多项式．自[1]提出n连贯多项式的概念以来，有较多文献在研究它．一般在复数集C，实数集R，有理数集Q，或整数集Z上研究n连贯多项式．本交给出关于”连贯多项式的n个结论（没有指明在哪个数集上时，指在任意数集上），这些结论都是由n连贯多项式的定义容易证明的，所以多未证明．定理1（1）复数域C上次数不小于2，或R上次数不小于3的多项式均为n连贯多项式；（2）ax2＋bx＋c（a＞0）在R上为n连贯多项式的充要…     

微分方程组dX/dt=AX+eαt(cosβt·P(1)m(t)+sinβt·P(2)m(t))具有重特征根α+iβ时的特解结构定理及应用

对于一阶常系数非齐线性微分方程组dX/dt=AX+ eαt (cosβt·P(1)m(t)+sinβt·P(2)m(t)).P(1)m(t),P(2)m(t)为次数不超过m关于实变量t的n维向量实值多项式,当n级实方阵A具有s≥1重特征根α+iβ时,给出了其特解(X)(t)的结构定理和计算方法,使求特解(X)(t)的积分运算转化为简单的代数运算.解决了利用计算机求特解(X)(t)的计算问题.     

拟周期系统的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)化为常系数的线性系统.     

Doubly stochastic graph matrices, II

If G is a graph on n vertices, its Laplacian matrix L(G) = D(G) - A(G) is the difference of the diagonal matrix of vertex degrees and the adjacency matrix. The main purpose of this note is to continue the study of the positive definite, doubly stochastic graph matrix (I_n + L(G))-¹= ω(G) = (w_ij). If, for example, w(G) = min w_ij, then w(G)≥0 with equality if and only if G is disconnected and w(G) ≤ l/(n + 1) with equality if and only if G = K_n. If i¦j, then w_ii ≥2wij, with equality if and only if the ith vertex has degree n - 1. In a sense made precise in the note, max w,, identifies most remote vertices of G. Relations between these new graph invariants and the algebraic connectivity emerge naturally from the fact that the second largest eigenvalue of ω(G) is 1/(1 + a(G)).     

Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term

In this paper, we establish the polynomial complexity of a primal-dual path-following interior point algorithm for solving semidefinite optimization(SDO) problems. The proposed algorithm is based on a new kernel function which differs from the existing kernel functions in which it has a double barrier term. With this function we define a new search direction and also a new proximity function for analyzing its complexity. We show that if q1 q2 1, the algorithm has O((q1 + 1) nq1+1/2(q1-q2)logn/ε)and O((q1 + 1)3q1-2q2+1/2(q1-q2)n~1/2 logn/ε) complexity results for large- and small-update methods, respectively.     

Markoff数性质的研究

1913年,Frobenius对Markoff方程a~2+b~2+c~2=3abc提了一个著名猜想:若abc是Markoff方程的正整数解,则a,b的值由最大的数c唯一确定.此猜想仍未得到解决.本文证明了:任给定正整数s_i,t_i,w,u,v=1,2),若(a_i,b_i,c)是Markoff方程的两组不同的正整数解,且a_ib_ic(i=1,2),则gcd(s_1a_1+s_2a_2+t_1b_1+t_2b_2+w,uc+v)≤K(uc+v)~(13/14),其中K是仅与s_i,t_i,w,u,v(i=1,2)有关的正数.     

Polynomials with palindromic and unimodal coefficients

Let f(q) = ar qr+ ··· + as qs, with ar = 0 and as = 0, be a real polynomial. It is a palindromic polynomial of darga n if r + s = n and ar+i = as-i for all i. Polynomials of darga n form a linear subspace Pn(q) of R(q)n+1 of dimension n2 + 1. We give transition matrices between two bases qj(1 + q + ··· + qn-2j), qj(1 + q)n-2j and the standard basis qj(1 + qn-2j)of Pn(q).We present some characterizations and sufficient conditions for palindromic polynomials that can be expressed in terms of these two bases with nonnegative coefficients. We also point out the link between such polynomials and rank-generating functions of posets.     

Sur les ensembles représentés par les partitions d'un entier n

Let n = n₁ + n₂ + … + n_j a partition Π of n. One will say that this partition represents the integer a if there exists a subsum n_il + n_i2 + … + n_il equal to a. The set (Π) is defined as the set of all integers a represented by Π. Let be a subset of the set of positive integers. We denote by p( ,n) the number of partitions of n with parts in , and by (( ,n) the number of distinct sets represented by these partitions. Various estimates for ( ,n) are given. Two cases are more specially studied, when is the set {1, 2, 4, 8, 16, …} of powers of 2, and when is the set of all positive integers. Two partitions of n are said to be equivalent if they represent the same integers. We give some estimations for the minimal number of parts of a partition equivalent to a given partition.     

退化图中的子图计数问题研究

令G表示n个顶点的图,如果G的每个子图中都包含一个度至多为k的顶点,则称G为k-退化图.令N(G,F)表示G中F子图的个数.主要研究了k-退化图中完全子图和完全二部子图的计数问题,给出了计数的上界以及相应的极图.首先,证明了Ν(G,K_t)≤(n-k)(k t-1)+(k t).其次,如果s,t≥1,n≥k+1且s+t≤k,我们证明了Ν(G,K_s,t)≤{(k s)(n-s s)-1/2(k s)(k-s s),t=s,(k s)(n-s t)+(k t)(n-t s)-(k t)(k-t s),t≠s.此外,还研究了在最大匹配和最小点覆盖为给定值的情况下,图G中的最大边数.记v(G),K(G)分别为图G的最大匹配数和最小点覆盖.证明了当v(G)≤k,K(G)=k+r且n≥2k+2r²+r+1时,有e(G)≤(k+r+1 2)+(k-r)(n-k-r-1).     

Maximal inequalities for a continuous semimartingale

Let X =( X t ) t S 0 be a continuous semimartingale given by d X t = f ( t ) w ( X t )d d M ¢ t + f ( t ) σ ( X t )d M t , X 0 =0, where M =( M t , F t ) t S 0 is a continuous local martingale starting at zero with quadratic variation d M ¢ and f ( t ) is a positive, bounded continuous function on [0, X ), and w , σ both are continuous on R and σ ( x )>0 if x p 0. Denote X 𝜏 * =sup 0 h t h 𝜏 | X t | and J t = Z 0 t f ( s ) } ( X s )d d M ¢ s ( t S 0) for a nonnegative continuous function } . If w ( x ) h 0 ( x S 0) and K 1 | x | n σ 2 ( x ) h | w ( x )| h K 2 | x | n σ 2 ( x ) ( x ] R , n >0) with two fixed constants K 2 S K 1 >0, then under suitable conditions for } we show that the maximal inequalities c p , n log 1 n +1 (1+ J 𝜏 ) p h Á X 𝜏 * Á p h C p , n log 1 n +1 (1+ J 𝜏 ) p (0< p < n +1) hold for all stopping times 𝜏 .     

Lefschetz type theorem

Summary Let X=Cⁿ / be a toroidal group of rank =n+m. If X is compact, then it is a complex torus. In the compact case, we have the theorem of Lefschetz which asserts that if L is a positive line bundle over a complex torus X, then gives an embedding of X for any integer l3. This theorem is generalized to noncompact toroidal groups in this paper. In fact, we prove the following: (I) In the case of rank =n+1, H⁰(X, (Ll)) gives an embedding of a toroidal group X for l3, if L is positive. (II) In the case of rank =n+m, 2m相似文献   

On the form of homomorphisms into the differential group Ls 1 and their extensibility

Let L_s ¹ (s ∈ ?) be the s-th differential group, that is the set {(x1,…,x_s): x₁ ≠ 0, x_n ∈ K, n =1,2,…,s} (K ∈ {?,?}) together with the group operation which describes the chain rules (up to order s) for C^s-functions with fixed point 0. We consider homomorphisms Φ_s, Φ_s = (f₁,…,f_s) from an abelian group (G,+) into L_s ¹ such that f₁ = 1, f₂ = … = f_p+2 = 0, 0_p+2 ≠ 0 for a fixed, but arbitrary p ≥ 0 such that p + 2 ≤ s (then f_p+2 is necessarily a homomorphism from (G, +) to (K, +). Let l ∈ ? or l = ∞. We present a criterion for the extensibility of Φ_s to a homomorphism Φ_s+l from (G, +) to L_s+1 ¹ (L_∞ ¹, if l = ∞), by proving that such an extension (continuation) exists iff the component functions f_n of Φ_s with s - p ≤ n ≤ min(s - p + l - 1,s) are certain polynomials in f_P+2 (see Theorem 1). We also formulate the problem in the language of truncated formal power series in one indeterminate X over K. The somewhat easier situation f ₁ ≠ 1 will be studied in a separate paper.