基于Kronecker型替换的黑盒多项式稀疏插值

本文基于新的Kronecker型替换,给出两个由黑盒表示的稀疏多项式的新确定性插值算法.令f∈R[x1,……,xn]是一个稀疏黑盒多项式,其次数上界为D.当R是C或者是有限域时,相对于已有算法,新算法具有更好的计算复杂度或者关于D的复杂度更低.特别地,对于一般黑盒模型,D是复杂度中的主要因素,而在所有的确定性算法中,本文的第二个算法的复杂度关于D是最低的.     

The Szegö kernel on a class of non-compact CR manifolds of high codimension

We generalize Nagel’s formula for the Szegö kernel and use it to compute the Szegö kernel on a class of non-compact CR manifolds whose tangent space decomposes into one complex direction and several totally real directions. We also discuss the control metric on these manifolds and relate it to the size of the Szegö kernel.     

Classification problems for shifts on modules over a principal ideal domain

In this paper we study symbolic dynamics over alphabets which are modules over a principal ideal domain, considering topological shifts which are also submodules. Our main result is the classification, up to algebraic and topological conjugacy, of the torsion-free, transitive, finite memory shifts.

     

Sparse polynomials, redundant bases, gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields

Gauss periods give an exponentiation algorithm that is fast for many finite fields but slow for many other fields. The current paper presents a different method for construction of elements that yield a fast exponentiation algorithm for finite fields where the Gauss period method is slow or does not work. The basic idea is to use elements of low multiplicative order and search for primitive elements that are binomial or trinomial of these elements. Computational experiments indicate that such primitive elements exist, and it is shown that they can be exponentiated fast.     

鞅差序列的Bernstein型不等式及其应用

本文将独立随机变量序列的Bernstein型不等式推广到鞅差序列情形,给出该不等式的一个应用,并在一定条件下证明了非参数回归中函数估计的强相合性.     

亚纯函数及其微分多项式的唯一性

设f是非常数亚纯函数,g是f的线性微分多项式．a和b是f的两个不同的小函数．本文证明如果f和g几乎CM分担a和b,则f≡g;此外,若f是非常数整函数,且f和f^(k)(k≥1)IM分担a和b,b-a≠Pe^λz,测f≡g．     

最速下降规则不失为一可用规则

本从统计意义上平均迭代次数的观点出发，指出求解线性规划的最速下降规则是可取的，好用的。