2018/04/04 by Daniele Bartoli, Bartoli, Daniele
Computer Science · Mathematics · #Algebraic Geometry and Number Theory #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #math.CO
paper · pdf · doi:10.48550/arxiv.1804.01305
arxiv created 2018/04/04 · openalex publication_date 2018/04/04 · arxiv updated 2018/04/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider four classes of polynomials over the fields \mathbbFq3, q=ph, p>3, f1(x)=xq2+q-1+Axq2-q+1+Bx, f2(x)=xq2+q-1+Axq3-q2+q+Bx, f3(x)=xq2+q-1+Axq2-Bx, f4(x)=xq2+q-1+Axq-Bx, where A,B ∈ \mathbbFq. We determine conditions on the pairs (A,B) and we give lower bounds on the number of pairs (A,B) for which these polynomials permute \mathbbFq3.