On Permutation Trinomials and Complete Permutation Polynomials via Fiber Criteria over Finite Fields
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866915832820400128 |
|---|---|
| author | Bouyacoub, Chahrazade El-Baz, Asmae Kihel, Omar |
| author_facet | Bouyacoub, Chahrazade El-Baz, Asmae Kihel, Omar |
| contents | We give new, short proofs of recent permutation polynomial results of Bousalmi, Bayad, and Derbal by reducing the verification to explicit computations on a three-element multiplicative subgroup via Zieve's fiber criterion. Building on this approach, we develop a general framework -- combining Zieve's theorem with the AGW criterion -- for constructing complete permutation polynomials over finite fields through a fiber decomposition over the cube roots of unity. A scalar specialization of the criterion yields families that are easy to produce and verify. We illustrate the construction with concrete examples and show through counterexamples that the underlying arithmetic conditions are sharp. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_03368 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On Permutation Trinomials and Complete Permutation Polynomials via Fiber Criteria over Finite Fields Bouyacoub, Chahrazade El-Baz, Asmae Kihel, Omar Number Theory We give new, short proofs of recent permutation polynomial results of Bousalmi, Bayad, and Derbal by reducing the verification to explicit computations on a three-element multiplicative subgroup via Zieve's fiber criterion. Building on this approach, we develop a general framework -- combining Zieve's theorem with the AGW criterion -- for constructing complete permutation polynomials over finite fields through a fiber decomposition over the cube roots of unity. A scalar specialization of the criterion yields families that are easy to produce and verify. We illustrate the construction with concrete examples and show through counterexamples that the underlying arithmetic conditions are sharp. |
| title | On Permutation Trinomials and Complete Permutation Polynomials via Fiber Criteria over Finite Fields |
| topic | Number Theory |
| url | https://arxiv.org/abs/2603.03368 |