The low<Subscript><Emphasis Type="Italic">n</Emphasis></Subscript> and low<Subscript><Emphasis Type="Italic">m</Emphasis></Subscript> r. e. degrees are not elementarily equivalent

Jockusch, Li and Yang showed that the Lown and Low1 r.e. degrees are not elementarily equivalent for n > 1. We answer a question they raise by using the results of Nies, Shore and Slaman to show that the Lown and Lowm r.e. degrees are not elementarily equivalent for n > m > 1.     

SUBGEOMETRIC RATES OF CONVERGENCE OF THE GI/G/1 QUEUEING SYSTEM

The article deals with the waiting time process of the GI/G/1 queueing system.We shall give that the rate of convergence to the stationary distribution and the decay of the stationary tail only depend on the tail of the service distribution,but not on the interarrival distribution.We shall also give explicit criteria for the rate of convergence and decay of stationary tail for three specific types of subgeometric cases(Case 1:the rate function r(n)=exp(sn1/1+α),α>0,s>0;Case 2:polynomial rate function r(n)=nα,α>0;Case 3:logarithmic rate function r(n)=logαn,α>0).     

用样条函数的缺插值

<正> f(x)是区间[0,1]上定义的函数,n 是奇数,把[0,1]n 等分,记h=1/n,f~(r)(vh)=f_v~(r),v=0,1,…,n;r=0,1,…,5.A.Meir 和 A.Sharma 提出五次缺插值样条函数,即满足下面条件的五次样条函数 S_n(x):     

論多面体映入n維球的分类問題

<正> 設K为n+r維有限多面体,S~n为n維球.把連續映像f:K~(n+r)→S~n的全体看成一个集合,在这个集合中二个映像f_0,f_1之間,如果存在同伦关系,即有連續映像F:K~(n+r)×I→S~n存在,使得     

关于HERMITE-FEJER型插值算子逼近度的某些问题

本文讨论 Hermite-Fejér 型插值算子逼近光滑函数的逼近特征.[1]得到当第一类多项式的零点取作插值节点时,Hermite-Fejér 算子的逼近度不会比1/n 更好.本文则得到,当 Jacobi 多项式 J_n~(d.d)(x)(α>-1)的零点取作插值节点时,既使任意提高函数的光滑程度,Hermite-Fejér 算子的逼近度也不会比 1/n 更好.     

一道高考试题的推广

1995年高考文科数学试题第 2 3题 :设 {an}是由正数组成的等比数列 ,Sn 是其前n项和 ,证明 :12 (log0 .5 Sn+log0 .5 Sn + 2 ) >log0 .5 Sn + 1.由对数运算性质可知 ,求证不等式可化归为证明其等价不等式SnSn + 2 0 ,当r =1时 ,SpS…     

一类幂平均不等式的完善

设n≥2,n∈N,β>θ>0,a∈R_+~n,r∈R,M_r(a)为a的r次幂平均,将确定参数λ,使(G(a))~(1-λ)(Mβ(a))~λ≤M_θ(a)成立.此结果推广了一些已知结论.     

共轭对角占优矩阵的特征值分布

