José Alves Oliveira, F. E. Brochero Martínez
Let $\mathbb F_q$ denote the finite field with $q$ elements. In this paper we use the relationship between suitable polynomials and number of rational points on algebraic curves to give the exact number of elements $a\in \mathbb F_q$ for which the binomial $x^n(x^{(q-1)/r} + a)$ is a permutation polynomial in the cases $r = 2$ and $r = 3$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Let $f=ax+x^{r(q-1)+1}\in \mathbb{F}_{q^2}^*[x], r\in \{5,7\}.$ We give explicit conditions on the values $(q,a)$ for which $f$ is a permutation polynomials of $\mathbb{F}_{q^2}.$
Let $p$ be an odd prime and $e$ be a positive integer. We completely explain the permutation binomials and trinomials arising from the reversed Dickson polynomials of the $(k+1)$-th kind $D_{n,k}(1,x)$ over $\mathbb{F}_{p^e}$ when $n=p^l+2$, where $l\in \mathbb{N}$.
Let $q$ be a prime power and $n$ and $r$ be positive integers. It is well known that the linearized binomial $L_r(x)=x^{q^r}+ax\in\mathbb{F}_{q^n}[x]$ is a permutation polynomial if and only if $(-1)^{n/d}a^{{(q^n-1)}/{(q^{d}-1)}}\neq 1$ where $d=(n,r)$. In this paper, the compositional inverse of $L_r(x)$ is explicitly determined when this condition holds.
Let $\mathbb{F}_{q}$ be the finite field of characteristic $p$ containing $q = p^{r}$ elements and $f(x)=ax^{n} + x^{m}$ a binomial with coefficients in this field. If some conditions on the gcd of $n-m$ an $q-1$ are satisfied then this polynomial does not permute the elements of the field. We prove in particular that if $f(x) = ax^{n} + x^{m}$ permutes $\mathbb{F}_{p}$, where $n>m>0$ and $a \in {\mathbb{F}_{p}}^{*}$, then $p -1 \leq (d -1)d$, where $d = {gcd}(n-m,p-1)$, and that this bound of $p$ in term of $d$ only, is sharp. We show as well how to obtain in certain cases a permutation binom…
Suppose x^m + c*x^n is a permutation polynomial over GF(p), where p>5 is prime, m>n>0, and c is in GF(p)^*. We prove that gcd(m-n,p-1) is not 2 or 4. In the special case that either (p-1)/2 or (p-1)/4 is prime, this was conjectured in a recent paper by Masuda, Panario and Wang.
We prove that if x^m + c*x^n permutes the prime field GF(p), where m>n>0 and c is in GF(p)^*, then gcd(m-n,p-1) > sqrt{p} - 1. Conversely, we prove that if q>=4 and m>n>0 are fixed and satisfy gcd(m-n,q-1) > 2q*(log log q)/(log q), then there exist permutation binomials over GF(q) of the form x^m + c*x^n if and only if gcd(m,n,q-1) = 1.
Let $f=a\x+\x^{3q-2}\in\Bbb F_{q^2}[\x]$, where $a\in\Bbb F_{q^2}^*$. We prove that $f$ is a permutation polynomial of $\Bbb F_{q^2}$ if and only if one of the following occurs: (i) $q=2^e$, $e$ odd, and $a^{\frac{q+1}3}$ is a primitive $3$rd root of unity. (ii) $(q,a)$ belongs to a finite set which is determined in the paper.
After a brief review of existing results on permutation binomials of finite fields, we introduce the notion of equivalence among permutation binomials (PBs) and describe how to bring a PB to its canonical form under equivalence. We then focus on PBs of $\Bbb F_{q^2}$ of the form $X^n(X^{d(q-1)}+a)$, where $n$ and $d$ are positive integers and $a\in\Bbb F_{q^2}^*$. Our contributions include two nonexistence results: (1) If $q$ is even and sufficiently large and $a^{q+1}\ne 1$, then $X^n(X^{3(q-1)}+a)$ is not a PB of $\Bbb F_{q^2}$. (2) If $2\le d\mid q+1$, $q$ is sufficiently large and $a^{q+1}…
Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, communication theory and so on. Permutation binomials and trinomials attract people's interest due to their simple algebraic form and additional extraordinary properties. In this paper, several new classes of permutation binomials and permutation trinomials are constructed. Some of these permutation polynomials are generalizations of known ones.
In this note, a criterion for a class of binomials to be permutation polynomials is proposed. As a consequence, many classes of binomial permutation polynomials and monomial complete permutation polynomials are obtained. The exponents in these monomials are of Niho type.
We present several existence and nonexistence results for permutation binomials of the form $x^r(x^{q-1}+a)$, where $e\geq 2$ and $a\in \mathbb{F}_{q^e}^*$. As a consequence, we obtain a complete characterization of such permutation binomials over $\mathbb{F}_{q^2}$, $\mathbb{F}_{q^3}$, $\mathbb{F}_{q^4}$, $\mathbb{F}_{p^5}$, and $\mathbb{F}_{p^6}$, where $p$ is an odd prime.
Sparse Lifts of q-Linearized Permutation Polynomials with Explicit Inverses
该研究构造了保持复合逆的q线性化置换多项式的稀疏提升，得到二维二项式、三维三项式等的显式逆，为有限域上置换多项式的构造提供了新方法。
In this work, we completely characterize (i) permutation binomials of the form $x^{{{2^n -1}\over {2^t-1}}+1}+ ax \in \mathbb{F}_{2^n}[x], n = 2^st, a \in \mathbb{F}_{2^{2t}}^{*}$, and (ii) permutation trinomials of the form $x^{2^s+1}+x^{2^{s-1}+1}+αx \in \mathbb{F}_{2^t}[x]$, \end{enumerate} where $s,t$ are positive integers. The first result, which was our primary motivation, is a consequence of the second result. The second result may be of independent interest.
Permutation polynomials have many applications in finite fields theory, coding theory, cryptography, combinatorial design, communication theory, and so on. Permutation binomials of the form $x^{r}(x^{q-1}+a)$ over $\mathbb{F}_{q^2}$ have been studied before, K. Li, L. Qu and X. Chen proved that they are permutation polynomials if and only if $r=1$ and $a^{q+1}\not=1$. In this paper, we consider the same binomial, but over finite fields $\mathbb{F}_{q^3}$ and $\mathbb{F}_{q^e}$. Two different kinds of methods are employed, and some partial results are obtained for them.
A classification of permutation binomials of the form $x^i+ax$ over $\mathbb{F}_{2^n}$ for dimensions up to 8
本文对$\mathbb{F}_{2^n}$（$n\leq8$）上形如$x^i+ax$的置换二项式进行分类，刻画了三类新的置换二项式，其中一类指标为$\frac{q^2+q+1}{3}$。
Let $q>2$ be a prime power and $f={\tt x}^{q-2}+t{\tt x}^{q^2-q-1}$, where $t\in\Bbb F_q^*$. It was recently conjectured that $f$ is a permutation polynomial of $\Bbb F_{q^2}$ if and only if one of the following holds: (i) $t=1$, $q\equiv 1\pmod 4$; (ii) $t=-3$, $q\equiv \pm1\pmod{12}$; (iii) $t=3$, $q\equiv -1\pmod 6$. We confirm this conjecture in the present paper.
Wendt's determinant and finiteness of prime characteristics for permutation binomials
本研究针对置换二项式，结合Wendt行列式，证明对固定参数，仅有限个素特征存在满足条件的置换二项式，确定了特定情形下的可允许特征及相关整除条件。
Construction of Permutation Polynomials of Certain Specific Cycle Structure over Finite Fields
本文针对奇数阶有限域，构造了具有特定圈结构的置换二项式和置换三项式族，包括具有一个不动点且其余元素构成等长互斥圈的置换，以及具有特定频率的多长度圈置换多项式。
A complete classification of permutation binomials of the form $X^r(X^{q-1}+a)$ over finite fields
本文完整分类了有限域上形如 $X^r(X^{q-1}+a)$ 的置换二项式，给出充要条件并证明 Masuda 等人的猜想，同时确定置换函数数量并推广到更广族。
Permutation binomials of the form $X^r(X^{q-1}+a)$ over finite fields
本文完整刻画了形如 $X^r(X^{q-1}+a)$ 的二项式在有限域上成为置换的条件，并证明了 Masuda--Rubio--Santiago 猜想。
In this paper we compute the exact divisibility of exponential sums associated to binomials $F(X)=aX^{d_1} +b X^{d_2}$. In particular, for the case where $\max\{d_1,d_2\}\leq\sqrt{p-1}$, the exact divisibility is computed. As a byproduct of our results, we obtain families of binomials that do not permute $\mathbb{F}_p$, and a lower bound for the sizes of value sets of binomials over $\mathbb{F}_p$. Additionally, we obtain a new criterion to determine if a polynomial defines or not a permutation of $\mathbb{F}_p$ that depends on the divisibility of the exponential sum associated to the polynomi…
Permutation polynomials over finite fields from low-degree rational functions
该研究利用$F_q$上低次置换有理函数，构造出偶特征$F_{q^2}$上两类置换二项式与六类置换五项式，且证明其与已有结果拟乘法不等价，丰富了有限域置换多项式的构造结果。
Further Investigation on Cyclotomic Mapping Permutation Polynomials over Finite Fields
本文研究了有限域上分圆映射置换多项式与特定形式置换多项式的关系，提出新的判定条件，并据此构造了若干置换三项式和二项式。
We prove congruences, modulo a power of a prime p, for certain finite sums involving central binomial coefficients $\binom{2k}{k}$.
We consider various counting questions for irreducible binomials over finite fields. We use various results from analytic number theory to investigate these questions.
High order elements in extensions of finite fields given by binomials
本文研究了有限域扩展中高阶元素的构造方法，通过二项式形式显式生成具有高阶的元素。
We present a survey on Weil sums in which an additive character of a finite field $F$ is applied to a binomial whose individual terms (monomials) become permutations of $F$ when regarded as functions. Then we indicate how these Weil sums are used in applications, especially how they characterize the nonlinearity of power permutations and the correlation of linear recursive sequences over finite fields. In these applications, one is interested in the spectrum of Weil sum values that are obtained as the coefficients in the binomial are varied. We review the basic properties of such spectra, and …
Let $r$ be a positive integer, $h(X)\in\Bbb F_{q^2}[X]$, and $μ_{q+1}$ be the subgroup of order $q+1$ of $\Bbb F_{q^2}^*$. It is well known that $X^rh(X^{q-1})$ permutes $\Bbb F_{q^2}$ if and only if $\text{gcd}(r,q-1)=1$ and $X^rh(X)^{q-1}$ permutes $μ_{q+1}$. There are many ad hoc constructions of permutation polynomials of $\Bbb F_{q^2}$ of this type such that $h(X)^{q-1}$ induces monomial functions on the cosets of a subgroup of $μ_{q+1}$. We give a general construction that can generate, through an algorithm, {\em all} permutation polynomials of $\Bbb F_{q^2}$ with this property, includin…
A polynomial $f(x)$ over a field $K$ is said to be stable if all its iterates are irreducible over $K$. L. Danielson and B. Fein have shown that over a large class of fields $K$, if $f(x)$ is an irreducible monic binomial, then it is stable over $K$. In this paper it is proved that this result no longer holds over finite fields. Necessary and sufficient conditions are given in order that a given binomial is stable over $\mathbb{F}_q$. These conditions are used to construct a table listing the stable binomials over $\mathbb{F}_q$ of the form $f(x)=x^d-a$, $a\in\mathbb{F}_q\setminus\{0,1\}$, for…
We present various constructions of sequences of polynomials satisfying the Binomial Theorem in finite characteristic based on the theory of additive polynomials. Various actions on these constructions are also presented. It is an open question whether we then have accounted for all sequences in finite characteristic which satisfy the Binomial Theorem.
The origin of this study is based on not only explicit formulas of finite sums involving higher powers of binomial coefficients, but also explicit evaluations of generating functions for this sums. It should be emphasized that this study contains both new results and literature surveys about some of the related results that have existed so far. With the aid of hypergeometric function, generating functions for a new family of the combinatorial numbers, related to finite sums of powers of binomial coefficients, are constructed. By using these generating functions, a number of new identities have…
Let $\mathbb{F}_q$ be the finite field with $q$ elements, and $T$ a positive integer. In this article we find a sharp estimative of the total number of monic irreducible binomials in $\mathbb F_q[x]$ of degree less or equal to $T$, when $T$ is large enough.
Permutation polynomials over finite fields are an interesting and constantly active research subject of study for many years. They have important applications in areas of mathematics and engineering. In recent years, permutation binomials and permutation trinomials attract people's interests due to their simple algebraic forms. In this paper, by reversely using Tu's method for the characterization of permutation polynomials with exponents of Niho type, we propose a new method to construct permutation trinomials with coefficients 1. Moreover, we give the explicit compositional inverses of a cla…
We investigate when the sequence of binomial coefficients \binom{k}{i} modulo a prime p, for a fixed positive integer k, satisfies a linear recurrence relation of (positive) degree h in the finite range 0\le i\le k. In particular, we prove that this cannot occur if 2h\le k<p-h. This hypothesis can be weakened to 2h\le k<p if we assume, in addition, that the characteristic polynomial of the relation does not have -1 as a root. We apply our results to recover a known bound for the number of points of a Fermat curve over a finite field.
Let F be a finite extension of Q_p. We show that every Schwartz function on F, with values in an algebraic closure of Q_p, is the uniform limit of a sequence of Schwartz functions, whose Fourier transforms tend uniformly to 0. The proof uses the notion of q-binomial coefficients and some classical identities between them.
We present new classes of permutation polynomials over finite fields.
A $q$-analogue of Boyadzhiev-Mneimneh-type binomial sums of finite multi-polylogarithms
该研究给出有限多重多重对数的Boyadzhiev-Mneimneh型二项式和的$q$-模拟公式，其$q\ o1$极限等价于Sakugawa-Seki恒等式，还给出对应柯西二项式定理的该类和的公式。
We prove an asymptotic formula for the number of permutation for which the associated permutation polynomial has degree smaller than $q-2$.
This paper is a study of power series, where the coefficients are binomial expressions (iterated finite differences). Our results can be used for series summation, for series transformation, or for asymptotic expansions involving Stirling numbers of the second kind. In certain cases we obtain asymptotic expansions involving Bernoulli polynomials, poly-Bernoulli polynomials, or Euler polynomials. We also discuss connections to Euler series transformations and other series transformation formulas.
In this paper, a construction of complete permutation polynomials over finite fields of even characteristic proposed by Tu et al. recently is generalized in a recursive manner. Besides, several classes of complete permutation polynomials are derived by computing compositional inverses of known ones.
In this note, we give a shorter proof of the result of Zheng, Yu, and Pei on the explicit formula of inverses of generalized cyclotomic permutation polynomials over finite fields. Moreover, we characterize all these cyclotomic permutation polynomials that are involutions. Our results provide a fast algorithm (only modular operations are involved) to generate many classes of generalized cyclotomic permutation polynomials, their inverses, and involutions.
By using the piecewise method, Lagrange interpolation formula and Lucas' theorem, we determine explicit expressions of the inverses of a class of reversed Dickson permutation polynomials and some classes of generalized cyclotomic mapping permutation polynomials over finite fields of characteristic three.
We investigate the permutation property of polynomials of the form $x^{r}(x^{s} -a)^{t}$, and give the expressions of their inverses. In particular, explicit expressions of inverses of permutation polynomials $x(x^3 -a)^2$ and $x(x^2 -a)^3$ on $\mathbb{F}_{7^n}$ are presented. Then, using some known results, we obtain the inverses of all permutation polynomials of degree $6, 7, 8$ over finite fields.
We show that all permutations in $S_n$ can be generated by affine unicritical polynomials. We use the $\operatorname{PGL}$ group structure to compute the cycle structure of permutations with low Carlitz rank. The tree structure of the group generated by shift and inversion maps is used to study the randomness properties of permutation polynomials.
Permutation polynomials with coefficients 1 over finite fields attract researchers' interests due to their simple algebraic form. In this paper, we first construct four classes of fractional permutation polynomials over the cyclic subgroup of $ \mathbb{F}_{2^{2m}} $. From these permutation polynomials, three new classes of permutation polynomials with coefficients 1 over $ \mathbb{F}_{2^{2m}} $ are constructed, and three more general new classes of permutation polynomials with coefficients 1 over $ \mathbb{F}_{2^{2m}} $ are constructed using a new method we presented recently. Some known permu…
A Recursive Construction of Permutation Polynomials over $\mathbb{F}_{q^2}$ with Odd Characteristic from Rédei Functions
本文利用有理Rédei函数递归构造了奇特征$\mathbb{F}_{q^2}$上的两类置换多项式，完整刻画了其合成逆，并给出了易于验证的置换条件及若干二项式、三项式实例，发现此类多项式数量庞大。
Determination of Some Types of Permutations over $\mathbb{F}_q^2$ with Low-Degree
本研究针对有限域上置换刻画的经典数论问题，运用Hermite准则与置换有理函数理论，分别完成二元二次、二元3次齐次低次置换多项式系统的完全分类，并明确刻画了$\boldsymbol{\text{F}}_{q^2}$上一类置换二项式，解决了该领域的重要特例。
Quadratically enriched binomial coefficients over a finite field
本文研究了有限域上二次富集的二项式系数，通过双线性形式扩展帕斯卡三角，并利用A^1同伦论在非代数闭域上进行曲线计数。
Let $q$ be a prime power, $2\le r\le q$, and $f=a{\tt X}+{\tt X}^{r(q-1)+1}\in\Bbb F_{q^2}[{\tt X}]$, where $a\ne 0$. The conditions on $r,q,a$ that are necessary and sufficient for $f$ to be a permutation polynomial (PP) of ${\Bbb F}_{q^2}$ are not known. (Such conditions are known under an additional assumption that $a^{q+1}=1$.) In this paper, we prove the following: (i) If $f$ is a PP of ${\Bbb F}_{q^2}$, then $\text{gcd}(r,q+1)>1$ and $(-a)^{(q+1)/\text{gcd}(r,q+1)}\ne 1$. (ii) For a fixed $r>2$ and subject to the conditions that $q+1\equiv 0\pmod r$ and $a^{q+1}\ne 1$, there are only fin…
The Minimal Binomial Multiples of Polynomials over Finite Fields
本文引入有限域上多项式的最小二项式倍式，利用根式定义集刻画其结构并给出无二项式判别准则，进而确定最小距离为2的 $\lambda$-常循环码。
We show that many quadratic binomial functions on a finite field of characteristic 2 are not APN infinitely often. This is of interest in the light of recent discoveries of new families of quadratic binomial APN functions. The proof uses the Weil bound from algebraic geometry.
In \cite{D1}, Dickson listed all permutation polynomials up to degree 5 over an arbitrary finite field, and all permutation polynomials of degree 6 over finite fields of odd characteristic. The classification of degree 6 permutation polynomials over finite fields of characteristic 2 was left incomplete. In this paper we complete the classification of permutation polynomials of degree 6 over finite fields of characteristic 2. In addition, all permutation polynomials of degree 7 over finite fields of characteristic 2 are classified.
In this paper, we present three classes of complete permutation monomials over finite fields of odd characteristic. Meanwhile, the compositional inverses of these complete permutation polynomials are also proposed.
For non-negative integers $k\leq n$, we prove a combinatorial identity for the $p$-binomial coefficient $\binom{n}{k}_p$ based on abelian p-groups. A purely combinatorial proof of this identity is not known. While proving this identity, for $r\in \mathbb{N}\cup\{0\},s\in \mathbb{N}$ and $p$ a prime, we present a purely combinatorial formula for the number of subgroups of $\mathbb{Z}^s$ of finite index $p^r$ with quotient isomorphic to the finite abelian $p$-group of type $\underlineλ$, which is a partition of $r$ into at most $s$ parts. This purely combinatorial formula is similar to that for …
Let $F_q$ be a field with $q$ elements, where $q$ is a power of a prime number $p\geq 5$. For any integer $m\geq 2$ and $a\in F_q^*$ such that the polynomial $x^m-a$ is irreducible in $F_q[x]$, we combine two different methods to construct explicitly elements of high order in the field $F_q[x]/\langle x^m-a\rangle $. Namely, we find elements with multiplicative order of at least $5^{\sqrt[3]{m/2}}$, which is better than previously obtained bound for such family of extension fields.
We describe several families of permutation polynomials obtained using functions with linear translators.
For the finite field $\mathbb{F}_{2^{3m}}$, permutation polynomials of the form $(x^{2^m}+x+δ)^{s}+cx$ are studied. Necessary and sufficient conditions are given for the polynomials to be permutation polynomials. For this, the structures and properties of the field elements are analyzed.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。