布尼雅可夫斯基不等式的推广

定理:不等式 (sum from i=1 to m(a_(1i) a_(2i)…a_(ni)))~n≤≤sum from i=1 to m(a_(1i))~n sum from i=1 to m(a_(2i))~n…sum from i=1 to m(a_(ni))~n對於任意自然數n都成立,其中a_(ki)為正數(K=1,2,…,n,i=1,2,…,m). 證明: 設 A_K~n=sum from i=1 to m(a_(Ki))~n (K=1,2,…,n), x_(Ki)=a_(Ki)/A_K,(K=1,2,…,n i=1,2,…,m)則從n侗正數的幾何平均值小於或等於其算術平均值這個結果可得 x_(1i)x_(2i)…x_(ni)≤((x_(1i))~n+(x_(2i))~n+…+(x_(ni))~n)/n由此更推得a_(1i)a_(2i)…a_(ni)=A_1A_2…A_n(x_(1i)x_(2i)…x_(ni)≤     

常系数非齐线性递推式的解的显式表示

本文给出常系数非齐线性递推式(?)的解的显式表达式 H(m)=sum from i=0 to k-1(sum from j=i to k-1 b_ja_(k-j+i))D_(m-k-i)+sum from i=0 to m-k D_if(m-i)(m≥k)其中D_m=sum x_1+2x_2+…+kx_k=m x_j≥0(i=1,2,…,k)(?)a_1~x1a_2~x2…a_k~xk.     

和图、整和图与模和图的几个结果

Let N denote the set of positive integers. The sum graph G^＋（S） of a finite subset S belong to N is the graph （S, E） with uv ∈ E if and only if u ＋ v ∈ S. A graph G is said to be a sum graph if it is isomorphic to the sum graph of some S belong to N. By using the set Z of all integers instead of N, we obtain the definition of the integral sum graph. A graph G = （V, E） is a mod sum graph if there exists a positive integer z and a labelling, λ, of the vertices of G with distinct elements from {0, 1, 2,..., z - 1} so that uv ∈ E if and only if the sum, modulo z, of the labels assigned to u and v is the label of a vertex of G. In this paper, we prove that flower tree is integral sum graph. We prove that Dutch m-wind-mill （Dm） is integral sum graph and mod sum graph, and give the sum number of Dm.     

重截断和的渐近分布

设{X_n,n≥1}是i.i.d.随机变量序列,X_n,1≤…≤X_(n,n)是X_1,…,X_n的次序统计量。又设k_(n,1,) k_(n,2)是满足条件1≤k_(n,1)相似文献   

一个数论函数的倒数和

Let p(n) denote the largest prime factor of an integer n≥2, and let Q(n) denote the largest prime power which divides n≥2. The purpose of this paper is to give asymptotic formula for the sum.     

Gauss Sum of Index Four

Let p be a prime number, q=p^f and m|q-1. For a multiplicative character x of Fq with order m, the Gauss sum G(x) over Fq is defined by     

On a Conjecture of Drasin Concerning Functions With Maximum Deficiency Sum

Let f be a meromorphic function of finite order in the plane. If its Nevanlinnadeficiency sum is 2,then we say that f has maximum deficiency sum. Drasin con-jectured that if f has maximum deficiency sum and the infinity is not its Nevanlinna'sdeficient value, then zero is the only Nevaulinna's deficient value of f' with defi-ciency 1. Yang Lo gave a positive answer of this conjecture by proving that under theabove assumption, zero is the only Nevanlinna's deficient value of f(h) with,deficie-ncy 2/(1 + k) for k = 1,2,…. Now, omitting the condition δ(∞,f) = 0, we prove     

二阶非线性泛函微分方程的渐近性与振动性

本文讨论如下类型二阶泛函微分方程(E) [r(t)x′(t)]′ sum from 1 to m(f_i(t,x(g_(il)(t)),…,x(g_(in)(t))))=0解的渐近性与振动性。 假设i)r(t)对t≥a连续且为正; ii)对一切t≥a,有g_(ij)(t)≥t(或≤t),连续,且当t→∞时,趋于 ∞,i=1,2,…,m,j=1,2,…,n;     

