关于Grünwald插值算子及其应用

本文研究了基于Jacobi多项式J_n^(α,β)(x)(0<α,β<1)的零点{x_k}_lⁿ的Grünwald插值多项式G_n(f;x)=(?)f(x_k)l_k²(x),证明了G_n(f;x)在(-1,1)内的任一闭子区间上一致收敛于连续函数f(x);从而拓广了Grünwald所得结果。     

k维Piatetski-Shapiro素数定理 *

研究了k(≥3)维的Piatetski Shapiro素数定理 .令π(x;c₁,… ,c_k)表示不超过x且具有形式 [n^c₁1]=… =[n^c_kk]的素数个数 ( 1 k- (k/( 4k²+2 ) )时 ,π(x;c₁,… ,c_k)具有渐近公式 .     

交换p-群的子群格的强Sperner性质

设n和k是任意正整数 ,p是素数 ,L_(kⁿ) (p)是交换p 群 (Z/p^kZ)ⁿ 的子群格 ,则存在正整数N(n ,k) ,使得当p >N(n ,k)时 ,L(_{kⁿ) (p)}具有强Sperner性质 .     

Siegel模形式的一个注记

给出了任意同余子群上的Siegel模形式的特征描述和Siegel模形式空间维数的一些估计 .对于小权k ,也给出了J⁰_k ,1(Γ_n)和S^k_n(Γ_n)的一个比较关系     

不动点集为常余维数6的(Z2)2作用

记J_n,k^r为具有如下性质的n维未定向上协边类α构成的集合:存在α的一个代表元Mⁿ及(Z₂)^k在Mⁿ上的作用,其不动点集为常余维数r .记J_n,k^r=∑_nJ_n,k^r,则J_n,k^r为未定向上协边环MO_n=     

齐次乘子算子的交换子

记H^l={w∈C^∞(R^k\{0}):w是l次齐次函数),R^_(-a)(m)是Taylor级数余项算子的n重叠合:m=(m₁,…,m_n)∈Zⁿ,Z记非负整数的集,α∈(R^k)ⁿ,定义 其中a=(a₁,…,a_n),a_i,f∈(R^k), 主要结果如下: 1.证明了几个介于算子T_^R(-a)^{(m)_w(ξ)),(a,f})的类与多线性奇异积分算子的类之间的对等定理; 2.作为应用,算子及 的某些有界性结果被给出,其中Ω∈H⁰,|β|≤|m|,且,m_i≥1。     

Schur函数的一个展式及其在计数几何中的应用

本文给出对称多项式的幂的Schur函数展式(x₁^k+…+x_n^k)^m=sumC_{(λ1,…,λn)}S_{(λ1,…,λn)}(x₁,…,x_n)中系数C_{(λ1,…,λn)}的计算方法,并把它和文献[1]应用于计数几何的若干问题。     

Bloch型空间的一个刻画

本文研究了Bloch型空间中函数性质问题.利用拟双曲度量及一些不等式得到了Bloch型空间B^α(B_n) (0< α ≤ 1)的一个新的刻画,该刻画将Bloch型空间B^α(B_n)的Holland-Walsh刻画推广到一个高阶形式.     

NA随机场对数律的收敛速度

设d是一个正整数, N ^d是d -维正整数格点.设{X_n , n∈N ^d} 是一同分布的负相伴随机场, 记S_n =∑_{k≤ n} X_k, S_n^(k)=S_n-X_k, 如果r >2, EX₁ = 0 和σ²= Var(X₁}, 则存在一个正数M:=100√(r-2)(1+σ²)使得下列条件等价 (I)E |X₁|^r (log|X₁|)^d-1-r/2 <∞; (II)∑_{n∈ N^d} |n|^r/2-2P(max_{1≤ k≤ n} |S_n^(k)|≥ (2^d+1 )ε√|n| log |n |) <∞,∨ε > M; (III)∑_{n∈N ^d} |n|^r/2-2P(max_{1≤ k≤n} |S_k |≥ε√| n} log| n |) <∞,∨ε > M. (III)\ \ $\sum\limits_{{{\bf n}}\in {{\cal N}}^{d}} |n|^{r/2-2} P(\max\limits_{{\bf 1}\leq{\bf k}\leq{\bf n}}|S_{{\bf k}}|\geq \varepsilon \sqrt{|{\bf n}|\log |{\bf n}|})<\infty$, $\forall\varepsilon>M$.     

On Cramer Approximations under Violation of Cramer's Condition

Let X ₁, X ₂,... be independent identically distributed random variables with distribution function F, S ₀ = 0, S _n = X ₁ + ⋯ + X _n , and Sˉ _n = max_1⩽k⩽n S _k . We obtain large-deviation theorems for S _n and Sˉ _n under the condition 1 − F(x) = P{X ₁ ⩾ x} = e^−l(x), l(x) = x ^α L(x), α ∈ (0, 1), where L(x) is a slowly varying function as x → ∞. __________ Translated from Lietuvos Matematikos Rinkinys, Vol. 45, No. 4, pp. 447–456, October–December, 2005.     

Some results for the queues Mx/M/c and GIx/ G/c

