Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Permutation polynomials from a linearized decomposition (2104.13234v1)

Published 27 Apr 2021 in math.NT

Abstract: In this paper we discuss the permutational property of polynomials of the form $f(L(x))+k(L(x))\cdot M(x)\in \mathbb F_{qn}[x]$ over the finite field $\mathbb F_{qn}$, where $L, M\in \mathbb F_q[x]$ are $q$-linearized polynomials. The restriction $L, M\in \mathbb F_q[x]$ implies a nice correspondence between the pair $(L, M)$ and the pair $(g, h)$ of conventional $q$-associates over $\mathbb F_q$ of degree at most $n-1$. In particular, by using the AGW criterion, permutational properties of our class of polynomials translates to some arithmetic properties of polynomials over $\mathbb F_q$, like coprimality. This relates the problem of constructing PPs of $\mathbb F_{qn}$ to the problem of factorizing $xn-1$ in $\mathbb F_q[x]$. We then specialize to the case where $L(x)$ is the trace polynomial from $\mathbb F_{qn}$ over $\mathbb F_q$, providing results on the construction of permutation and complete permutation polynomials, and their inverses. We further demonstrate that the latter can be extended to more general linearized polynomials of degree $q{n-1}$.

Summary

We haven't generated a summary for this paper yet.