ASYMPTOTIC BEHAVIOR OF SOLUTIONS OF NONLINEAR DELAY DIFFERENTIAL EQUATIONS

Sufficient conditions are established for the asymptotic behavior of solutionsof nonlinear delay differential equations x′(t)+sum from i=1 to m(pi(t)x(t-т_i))=F(t,x_t),t≥0where 0<т_1<т_2<…<т_m≤r,pi∈C([0,∞)),i=1,2,…,m,F∈C([0,∞)×C_0,R).C_0=C([-r,0],R)equipped with the sup norm ||·|| forsome r>0. A new result is established, some known results are improved.     

对合的分解

Using the notion of biconnected sum we define the biconnected sum (T₁, M₁)§(T₂,M₂) of two involutions (T1M1) and (T2,M2) which is an involution on the biconnected sum M₁,§M₂. A connected involution is said to be reducible if it can be expressed as a biconnected sum of two connected involutions.Theorem Each connected involution (T, M) can be decomposed into a bi-connected sum of connected irreducible involutions (T, M)=(T₁, M₁)§…§(T_q,M_q),and (?) where the coefficients of H_{n_1}(M) are in Z/2 Z if M is unoriented, in Z if is oriented .     

和图、整和图及模和图的几个结果

Let N denote the set of positive integers.The sum graph G (S) of a finite subset S (C) N is the graph (S,E) with uv ∈ E if and only if u v ∈ S.A graph G is said to be a sum graph if it is isomorphic to the sum graph of some S С N.By using the set Z of all integers instead of N,we obtain the definition of the integral sum graph.A graph G=(V,E) is a mod sum graph if there exists a positive integer z and a labelling,λ,of the vertices of G with distinct elements from {0,1,2,...,z-1} so that uv ∈ E if and only if the sum,modulo z,of the labels assigned to u and v is the label of a vertex of G.In this paper,we prove that flower tree is integral sum graph.We prove that Dutch m-wind-mill (Dm) is integral sum graph and mod sum graph,and give the sum number of Dm.     

Mean Values of the Hardy Sum

Let p ≥ 5 be a prime.For any integer h,the Hardy sum is defined by H(h,p) =p-1Σj=1(-1)j+1+[hj/p],which is related to the classical Dedekind sum.The mean values of the Hardy sum in short intervals are studied by using the mean value theorems of Dirichlet L-functions.     

p级数的求和

通过积分转移、余项逼近的方法,建立起一系列p级数的求和公式,并给出了便于操作的误差估计方法.一改把级数余项当作误差来估计的传统做法,而是将余项作为和的重要组成部分进行分析,使得每增加一项计算量,精度能提升二个以上指数级,从而有效地解决了p级数的求和问题.     

一类整和图

证明了双星S(m，n)是一个整和图，进而阐明在同构的意义下双星的整和标号是唯一的．     

一个类似广义Dedekind和S_2(h,n,k)的二次均值

本文的主要目的是利用 Dirichlet L -函数的均值研究 n为奇数时 ,类似广义 Dedekind和 S2 ( h,n,k)的二次均值 ,得到了两个有趣的渐近公式 .     

矩阵的拟直和分解与Craig定理

讨论了矩阵的和与其加项之间,在等价关系及(对称阵的)合同关系上的联系.并进一步讨论了矩阵和的非零特征值与其加项的非零特征值之间的联系,给出了C ra ig定理的一个代数形式和代数证明.     

表格式分部和分及应用

给出了求函数和分的一种表格式算法.对于函数f(x)g(x),如果f(x)为多项式,而g(x)的高阶和分都能算出,那么f(x)g(x)的和分就可以利用这种表格式算法较快速的算出,它对数列求和有一定的益处.     

Computing the Minkowski Sum of Prisms

Within this paper we study the Minkowski sum of prisms (“Cephoids”) in a finite dimensional vector space. For a vector with positive components we write and denote by the associated prism. We provide a representation of a finite sum of prisms in terms of inequalities. Dedicated to the 65th birthday of Alexander Rubinov.     

关于子空间的和的推广的注记

对向量空间的子空间的和的概念不能推广到无限多个子空间的情形进行了讨论.