English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

The $k$th Dickson polynomial of the first kind, $D_k(x) \in {\mathbb Z}[x]$,is determined by the formula: $D_k(u+1/u) = u^k + 1/u^k$, where $k \ge 0$ and$u$ is an indeterminate. These polynomials are closely related to Chebyshevpolynomials and have been widely studied. Leonard Eugene Dickson proved in 1896that $D_k(x)$ is a permutation polynomial on ${\mathbb F}_{p^n}$, $p$ prime, ifand only if GCD$(k,p^{2n}-1)=1$, and his result easily carries over toChebyshev polynomials when $p$ is odd. This article continues on this theme, aswe find special subsets of ${\mathbb F}_{p^n}$ that are stabilized or permutedby Dickson or Chebyshev polynomials. Our analysis also leads to a factorizationformula for Dickson and Chebyshev polynomials and some new results inelementary number theory. For example, we show that if $q$ is an odd primepower, then $\prod\left\{ a \in{\mathbb F}_q^\times : \text{$a$ and $4-a$ arenonsquares} \right\} = 2$.

Permutation properties of Dickson and Chebyshev polynomials and connections to number theory