有限域上存在弱自对偶正规基的一个充要条件

对于将有限域上的自对偶基概念推广到了更一般的弱自对偶的情形,给出了有限域上存在这类正规基的一个充要条件设q为素数幂,E=Fqn为q元域F=Fq的n次扩张,N={αi=αq2| i=0,1,…,n-1}为E在F上的一组正规基.则存在c∈F*及r,0≤r≤n-1,使得β=cαr生成N的对偶基的充要条件是以下三者之一成立(1)q为偶数且n≠0(mod 4);(2)n与q均为奇数;(3)q为奇数,n为偶数,(-1)为F中的非平方元且r为奇数.     

有限域上的弱自对偶正规基

对有限域上的弱自对偶正规基的乘法表的特征进行了刻画,并对其复杂度进行了研究,得到了在几种不同类型的有限域扩张时此类正规基的下界描述.例如,若q为素数幂,E=Fqn为q元域F=Fq的n次扩张,N={αi=αqi|I=0,1,…,n-1}为E在F上的一组弱自对偶正规基,其对偶基由β=cαr生成,其中c∈F*,0≤r≤n-1,则当r≠0,n/2时,N的复杂度CN为偶数且CN≥4n-2.     

偶特征有限域上一类正规基及其对偶基(英文)

设正整数n(≥2),N={α_i|i=0,1,…,n-1)是有限域F_(2n)在F_2的正规基,且t_i=Tr(αα_i)(i=0,1,…,n-1),其中Tr(α)是α∈F_(2n)在F_2上的迹映射.本文讨论了F_(2n)在F_2上的满足如下条件的高斯正规基的存在性:t_0=t_1=t_(n-1),t_i=0(i≠0,1,n-1).给出了这种正规基的对偶基,并由此确定了F_(2n)在F_2上满足上述条件的全部最优正规基.     

某些对角方程在有限域上的解数

主要运用Gauss和以及Jacobi和的相关性质给出两类对角方程在有限域上的解数公式,分别是形如s∑(i=1) a_ix_i~(m_i)=c的对角方程,其中a_i,c∈F_q~2~*,(m_i,m_j)=1,m_i|(q+1),m_i为奇数或(q+1)/(m_i)为偶数,i=1,2,…,s,以及形如s∑(i=1) x_i~m=c的对角方程,其中c∈F_q~*,m|(q+1),m为奇数或(q+1)/m为偶数.     

RESEARCH ANNOUNCEMENTS——On Multiplication Tables of Normal Bases and Their Dual-bases Over Finite Fields

Let q be a power of a prime p and n be a positive integer,let K=Fq be the finite fiele with q elements and F=Fqn be the nte extension of K.N=｛αi|i=0,1,…,n-1｝is a normal basis of F over Fq,where αi=α^qi,i=0,1…,n-1.     

具有两个非零点循环码的权重分布

循环码作为一类重要的线性码,因其有效的编码和译码算法而被广泛应用于通信和存储系统.令F_r为有限域F_q的一个扩域,其中r=q~m,α为有限域F_r的本原元.设n=n1n2满足gcd(n1,n2)=1为r-1的因子.定义F_q上的一类循环码C={c(a1,a2)=(T_r/q(a1y_1~2+a2(g1g2)~i))_(i=0)~(n-1):a1,a2∈F_r},其中g1=α(r-1)/(n1),g2=α(r-1)/(n2),且g1与g1g2不共轭.本文将利用Gauss周期刻画循环码C的权重分布.特别地,这类循环码包含一类二重循环码和一类三重循环码.     

关于有限域上最优正规基的分布(英文)

设E/F_q为q元有限域F_q的扩域.如果α∈E生成E/F_q的一个正规基,则称α∈E为E的一个正规基生成元.本文证明了:对于任何中间域K,E的正规元被E到K的迹映射均匀的映到K的正规元.另一方面,给出了所有这样的中间域K:K中的正规元在E到K的迹映射下的完全原像中的元均为E中的正规元.     

OI_n的理想K(n,r)的极大逆子半群

Xn为n元有限集,OIn为Xn上的一切保序严格部分一一变换半群.记K(n,r)={α∈OIn∶|Tmα|≤r}(0≤r≤n-1)则K(n,r)(0≤r≤n-1)是OIn的理想.我们刻划了K(n,r)(1≤r≤n-1)的极大逆子半群.     

关于Littlewood的一个问题

