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

对于将有限域上的自对偶基概念推广到了更一般的弱自对偶的情形,给出了有限域上存在这类正规基的一个充要条件设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为奇数.     

三路树P(m,n,t)是边幻图的证明(II)

令简单图G=(V,E)是有p个顶点q条边的图.假设G的顶点和边由1,2,…,p+q所标号,且f:V∪E→{1,2,…,p+q}是一个双射,如果对所有的边xy,f(x)+f(y)+f(xy)是常量,则称图G是边幻图(edge-magic).本文证明了三路树P(m,n,t)当n为偶数,t=n+2时也是边幻图.     

三路树P(m,n,t)是边幻图的证明(Ⅱ)

令简单图G=(V,E)是有p个顶点q条边的图.假设G的顶点和边由1,2,…,p+q所标号,且f:V ∪E→{1,2,…,p+q}是一个双射,如果对所有的边xy,f(x)+f(y)+f(xy)是常量,则称图G是边幻图(edge-magic).本文证明了三路树P(m,n,t)当n为偶数,t=n+2时也是边幻图.     

q元BCH码及其对偶码的周期分布（英文）

利用分圆陪集和组合的方法和技巧,推广了近年来人们所给出的设计距离为δ≤9的q元BCH码的周期分布,完全确定了设计距离为2≤δT的q元BCH码及其对偶码的周期分布的准确计算公式,其中当m为奇数时T=q~((m+1)/2)-1,当m为偶数时q~(m/2)-1.     

ю.В.Линник的大筛法的一个新应用

<正> 这里η为一正的绝对常数,0<η≤1/2,他的证明是用到了(?)的大筛法的一个推广.由此他证明了任一充分大的偶数可表成一个素数及一个半素数之和.最近作者化简并改进了 Rényi 的工作,使大筛法用之于 L-函数的零点分布得到了更精密     

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

主要运用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为偶数.     

关于z.Ditzian定理

1987年Z.Ditzian提出了反映Bernstein算子收敛阶与所逼近函数光滑模之间关系的一个定理,并在α+β≤2情形下给出了这个定理的证明.对于α+β》2情形,Z.Ditzian给出了猜想.1992年周定轩证明了Z.Ditzian的猜想,完成了Z.Ditzian定理的证明.本文对于Z.Ditzian定理给出了一个新的直接证明,这个证明不需要讨论α,β的情况,而且还将Z.Ditzian定理拓广到Bernstein算子线性组合上.     

奇特征域上的全正交图的自同态群（英文）

令F_q~n是奇特征有限域F_q上的n维行向量空间,S_n是F_q上任一n阶非奇异对称矩阵.S_n上的全正交图O(S_n,q)的顶点为F _q~n上的任一一维子空间,图中两顶点相邻当且仅当它们所对应的子空间[α]与[β]满足αS_(nβ)~T≠0.本文刻画了O(S_n,q)的自同态群,证明当n为偶数时,其顶点集有两个轨道;当n为奇数时,其顶点集有三个轨道.     

关于Z.Ditzian定理

1987年Z.Ditzian提出了反映Bernstein算子收敛阶与所逼近函数光滑模之间关系的一个定理,并在α+β≤2情形下给出了这个定理的证明,对于α+β>2情形,Z.Ditziall给出了猜想,1992年周定轩证明了Z.Ditzian的猜想,完成了Z.Ditzian定理的证明,本文对于Z.Ditzian定理给出了一个新的直接证明,这个证明不需要讨论α,β的情况,而且还将Z.Ditzian定理拓广到Bernstein算子线性组合上。     

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

对于将有限域上的自对偶基概念推广到了更一般的弱自对偶的情形,给出了有限域上存在这类正规基的一个充妥条件:设q为素数幂,E=Fqn为q元域F=Fq的n次扩张,N={αi=αqi|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为奇数．     

Nassrallah-Rahman积分的一个新证明

应用关于ｑ－微分算子的Ｌｅｉｂｎｉｚ公式证明了关于ｑ－微分算子的两个恒等式．利用这些恒等式及ｑ－级数的一些求和公式给出了Ｎａｓｒａｌａｈ－Ｒａｈｍａｎ积分的一个新证明，进而给出了关于ｑ－级数８Φ７的积分表示的一个简易推导     

α-Flocks and Hyperovals

A generalization of the concept of a flock of a quadratic cone in PG(3,q), q even, where the base of the cone is replaced by a translation oval, was introduced in [4] and is the focus of this work. The related idea of a q-clan is also generalized and studied with a particular emphasis on the connections with hyperovals. Several examples are given leading to new proofs of the existence of known hyperovals, unifying much of what has been done in this area. Finally, a proof that the Cherowitzo hyperovals do form an infinite family is also included.     

A 类量子群和 Hecke 代数的 Schur-Weyl 对偶

设Vm是量子群Uq（SLm)的标准表示,通过Hecke代数的作用,作者将Vm的张量积V^nm分解成了Uq(SLm)的不可约表示的直和,从而给出了Uq(SLm)与Hecke代数的H（q,n)Schur-Weyl对偶的完整证明,进一步得到,当q是实数时,在Hilbert空间H^n上,Uq(SL∞）和H（q,n)之间存在着Schur-Weyl对偶。     

