首页 | 本学科首页   官方微博 | 高级检索  
     


Finding finite -sequences faster
Authors:Bernt Lindströ  m.
Affiliation:Department of Mathematics, Royal Institute of Technology, S-100 44, Stockholm, Sweden
Abstract:A $B_2$-sequence is a sequence $a_1<a_2<cdots<a_r$ of positive integers such that the sums $a_i+a_j$, $1le ile jle r$, are different. When $q$ is a power of a prime and $theta$ is a primitive element in $GF(q^2)$ then there are $B_2$-sequences $A(q,theta)$ of size $q$ with $a_q<q^2$, which were discovered by R. C. Bose and S. Chowla.

In Theorem 2.1 I will give a faster alternative to the definition. In Theorem 2.2 I will prove that multiplying a sequence $A(q,theta)$ by integers relatively prime to the modulus is equivalent to varying $theta$. Theorem 3.1 is my main result. It contains a fast method to find primitive quadratic polynomials over $GF(p)$ when $p$ is an odd prime. For fields of characteristic 2 there is a similar, but different, criterion, which I will consider in ``Primitive quadratics reflected in $B_2$-sequences', to appear in Portugaliae Mathematica (1999).

Keywords:$B_2$-sequence   Bose-Chowla theorem   finite field   primitive element   primitive quadratic
点击此处可从《Mathematics of Computation》浏览原始摘要信息
点击此处可从《Mathematics of Computation》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号