<正> 设 A=(a_(rs)_(n×n)为 n 阶复矩阵.记μ_r=sum from s≠r |a_(rs)|,N={1,2,…,n},J(A)={r∈N||a_(rr)>μ_r}.我们引入下述定义:定义1 若对r=1,2,…,n 皆有|a_(rr)|>μ_r,则称 A 为按行严格对角占优矩阵,记为 A∈D.若对 r=1,2,…,n 皆有|a_(rr)|≥μ_r,J(A)非空集,且对任一 k(?)J(A),有a_(ks_1)a_(s_1s_2)…a_(s_m)l≠0,l∈J(A),则称 A 为按行准严格对角占优矩阵,记为 A∈SC.若 A为此二类矩阵之一,则记为 A∈D∪SC.     

CONVERGENCE RATES IN THE LAW OF LARGE NUMBERS FOR B-VALUED RANDOM ELEMENTS

1 Introduction and Main ResultsLet {X.,n > 1} be a sequence of random variables in the same probability space andnput Sn = Z Xj, n 2 1. ln real-valued case1 the rates of convergence to zero of qualltitiesi = 1P(lS.I/n'/' > E) (0 < f < 2) are described by the well-known theorem of Baum and Katz(1965):Theorem BK Let 0 < t < 2,r 2 1, and let {X., n 2 1} be real valued iid r.v.'s, when1 5 t < 2, EXl = 0. ThenIn l985, Bai and Su generalized Theorem BK and obtained the correspondillg resul…     

用求导法解2001年高考第20(Ⅱ)题

20 0 1年高考数学试卷理科第 2 0 ( )题为 :已知 r、m、n是正整数 ,且 1( 1 n) m .标答中是应用二项式定理来解 ,多数考生是用均值不等式法 (见本期 P4 2 ) .这里给出构造辅助函数和用求导的方法 .解∵　 11,∴　 f′( x) <0 ,则　 f( x)为单调递减函数 .又　 2≤ m ln( 1 n)n ,nln( 1 m) >mln( 1 n) .故…     

Maximum Modulus of Polynomials

Let P(z) =n∑j=0 a_jz~j be a polynomial of degree n and let M(P, r) = max|z|=r|P(z)|. If P(z) ≠ 0 in |z| 1, then M( P, r) ≥ ((1 + r)/ (1 + ρ))~ n M( P, ρ).The result is best possible. In this paper we shall present a refinement of this result and some other related results.     

树映射的ω-极限集与湍流

设Ｔ是个树，ｆ：Ｔ→Ｔ是个连续自映射，　ｎ是Ｔ的端点数，ｘ∈Ｔ．本文证明：（１）如果存在ｚ∈ω（ｘ，ｆ）∩Ｆ（ｆ），使ｚ是ω（ｘ，ｆ）的一个单侧聚点，那么一定存在ｒ∈Ｎｎ－１，使ｆｒ含有湍流；（２）如果ω（ｘ，ｆ）是个含有不动点的无穷集，那么必存在ｒ∈Ｎｎ，使ｆｒ含有湍流．     

Elliptic curves and positive definite ternary forms

For two given ternary quadratic formsf(x, y, z) andg( x, y, z), letr(f, n) andr(g, n) be the numbers of representations of n represented byf( x, y, z) and g( x, y, z) respectively. In this paper we study the following problem: when will we haver(f, n) =r(g, n) orr( f, n)≠r(g, n). Our method is to use elliptic curves and the corresponding new forms.     

Chebyshev expansions and rational approximations

Let A(z) = A_m(z) + a_mz^mB(z,m) where A_m(z) is a polynomial in z of degree m-1. Suppose A(z) and B(z,m) are approximated by main diagonal Padé approximations of order n and r respectively. Suppose that the number of operations needed to evaluate both sides of the above equations by means of the Padé approximations and polynomial noted are the same. Thus 4n = 3m + 4r. We address ourselves to the question of which procedure is more efficient? That is, which procedure produces the smallest error? A variant of this problem is the situation where A(z) and B(z,m) are approximated by their representations in infinite series of Chebyshev polynomials of the first kind truncated after n and r terms respectively. Here n = m + r.Let F(z) have two different series type representations in overlapping or completely disjoint regions of the complex z-plane. Suppose that for each representation there is a sequence of rational approximations of the same type, say of the Padé class, which converge for |arg z| < π except possibly for some finite set of points. Assume that the number of machine operations required to make evaluations using the noted approximations are the same. Again, we ask which procedure is best? Other variants are studied.General answers to the above questions are not known. Instead, we illustrate the ideas for a number of the rather common special functions.     

Some Sharpening and Generalizations of a Result of T. J. Rivlin

Let p(z)=a_0+a_1z+a_2z~2+a_3z~3+···+a_nz~n be a polynomial of degree n.Rivlin[12]proved that if p(z)≠0 in the unit disk,then for 0r≤1,max|z|=r|p(z)|≥((r+1)/2)~nmax|p(z)||z|=1.In this paper,we prove a sharpening and generalization of this result and show by means of examples that for some polynomials our result can significantly improve the bound obtained by the Rivlin’s Theorem.     

3-连通、高次和坚韧图周长的估计(Ⅰ)

设G是一个n阶3-连通图,周长为C(G),独立数为,若G是1-坚韧的,且,则G的每一个最长圈是控制圈且;又若G是5/3-坚韧的或,则G是Hamilton图。     

关于Neumann-Bessel级数的线性组合算子

In this paper we construct a new operator H(N,B)n,r(f;z) by means of the partial sums S(N,B)n(f;z) of Neumann-Bessel series.The operator converges uniformly to any fixed continuous function f(z) on the unit circle |z|= 1 and has the best approximation order for f(z) on |z|= 1.     

When is an L(B, m, n, r, s, t, z, w) loop SRAR?

In [5, 6], the second author and D. A. ROBINSON initiated a study of non-Moufang Bol loops with the property that over a field, necessarily of characteristic 2, their loop rings satisfy the right, but not the left, Bol identity. They called such loops SRAR and showed that the family of SRAR loops includes those Bol loops which have a unique non-identity commutator/associator. In [4, 2], the current authors presented a construction for a new class of Bol loops denoted L(B,m,n,r,s,t,z,w) with initial data a given (possibly associative) Bol loop B, elements, r, s, t, z and w in the centre of B, and integers m and n.     

单位圆内亚纯函数的奇异点

本文对单位圆内零级亚纯函数得到了一个较为广泛的与正规定则相应的奇异点的存在性,并由此得到如下结果：若单位圆|z|＜1内的亚纯函数满足则存在点eiθ0（≤θ0＜2π）使得对任意正数ε＞0任意正整数。n≥1,恒有limr→l-0n（r,θ0,ε;flfm=a）=＋∞对每一有穷非零复数a成立．     

关于本原商高数的Miyazaki猜想

设a,b,c是适合a=2~(2r)-n~2,b=2~(r+1)n,c=2~(2r)+n~2的正整数,其中r是正整数,n是奇素数.运用初等数论方法讨论了指数Diophantine方程c~x+b~y=a~z.证明了:当2~r=n+1时,方程仅有正整数解(x,y,z)=(1,1,2);否则,方程无解。上述结果部分地证实了有关本原商高数的Miyazaki猜想。