arXiv 0810.28302008-10-16math.NTmath.CO

Classes of permutation polynomials based on cyclotomy and an additive analogue

Michael E. Zieve

备注：: 8 pages. Dedicated to Mel Nathanson on the occasion of his sixtieth birthday
发表信息：: in book: Additive Number Theory (Springer 2010) 355-359

英文摘要：

I present a construction of permutation polynomials based on cyclotomy, an additive analogue of this construction, and a generalization of this additive analogue which appears to have no multiplicative analogue. These constructions generalize recent results of J. Marcos from arXiv:0810.2738v1.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Cyclotomy and permutation polynomials of large indices

We use cyclotomy to design new classes of permutation polynomials over finite fields. This allows us to generate many classes of permutation polynomials in an algorithmic way. Many of them are permutation polynomials of large indices.

2012-09-18math.NT

排列中的子序列和

Subsequence sums in permutations

Community College of Aurora（奥罗拉社区学院）；University of Denver（丹佛大学）；University of Johannesburg（约翰内斯堡大学）

本文证明对于任意k≥3，当n足够大时，{1,2,…,n}的每个排列都包含长度为k的2-加性子序列，并给出了最小n的多项式界，同时研究了单调子序列和算术拉姆齐理论中的类似结果。

2026-08-14math.COmath.NT

Some new problems in additive combinatorics

In this paper we investigate some new problems in additive combinatorics. Our problems mainly involve permutations (or circular permutations) $n$ distinct numbers (or elements of an additive abelian group) $a_1,\ldots,a_n$ with adjacent sums $a_i+a_{i+1}$ (or differences $a_i-a_{i+1}$) pairwise distinct. For an odd prime power $q=2n+1>13$ with $q\not=25$, we show that there is a circular permutation $(a_1,\ldots,a_n)$ of the elements of $S=\{a^2:\ a\in\mathbb F_q\setminus\{0\}\}$ such that $\{a_1+a_2,\ldots,a_{n-1}+a_n,a_n+a_1\}=S$, where $\mathbb F_q$ denotes the field of order $q$. For any f…

2020-03-02math.COmath.NT

Permutation polynomials of the form x+c*Tr(x^k)

Let F_{q^n} be the field of order q^n, and let Tr be the trace map from F_{q^n} to its q-element subfield. We exhibit nine sequences of polynomials of the form f(x):=x+c*Tr(x^k), with c in F_{q^n}, such that for each polynomial the function F_{q^n}-->F_{q^n} given by c-->f(c) is a permutation of F_{q^n}. We also computed all permutation polynomials of this form over finite fields of size less than 5000, and found that our examples comprise all examples with n>1 except for some simple cases where the polynomial induces a homomorphism of the additive group of F_{q^n}, along with a few sporadic e…

2016-03-03math.COmath.NT

The additive index of polynomials over finite fields

In this paper we introduce the additive analogue of the index of a polynomial over finite fields. We study several problems in the theory of polynomials over finite fields in terms of their additive indices, such as value set sizes, bounds on multiplicative character sums, and characterizations of permutation polynomials.

2021-05-05math.NT

置换多项式的更高层完备性

Higher Level Completeness for Permutation Polynomials

本文在奇特征有限域中推广了完备置换多项式的概念，定义了 $k\ge1$ 层的完备性，并构造了四个满足高层完备性条件的多项式族，证明了其中两个族在函数复合下分别同构于加法群和乘法群。

2023-10-19cs.CRmath.COmath.NT

更多相关论文收起更多论文

A general construction of regular complete permutation polynomials

Let $r\geq 3$ be a positive integer and $\mathbb{F}_q$ the finite field with $q$ elements. In this paper, we consider the $r$-regular complete permutation property of maps with the form $f=τ\circσ_M\circτ^{-1}$ where $τ$ is a PP over an extension field $\mathbb{F}_{q^d}$ and $σ_M$ is an invertible linear map over $\mathbb{F}_{q^d}$. We give a general construction of $r$-regular PPs for any positive integer $r$. When $τ$ is additive, we give a general construction of $r$-regular CPPs for any positive integer $r$. When $τ$ is not additive, we give many examples of regular CPPs over the extension…

2022-12-25cs.ITmath.ITmath.NT

Low-degree permutation rational functions over finite fields

We determine all degree-4 rational functions f(X) in F_q(X) which permute P^1(F_q), and answer two questions of Ferraguti and Micheli about the number of such functions and the number of equivalence classes of such functions up to composing with degree-one rational functions. We also determine all degree-8 rational functions f(X) in F_q(X) which permute P^1(F_q) in case q is sufficiently large, and do the same for degree 32 in case either q is odd or f(X) is a nonsquare. Further, for most other positive integers n<4096, for each sufficiently large q we determine all degree-n rational functions…

2023-02-27math.NT

关于有限域上形如$h(ψ(x))φ(x)+g(ψ(x))$的置换多项式的逆元

On the inverses of permutation polynomials of the form $h(ψ(x))φ(x)+g(ψ(x))$ over finite fields

School of Computer Science and Technology, Dongguan University of Technology（东莞理工学院计算机学院）；School of Mathematics, South China Normal University（华南师范大学数学学院）

研究有限域上形如$h(ψ(x))φ(x)+g(ψ(x))$的置换多项式的合成逆元，其中$ψ(x)$等为加法多项式，通过特定条件和多项式$\bar{\psi}(x)$来探讨。

2026-07-07math.NT

Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach

Let $\tilde{f}(X)\in\mathbb{Z}[X]$ be a degree-$n$ polynomial such that $f(X):=\tilde{f}(X)\bmod p$ factorizes into $n$ distinct linear factors over $\mathbb{F}_p$. We study the problem of deterministically factoring $f(X)$ over $\mathbb{F}_p$ given $\tilde{f}(X)$. Under the generalized Riemann hypothesis (GRH), we give an improved deterministic algorithm that computes the complete factorization of $f(X)$ in the case that the Galois group of $\tilde{f}(X)$ is (permutation isomorphic to) a linear group $G\leq \mathrm{GL}(V)$ on the set $S$ of roots of $\tilde{f}(X)$, where $V$ is a finite-dimen…

2020-08-04cs.CCmath.NT