MULTIPLICATIVE ORDER OF GAUSS PERIODS

DOI10.1142/S1793042110003290zbMath1201.11110arXiv0707.4034MaRDI QIDQ3578429

Omran Ahmadi, José Felipe Voloch, Igor E. Shparlinski

Publication date: 20 July 2010

Published in: International Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0707.4034

zbMATH Keywords

partition; finite fields; multiplicative order; Gauss period

Mathematics Subject Classification ID

11T30: Structure theory for finite fields and commutative rings (number-theoretic aspects)

Related Items

Unnamed Item, Elements of large order on varieties over prime finite fields, Elements of high order in finite fields of the form, Elements of high order in Artin-Schreier extensions of finite fields \(\mathbb{F}_q\), Gauss periods as constructions of low complexity normal bases, The dynamics of permutations on irreducible polynomials, Sharpening of the explicit lower bounds for the order of elements in finite field extensions based on cyclotomic polynomials, SUM–PRODUCT ESTIMATES AND MULTIPLICATIVE ORDERS OFγANDγ+γ⁻¹IN FINITE FIELDS, Lower bounds on the orders of subgroups connected with Agrawal conjecture, LOWER BOUNDS FOR PERIODS OF DUCCI SEQUENCES

Cites Work

• Unnamed Item
• Unnamed Item
• On some subgroups of the multiplicative group of finite rings
• Fast arithmetic with general Gauß periods
• Sharper \(ABC\)-based bounds for congruent polynomials
• Low complexity normal bases
• Finite field elements of high order arising from modular curves
• Orders of Gauss periods in finite fields
• An alternate proof of Mason's theorem
• Polynomial and normal bases for finite fields
• On the construction of finite field elements of large order
• Normal bases via general Gauss periods
• Gauss periods: orders and cryptographical applications
• AN ASYMPTOTIC FORMULA IN THE THEORY OF PARTITIONS
• SOME ASYMPTOTIC FORMULAE IN THE THEORY OF PARTITIONS (II)