二阶Volterra系统对平稳正态激励的统计响应的表示定理的数学证明

1974年,Neal根据Kac和Siegert的思想,给出了一个在电子工程、海洋工程、建筑工程、航空工程、自动控制的随机振动中有重要应用的二阶Volterra非线性系统对平稳正态输入的统计响应的表示定理.1984年,Naess对此定理又给出了一个数学证明.经过研究后发现,他们对定理条件的叙述都是模糊的,而且其数学证明都是有问题的.本文重新讨论了这个表示定理,给出了明确的定理条件及严格的数学证明,为它的广泛应用奠定了理论基础.     

A semantical proof of De Jongh's theorem

Summary In 1969, De Jongh proved the maximality of a fragment of intuitionistic predicate calculus forHA. Leivant strengthened the theorem in 1975, using proof-theoretical tools (normalisation of infinitary sequent calculi). By a refinement of De Jongh's original method (using Beth models instead of Kripke models and sheafs of partial combinatory algebras), a semantical proof is given of a result that is almost as good as Leivant's. Furthermore, it is shown thatHA can be extended to Higher Order Heyting Arithmetic+all true ₂ ⁰ -sentences + transfinite induction over primitive recursive well-orderings. As a corollary of the proof, maximality of intuitionistic predicate calculus is established wrt. an abstract realisability notion defined over a suitable expansion ofHA.     

Small weight codewords in the dual code of points and hyperplanes in PG(<Emphasis Type="Italic">n</Emphasis>, <Emphasis Type="Italic">q</Emphasis>), <Emphasis Type="Italic">q</Emphasis> even

The main theorem of this article gives a classification of the codewords in \({C^{\bot}_{n-1}(n,q)}\) , the dual code of points and hyperplanes in PG(n, q), q even, with weight smaller than \({q+\sqrt[3]{q^{2}}+1}\). In the proof, we rely on the classification of the small blocking sets in PG(2, q), q even.     

May谱序列中的一个非平凡积

In this paper,we prove the non-triviality of the product h 0 k o δ s＋4 ∈ Ext s＋6,t（s） A （Z p ,Z p ） in the classical Adams spectral sequence,where p ≥ 11,0 ≤ s p-4,t（s） = （s ＋ 4）p 3 q ＋ （s ＋ 3）p 2 q ＋ （s ＋ 4）pq ＋ （s ＋ 3）q ＋ s with q = 2（p-1）.The elementary method of proof is by explicit combinatorial analysis of the （modified） May spectral sequence.     

On quantitative versions of theorems due to F.E. Browder and R. Wittmann

This paper is another case study in the program of logically analyzing proofs to extract new (typically effective) information (‘proof mining’). We extract explicit uniform rates of metastability (in the sense of T. Tao) from two ineffective proofs of a classical theorem of F.E. Browder on the convergence of approximants to fixed points of nonexpansive mappings as well as from a proof of a theorem of R. Wittmann which can be viewed as a nonlinear extension of the mean ergodic theorem. The first rate is extracted from Browder's original proof that is based on an application of weak sequential compactness (in addition to a projection argument). Wittmann's proof follows a similar line of reasoning and we adapt our analysis of Browder's proof to get a quantitative version of Wittmann's theorem as well. In both cases one also obtains totally elementary proofs (even for the strengthened quantitative forms) of these theorems that neither use weak compactness nor the existence of projections anymore. In this way, the present article also discusses general features of extracting effective information from proofs based on weak compactness. We then extract another rate of metastability (of similar nature) from an alternative proof of Browder's theorem essentially due to Halpern that already avoids any use of weak compactness. The paper is concluded by general remarks concerning the logical analysis of proofs based on weak compactness as well as a quantitative form of the so-called demiclosedness principle. In a subsequent paper these results will be utilized in a quantitative analysis of Baillon's nonlinear ergodic theorem.     

A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs

We give a simpler proof of the well-known result of Matthews and Sumner stating that squares of connected claw-free graphs are vertex-pancyclic. Contrary to the previous proof, our approach does not resort to Fleischner’s result stating that, when restricted to squares of graphs, vertex-pancyclicity and Hamiltonicity are equivalent. The same proof idea already yielded that connected claw-free graphs of even order have a perfect matching, which is another result of Sumner. We conclude by observing that this proof identifies a larger collection of graphs for which the two properties in question hold.