中文
相关论文

相关论文: Enumerating Permutation Polynomials over finite fi…

200 篇论文

Recently, Jiang et al. \cite{JIANG2025102522} obtained several classes of Permutation Polynomial of the form $x+\gamma\operatorname{Tr}_q^{q^2}(h(x))$ over finite fields $\mathbb{F}_{q^2},q=2^n$. In this paper, we find the compositional…

数论 · 数学 2026-04-22 Rajesh P. Singh , Dinesh Kumar , Jitendra Prakash

Permutation polynomials over finite fields have taken an important role in vast areas in mathematics as well as engineering. Recently, Tu et al. gave some classes of complete permutation polynomials over finite fields of even…

数论 · 数学 2014-04-14 Kitae Kim , Ikkwon Yie

For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…

数论 · 数学 2022-10-31 Geoffrey Price , Katherine Thompson

We prove asymptotic formulas for the complex coefficients of $(\zeta q;q)_\infty^{-1}$, where $\zeta$ is a root of unity, and apply our results to determine secondary terms in the asymptotics for $p(a,b,n)$, the number of integer partitions…

数论 · 数学 2022-08-30 Walter Bridges , Johann Franke , Taylor Garnowski

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…

数论 · 数学 2013-10-08 Ariane M. Masuda , Michael E. Zieve

Recently, P. Yuan presented a local method to find permutation polynomials and their compositional inverses over finite fields. The work of P. Yuan inspires us to compute the compositional inverses of three classes of the permutation…

数论 · 数学 2024-10-16 Danyao Wu , Pingzhi Yuan

In this paper we present an explicit formula for the number of permutations with a given number of alternating descents. Moreover, we study the interlacing property of the real parts of the zeros of the generating polynomials of these…

组合数学 · 数学 2015-04-10 Shi-Mei Ma , Yeong-Nan Yeh

We determine a set of permutation patterns $q$ so that the number of permutations with $r$ occurrences of $q$ is asymptotically $n^r$ times the number of permutations avoiding $q$, partially settling a conjecture of Conway and Guttman. We…

组合数学 · 数学 2026-03-24 Michael Waite

We establish new estimates for the number of $m$-smooth polynomials of degree $n$ over a finite field $\mathbb{F}_q$, where the main term involves the number of $m$-smooth permutations on $n$ elements. Our estimates imply that the…

数论 · 数学 2023-10-04 Ofir Gorodetsky

In this note we prove a conjecture by Li, Qu, Li, and Fu on permutation trinomials over $\mathbb{F}_3^{2k}$. In addition, new examples and generalizations of some families of permutation polynomials of $\mathbb{F}_{3^k}$ and…

组合数学 · 数学 2017-08-17 Daniele Bartoli , Massimo Giulietti

Permutation polynomials have been a subject of study for a long time and have applications in many areas of science and engineering. However, only a small number of specific classes of permutation polynomials are described in the literature…

信息论 · 计算机科学 2014-02-25 Cunsheng Ding , Longjiang Qu , Qiang Wang , Jin Yuan , Pingzhi Yuan

In this paper, we give several asymptotic formulas for the number of multiplicatively dependent vectors of algebraic numbers of fixed degree, or within a fixed number field, and bounded height.

We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…

代数几何 · 数学 2009-10-16 Arnaud Bodin

In this article we establish the asymptotic behavior of generating functions related to the exponential sum over finite fields of elementary symmetric functions and their perturbations. This asymptotic behavior allows us to calculate the…

In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…

数论 · 数学 2018-02-06 Arturas Dubickas , Min Sha

For an odd prime power $q$ satisfying $q\equiv 1\pmod 3$ we construct totally $2(q-1) $ permutation polyomials, all giving involutory permutations with exactly $ 1+ \frac{q-1}3$ fixed points. Among them $(q-1)$ polynomials are trinomials,…

组合数学 · 数学 2023-06-30 P Vanchinathan , Kevinsam B

We study the number of ways to decompose a monic polynomial in F_q[t] of degree n as a sum of two monic irreducible polynomials in F_q[t]. Our principal result is an asymptotic formula for the number of such representations in the case when…

数论 · 数学 2009-12-10 Andreas O. Bender , Paul Pollack

In this paper, we further investigate the local criterion and present a class of permutation polynomials and their compositional inverses over $ \mathbb{F}_{q^2}$. Additionally, we demonstrate that linearized polynomial over…

数论 · 数学 2024-09-30 Danyao Wu , Pingzhi Yuan

We give a formula and an estimation for the number of irreducible polynomials in two (or more) variables over a finite field.

交换代数 · 数学 2007-06-11 Arnaud Bodin

In 2019, Xiang Fan \cite{xfan} classified all permutation polynomials of degree $7$ over finite fields of odd characteristics. In this paper, we use this classification to determine the complete list of degree $7$ orthomorphism polynomials…

数论 · 数学 2026-01-30 Bhitali Kousik , Dhiren Kumar Basnet