We develop for the queue M^x/M/c an upper bound for the mean queue length and lower bounds for the delay probabilities (that of an arrival group and that of an arbitrary customer in the arrival group). An approximate formula is also developed for the general bulk-arrival queue GI^x/G/c. Preliminary numerical studies have indicated excellent performance of the results.     

关于环Fpm+uFpm+u2Fpm上循环码的注记

本文研究了环F_p^m+uF_p^m+u²F_p^m上长度为p^s的循环码分类.通过建立环F_p^m+uF_p^m+u²F_p^m到环F_p^m+uF_p^m的同态,给出了环F_p^m+uF_p^m+u²F_p^m上长度为p^s的循环码的新分类方法.应用这种方法,得到了环F_p^m+uF_p^m+u²F_p^m长度为p^s的循环码的码词数.     

M/G/1/MLPS compared to M/G/1/PS

Multilevel processor sharing scheduling disciplines have recently been resurrected in papers that focus on the differentiation between short and long TCP flows in the Internet. We prove that, for M/G/1 queues, such disciplines are better than the processor sharing discipline with respect to the mean delay whenever the hazard rate of the service time distribution is decreasing.     

Large-time asymptotics for the Gt/Mt/st+GIt many-server fluid queue with abandonment

We previously introduced and analyzed the G _t /M _t /s _t +GI _t many-server fluid queue with time-varying parameters, intended as an approximation for the corresponding stochastic queueing model when there are many servers and the system experiences periods of overload. In this paper, we establish an asymptotic loss of memory (ALOM) property for that fluid model, i.e., we show that there is asymptotic independence from the initial conditions as time t evolves, under regularity conditions. We show that the difference in the performance functions dissipates over time exponentially fast, again under the regularity conditions. We apply ALOM to show that the stationary G/M/s+GI fluid queue converges to steady state and the periodic G _t /M _t /s _t +GI _t fluid queue converges to a periodic steady state as time evolves, for all finite initial conditions.     

Une question sur les équations xm ? ym = Rzn (A Question on the Equations xm ? ym = Rzn)

Let m and n be integers at least two and R be a nonzero natural number. In this paper, we study the problem of the determination of the proper solutions of the Diophantine equation x ^m – y ^m equals; Rz ⁿ . We raise a question concerning the existence of any proper nontrivial solution of this equation, in case some precise conditions are satisfied by the triple (m, n, R). We prove some results about it.     

Solving Ck/Cm/1/N queues by using characteristic roots in matrix analytic methods

In this paper, we study a C_k/C_m/1/N open queueing system with finite capacity. We investigate the property which shows that a product of the Laplace Stieltjes Transforms of interarrival and service times distributions satisfies an equation of a simple form. According to this equation, we present that the stationary probabilities on the unboundary states can be written as a linear combination of vector product-forms. Each component of these products is expressed in terms of roots of an associated characteristic polynomial. As a result, we carry out an algorithm for solving stationary probabilities in C_k/C_m/1/N systems, which is independent of N, hence greatly reducing the computational complexity.     

The least squares problem of the matrix equation A1X1B1^T ＋ A2X2B2^T = T

The matrix least squares （LS） problem minx ｜｜AXB^T--T｜｜F is trivial and its solution can be simply formulated in terms of the generalized inverse of A and B. Its generalized problem minx1,x2 ｜｜A1X1B1^T ＋ A2X2B2^T - T｜｜F can also be regarded as the constrained LS problem minx=diag（x1,x2） ｜｜AXB^T -T｜｜F with A = [A1, A2] and B = [B1, B2]. The authors transform T to T such that min x1,x2 ｜｜A1X1B1^T＋A2X2B2^T -T｜｜F is equivalent to min x=diag（x1 ,x2） ｜｜AXB^T - T｜｜F whose solutions are included in the solution set of unconstrained problem minx ｜｜AXB^T - T｜｜F. So the general solutions of min x1,x2 ｜｜A1X1B^T ＋ A2X2B2^T -T｜｜F are reconstructed by selecting the parameter matrix in that of minx ｜｜AXB^T - T｜｜F.     

On the asymptotic behavior of xn+1=anxn/xn−1

We investigate the asymptotic behavior of solutions of a separable difference equation of the form

     

Some remarks on the Schr?dinger equation with a potential in LrtLsx

We study the dispersive properties of the linear Schr?dinger equation with a time-dependent potential V(t,x). We show that an appropriate integrability condition in space and time on V, i.e. the boundedness of a suitable L^r_tL^s_x norm, is sufficient to prove the full set of Strichartz estimates. We also construct several counterexamples which show that our assumptions are optimal, both for local and for global Strichartz estimates, in the class of large unsigned potentials V ∈L^r_tL^s_x. Support. The authors are partially supported by the Research Training Network (RTN) HYKE and by grant HPRN-CT-2002-00282 from the European Union. The third author is supported also by INDAM     

On the finite-source G/M/r queue

The aim of the present paper is to give the main characteristics of the finite-source $\text{G}\text{/}\text{M}\text{/r}$ queue in equilibrium. Here unit i stays in the source for a random time having general distribution function F_i(x) with density f_i(x). The service times of all units are assumed to be identically and exponentially distributed random variables with means 1/μ. It is shown that the solution to this $\text{G}\text{/}\text{M}\text{/r}$ model is similar in most important respects to that for the M/M/r model.