本文证明了: (1)如果{a_n}_n~N=1是非负不减序列,p>0,q>0,0≤r≤1,且p(q+r)≥q+p,则sum from n=1 to N(a_n~pA_n~q)(sum from m=n to N(a_n~(1+p/q)~r≤1·sum from n=1 to N(a_n~pA_n~q)~(1+p/q),其中A_n=sum from m=n to n (a_m).上述不等式在0≤r≤1时完全解决了H.Alzer~([4])在1996年提出的一个问题,且1是最佳常数; (2)如果{a_n}_n~N=1是非负序列,p,p≥1,r>0,r(p-1)≤2(q-1),令α=((p-1)(q+r)+p~2+1)/(p+1) β=(2p+2r+p-1)/(q+1),σ=(q+r-1)/(p+q+r)则sum from n=1 to N (a_n~p)sum from i=1 to n (a_i~qA_i~r)≤2~σsum from n=1 to N(a_n~αA_n~β)(0.2)(0.2)式改进了G.Be(?)et~([2,3])在1987年对Littlewood一个问题的结果,常数因子的3/2降为2~(3/2)=1.2598…     

森谱的界

设λ_k(F)是树或者森的第k大特征值,[x]是不超过x的最大整数,q是F的边独立数.本文证明了:对于1≤k≤[(q 1)/2]有λ_k(F)≥1,并且这个下界是最好可能的;对于1≤i≤[q/2],若q为偶数,则有λ[(q 1)/2] i(F)≥2cos((2iπ)/(4i 1)),若q为奇数,则有λ_([(q 1)/2] i)(F)≥2cos(((2i 1)π)/(4i 3)),     

On sum-product bases

We investigate additive-multiplicative bases in . Let , s>2, and . It is proved that , provided min {|B| ^s/2|A|^(s−2)/2,|A| ^s/2|B|^(s−2)/2}>p ^s/2. This note is supported by “Balaton Program Project” and OTKA grants K 61908, K 67676.     

Normal Bases and Their Dual-Bases over Finite Fields

In this paper, we prove the following results： 1） A normal basis N over a finite field is equivalent to its dual basis if and only if the multiplication table of N is symmetric; 2） The normal basis N is self-dual if and only if its multiplication table is symmetric and Tr（α^2） = 1, where α generates N; 3） An optimal normal basis N is self-dual if and only if N is a type-Ⅰ optimal normal basis with q = n = 2 or N is a type-Ⅱ optimal normal basis.     

A characterization of L p(ℝ) by local trigonometric bases with 1<p<∞

We show that the local trigonometric bases introduced by Malvar, Coifman and Meyer constitute bases, but not unconditional bases, for L^p(ℝ) with 1<p<∞, p≠2. In addition, we characterize the functions in L^p(ℝ) for 1<p<∞ in terms of their local trigonometric basis coefficients. Dedicated to Dr. Charles A. Micchelli for his 60th birthday Mathematics subject classification (2000) 42C15. Supported by Prof. Y. Xu under his grant in program of “One Hundred Distinguished Chinese Scientists” of the Chinese Academy of Sciences, the National Natural Science Foundation of China (No. 10371122), and the second author is supported by Tianyuan Fund for Mathematics (No. A0324648).     

关于Banach空间的无条件基

给出具有唯一无条件基的无穷维Banach空间,并给出其无条件基的若干性质.     

On some characterizations of greedy-type bases

In 1999, S. V. Konyagin and V. N. Temlyakov introduced the so-called Thresholding Greedy Algorithm. Since then, there have been many interesting and useful characterizations of greedy-type bases in Banach spaces. In this article, we study and extend several characterizations of greedy and almost greedy bases in the literature. Along the way, we give various examples to complement our main results. Furthermore, we propose a new version of the so-called Weak Thresholding Greedy Algorithm (WTGA) and show that the convergence of this new algorithm is equivalent to the convergence of the WTGA.     

有限域上最优正规基的乘法表

本文给出了有限域上最优正规基乘法表的一个计算方法,改进了孙琦的相应结果.在有限域上椭圆曲线密码体制的应用中,本文给出的算法是非常有效的.     

An Implementation for the Algorithm of Janet bases of Linear Differential Ideals in the Maple System

In this paper, an algorithm for computing the Janet bases of linear differential equations is described, which is the differential analogue of the algorithm JanetBasis improved by Gerdt. An implementation of the algorithm in Maple is given. The implemented algorithm includes some subalgorithms: Janet division,Pommaret division, the judgement of involutive divisor and reducible, the judgement of conventional divisor and reducible, involutive normal form and conventional normal form, involutive autoreduction and conventional autoreduction, PJ-autoreduction and so on. As an application, the Janet Bases of the determining system of classical Lie symmetries of some partial differential equations are obtained using our package.     

Entropy,Universal Coding,Approximation, and Bases Properties

We shall present here results concerning the metric entropy of spaces of linear and nonlinear approximation under very general conditions. Our first result computes the metric entropy of the linear and m-terms approximation classes according to a quasi-greedy basis verifying the Temlyakov property. This theorem shows that the second index r is not visible throughout the behavior of the metric entropy. However, metric entropy does discriminate between linear and nonlinear approximation. Our second result extends and refines a result obtained in a Hilbertian framework by Donoho, proving that under orthosymmetry conditions, m-terms approximation classes are characterized by the metric entropy. Since these theorems are given under the general context of quasi-greedy bases verifying the Temlyakov property, they have a large spectrum of applications. For instance, it is proved in the last section that they can be applied in the case of L _p norms for R ^d for 1 < p < \infty. We show that the lower bounds needed for this paper in fact follow from quite simple large deviation inequalities concerning hypergeometric or binomial distributions. To prove the upper bounds, we provide a very simple universal coding based on a thresholding-quantizing constructive procedure.