Artin-Schreier towers of finite fields

被引:0
作者
Cagliero, Leandro [1 ]
Herman, Allen [2 ]
Szechtman, Fernando [2 ]
机构
[1] Univ Nacl Cordoba, CIEM CONICET, FAMAF, Cordoba, Argentina
[2] Univ Regina, Dept Math & Stat, Regina, SK, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Finite fields; Artin-Schreier extensions; Multiplicative order; BELL NUMBERS MODULO; HIGH-ORDER ELEMENTS; PERIOD; EXTENSIONS;
D O I
10.1016/j.ffa.2025.102606
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Given a prime number p, we consider the tower of finite fields F-p = L-1 subset of L-0 subset of L-1 subset of & ctdot;, where each step corresponds to an Artin-Schreier extension of degree p, so that for i >= 0, L-i = Li-1[c(i)], where c(i) is a root of X-p - X -a(i-1) and a(i-1)= (c(-1)& ctdot;c(i-1))(p-1), with c(-1 )= 1. We extend and strengthen to arbitrary primes prior work of Popovych for p = 2 on the multiplicative order O(c(i)) of the given generator ci for Li over Li-1. In particular, for i >= 0, we show that O(c(i)) = O(a(i)), except only when p = 2 and i = 1, and that O(c(i)) is equal to the product of the orders of cj modulo L-j-1(x), where 0 <= j <= i if p is odd, and i >= 2 and 1 <= j <= i if p = 2. We also show that for i >= 0, the Gal(L-i/Li-1)-conjugates of ai form a normal basis of L-i over Li-1. In addition, we obtain the minimal polynomial of c(1) over F-p in explicit form. (c) 2025 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.
引用
收藏
页数:13
相关论文
共 50 条