Summability of Product Jacobi Expansions

Orthogonal expansions in product Jacobi polynomials with respect to the weight function W_α, β(x)=∏^d_j=1 (1−x_j)^α_j (1+x_j)^β_j on [−1, 1]^d are studied. For α_j, β_j>−1 and α_j+β_j−1, the Cesàro (C, δ) means of the product Jacobi expansion converge in the norm of L^p(W_{α, β}, [−1, 1]^d), 1p<∞, and C([−1, 1]^d) if

Full-size image

Moreover, for α_j, β_j−1/2, the (C, δ) means define a positive linear operator if and only if δ∑^d_i=1 (α_i+β_i)+3d−1.     

Shohat-Favard and Chebyshev’s methods in d-orthogonality

This paper is concerned with the Shohat-Favard, Chebyshev and Modified Chebyshev methods for d-orthogonal polynomial sequences d∈ℕ. Shohat-Favard’s method is presented from the concept of dual sequence of a sequence of polynomials. We deduce the recurrence relations for the Chebyshev and the Modified Chebyshev methods for every d∈ℕ. The three methods are implemented in the Mathematica programming language. We show several formal and numerical tests realized with the software developed. This revised version was published online in June 2006 with corrections to the Cover Date.     

Convergence of Appell Polynomials of Long Range Dependent Moving Averages in Martingale Differences

We study limit distribution of partial sums S_N,k(t) = _{s = 1} ^{[N t]} A_k(X_s) of Appell polynomials of the long-range dependent moving average process X_t> = _{i t} b_{t - i i}, where {_i} is a strictly stationary and weakly dependent martingale difference sequence, and b_i i^{d - 1} (0 < d < 1/2). We show that if k(1-2 d)<1, then suitably normalized partial sums S_N,k(t) converge in distribution to the kth order Hermite process. This result generalizes the corresponding results of Surgailis, and Avram and Taqqu obtained in the case of the i.i.d. sequence { _i}.     

基于两类切比雪夫多项式的循环矩阵行列式的计算

利用多项式因式分解的逆变换,结合循环矩阵和切比雪夫多项式的特殊结构,首先研究第三类和第四类切比雪夫多项式的通项公式,并给出第三类、第四类切比雪夫多项式的关于行首加r尾r右循环矩阵和行尾加r首r左循环矩阵的行列式的显式表达式,最后给出算法实施步骤.     

The Green polynomials via vertex operators

An iterative formula for the Green polynomial is given using the vertex operator realization of the Hall-Littlewood function. Based on this, (1) a general combinatorial formula of the Green polynomial is given; (2) several compact formulas are given for Green's polynomials associated with upper partitions of length ≤3 and the diagonal lengths ≤3; (3) a Murnaghan-Nakayama type formula for the Green polynomial is obtained; and (4) an iterative formula is derived for the bitrace of the finite general linear group G and the Iwahori-Hecke algebra of type A on the permutation module of G by its Borel subgroup.     

长程相依情形下部分线性回归模型的估计理论

讨论固定设计点部分线性模型Yn,j=xn,jβ g（tn,j） En,jj=1,2,…;n,其中（xn,j,tn,j）∈R×[0,1]是非随机的固定设计点,β是待估计的本知参数,g（.）是定义在[0,1]则上的未知的光滑函数,{En,j}是长程相依的随机误差．本文在一定的正则性条件下得到了部分线性模型中参数β和函数g(.)的估计的弱相合性、均方相合性和收敛速度,同时得到了这些估计的渐近表示和渐近分布．本文所得到的结果与独立和弱相依情形下的结果有很大的差别．     

Exceptional Laurent biorthogonal polynomials through spectral transformations of generalized eigenvalue problems

A formulation is given for the spectral transformation of the generalized eigenvalue problem through the decomposition of the second-order differential operators. This allows us to construct some Laurent biorthogonal polynomial systems with gaps in the degree of the polynomial sequence. These correspond to an exceptional-type extension of the orthogonal polynomials, as an extension of the Laurent biorthogonal polynomials. Specifically, we construct the exceptional extension of the Hendriksen–van Rossum polynomials, which are biorthogonal analogs of the classical orthogonal polynomials. Similar to the cases of exceptional extensions of classical orthogonal polynomials, both state-deletion and state-addition occur.     

有限域上的重根自对偶负循环码

Let F_q be a finite field with q = p~m, where p is an odd prime. In this paper, we study the repeated-root self-dual negacyclic codes over Fq. The enumeration of such codes is investigated. We obtain all the self-dual negacyclic codes of length 2~ap~r over F_q, a ≥ 1.The construction of self-dual negacyclic codes of length 2~abp~r over F_q is also provided, where gcd(2, b) = gcd(b, p) = 1 and a ≥ 1.     

混合广义Jacobi和Chebyshev谱配置法求解时间分数阶对流扩散方程

研究时间Caputo分数阶对流扩散方程的高效高阶数值方法.对于给定的时间分数阶偏微分方程,在时间和空间方向分别采用基于移位广义Jacobi函数为基底和移位Chebyshev多项式运算矩阵的谱配置法进行数值求解.这样得到的数值解可以很好地逼近一类在时间方向非光滑的方程解.最后利用一些数值例子来说明该数值方法的有效性和准确性.