相关论文: Permutational behavior of reversed Dickson polynom…

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…

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…

The main question of this paper is the following: how much cancellation can the partial sums restricted to the $k$-free integers up to $x$ of a $\pm 1$ multiplicative function $f$ be in terms of $x$? Building upon the recent paper by Q.…

Let $N_\sigma(\pi)$ denote the number of occurrences of a permutation pattern $\sigma\in S_k$ in a permutation $\pi\in S_n$. Gaetz and Ryba (2021) showed using partition algebras that the $d$-th moment $M_{\sigma,d,n}(\pi)$ of $N_\sigma$ on…

Let $p$ be a prime, $q=p^n$, and $D \subset \mathbb{F}_q^*$. A celebrated result of McConnel states that if $D$ is a proper subgroup of $\mathbb{F}_q^*$, and $f:\mathbb{F}_q \to \mathbb{F}_q$ is a function such that $(f(x)-f(y))/(x-y) \in…

We obtain new combinatorial formulae for modified Hall--Littlewood polynomials, for matrix elements of the transition matrix between the elementary symmetric functions and Hall-Littlewood's ones, and for the number of rational points over…

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…

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…

Let $\mathbb{F}_{q}$ be a finite field, $\mathbb{F}_{q^s}$ be an extension of $\mathbb{F}_q$, let $f(x)\in \mathbb{F}_q[x]$ be a polynomial of degree $n$ with $\gcd(n,q)=1$. We present a recursive formula for evaluating the exponential sum…

Let $\mathbb{F}_{q}$ be a finite field, $\mathbb{F}_{q^s}$ be an extension of $\mathbb{F}_q$, let $f(x)\in \mathbb{F}_q[x]$ be a polynomial of degree $n$ with $\gcd(n,q)=1$. We present a recursive formula for evaluating the exponential sum…

The proof of the theorem concerning to the inverse cyclotomic Discrete Fourier Transform algorithm over finite field is provided.

We formulate directed percolation in (1+1) dimensions in the language of a reaction-diffusion process with exclusion taking place in one space dimension. We map the master equation that describes the dynamics of the system onto a quantum…

Let $\mathbb{F}_q[t]$ denote the ring of polynomials over the finite field $\mathbb{F}_q$. Building off of techniques of Balog and Ruzsa and of Keil in the integer setting, we determine the precise order of magnitude of $k$th moments of…

In this paper we compute the sum of the $k$-th powers over any finite commutative unital rings, thus generalizing known results for finite fields, the rings of integers modulo $n$ or the ring of Gaussian integers modulo $n$. As an…

We construct four new classes of permutation trinomials over the cubic extension of a finite field with even characteristic. Additionally, we explicitly provide the compositional inverse of each class of permutation trinomials in polynomial…

The construction of permutation trinomials over finite fields attracts people's interest recently due to their simple form and some additional properties. Motivated by some results on the construction of permutation trinomials with Niho…

For each odd prime power q, and each integer k, we determine the sum of the k-th powers of all elements x in F_q for which both x and x+1 are squares in F_q^*. We also solve the analogous problem when one or both of x and x+1 is a…

We consider rational functions of the form $V(x)/U(x)$, where both $V(x)$ and $U(x)$ are polynomials over the finite field $\mathbb{F}_q$. Polynomials that permute the elements of a field, called {\it permutation polynomials ($PPs$)}, have…

Dickson's Lemma is a simple yet powerful tool widely used in termination proofs, especially when dealing with counters or related data structures. However, most computer scientists do not know how to derive complexity upper bounds from such…

We establish a new asymptotic formula for the number of polynomials of degree $n$ with $k$ prime factors over a finite field $\mathbb{F}_q$. The error term tends to $0$ uniformly in $n$ and in $q$, and $k$ can grow beyond $\log n$.…