Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS

   
Mobile Device Pairing
Green Open Access
Proceedings of the American Mathematical Society
Proceedings of the American Mathematical Society
ISSN 1088-6826(online) ISSN 0002-9939(print)

 

Elements of provable high orders in finite fields


Author: Shuhong Gao
Journal: Proc. Amer. Math. Soc. 127 (1999), 1615-1623
MSC (1991): Primary 11T55; Secondary 11Y16, 68Q25, 11T06, 12Y05
Published electronically: February 11, 1999
MathSciNet review: 1487368
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: A method is given for constructing elements in ${\mathbb 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.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC (1991): 11T55, 11Y16, 68Q25, 11T06, 12Y05

Retrieve articles in all journals with MSC (1991): 11T55, 11Y16, 68Q25, 11T06, 12Y05


Additional Information

Shuhong Gao
Affiliation: Department of Mathematical Sciences, Clemson University, Clemson, South Carolina 29634-1907
Email: sgao@math.clemson.edu

DOI: http://dx.doi.org/10.1090/S0002-9939-99-04795-4
PII: S 0002-9939(99)04795-4
Keywords: Finite fields, primitive elements, elements of provable high orders, compositions of polynomials
Received by editor(s): September 16, 1997
Published electronically: February 11, 1999
Communicated by: David E. Rohrlich
Article copyright: © Copyright 1999 American Mathematical Society