Elements of provable high orders in finite fields

被引：40
作者：
Gao, SH [1 ]
机构：
[1] Clemson Univ, Dept Math Sci, Clemson, SC 29634 USA
来源：
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY | 1999年 / 127卷 / 06期
关键词：
finite fields; primitive elements; elements of provable high orders; compositions of polynomials;
D O I：
10.1090/S0002-9939-99-04795-4
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A method is given for constructing elements in F(q)n whose orders are larger than any polynomial in n when n becomes large. As a by-product a theorem on multiplicative independence of compositions of polynomials is proved.
引用
收藏
页码：1615 / 1623
页数：9
相关论文
共 50 条
12345