English
Related papers

Related papers: Nonexistence of permutation binomials of certain s…

200 papers

By a very simple argument, we prove that if $l,m,n$ are nonnegative integers then $$\sum_{k=0}^l(-1)^{m-k}\binom{l}{k}\binom{m-k}{n}\binom{2k}{k-2l+m} =\sum_{k=0}^l\binom{l}{k}\binom{2k}{n}\binom{n-l}{m+n-3k-l}. On the basis of this…

Combinatorics · Mathematics 2007-05-23 Hao Pan , Zhi-Wei Sun

Let $p$ be a prime and let $a$ be a positive integer. In this paper we investigate $\sum_{k=0}^{p^a-1}\binom[(h+1)k,k+d]/m^k$ modulo a prime $p$, where $d$ and $m$ are integers with $-h<d<=p^a$ and $m\not=0 (mod p)$. We also study…

Number Theory · Mathematics 2009-09-28 Zhi-Wei Sun

Let $p$ be an odd prime number. We prove that for $m\equiv1\mod p$, $x^m$ is perfectly nonlinear over $\mathbb{F}_{p^n}$ for infinitely many $n$ if and only if $m$ is of the form $p^l+1$, $l\in\mathbb{N}$. First, we study singularities of…

Number Theory · Mathematics 2012-05-04 Elodie Leducq

We discuss the existence of zero coefficients in the powers of the determinant polynomial of order $n$. D. G. Glynn proved that the coefficients of the $m$th power of the determinant polynomial are all nonzero, if $m = p-1$ with a prime…

Combinatorics · Mathematics 2021-04-05 Minoru Itoh , Jimpei Shimoyoshi

Let $f=a{\tt x} +b{\tt x}^q+{\tt x}^{2q-1}\in\Bbb F_q[{\tt x}]$. We find explicit conditions on $a$ and $b$ that are necessary and sufficient for $f$ to be a permutation polynomial of $\Bbb F_{q^2}$. This result allows us to solve a related…

Number Theory · Mathematics 2013-09-16 Xiang-dong Hou

Let $\mathbb{F}_p$ be a prime field of order $p,$ and $A$ be a set in $\mathbb{F}_p$ with $|A| \leq p^{1/2}.$ In this note, we show that \[\max\{|A+A|, |f(A, A)|\}\gtrsim |A|^{\frac{6}{5}+\frac{4}{305}},\] where $f(x, y)$ is a…

Combinatorics · Mathematics 2019-04-17 Mozhgan Mirzaei

In this note, we prove an irreducibility criterion for the polynomial of the form $f(x) = a_{n}x^{n} + a_{n-1}x^{n-1} + \cdots + a_{m}x^{m} + p^{u} \in \mathbb{Z}[x]$, where $p$ is a prime number, $u \geqslant 1$, $\gcd(u, m) = 1$, $p \nmid…

Number Theory · Mathematics 2023-03-08 Zhang Weilin , Yuan Pingzhi

We estimate from below the lower density of the set of prime numbers p such that p-1 has a prime factor of size at least p^c, where c lies in between 1/4 and 1/2. We also establish upper and lower bounds on the counting function of the set…

Number Theory · Mathematics 2017-04-13 Florian Luca , Ricardo Menares , Amalia Pizarro-Madariaga

Let $p$ be a prime and $n$ be a positive integer. Let $f_b(X)=X+(X^p-X+b)^{-1}$, where $b\in\Bbb F_{p^n}$ is such that $\text{Tr}_{p^n/p}(b)\ne 0$. In 2008, Yuan et al. \cite{Yuan-Ding-Wang-Pieprzyk-FFA-2008} showed that for $p=2,3$, $f_b$…

Number Theory · Mathematics 2020-01-07 Xiang-dong Hou , Christopher Sze

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$…

Number Theory · Mathematics 2013-11-12 Baofeng Wu

I considered definition and properties of polynomial in no-commutative algebra. There exists polynomial which has finite, infinite or empty set of roots. For instance, the polynomial $$p_1(x)=ix-xi-1$$ have no root and the polynomial…

General Mathematics · Mathematics 2021-12-02 Aleks Kleyn

It is an open problem whether $ \binom{2n}{n} $ is divisible by 4 or 9 for all $n>256$. In connection with this, we prove that for a fixed uneven $m$ the asymptotic density of $k$'s such that $ m \nmid \binom{2^{k+1}}{2^{k}} $ is 0. To do…

For a polynomial $f(X)=AX^d+C \in \mathbb{F}_p[X]$ with $A\neq 0$ and $d\geq 2$, we prove that if $d\;|\;p-1$ and $f^i(0)\neq f^j(0)$ for $0\leq i<j\leq N$, then $\#f^N(\mathbb{F}_p) \sim \frac{2p}{(d-1)N},$ where $f^N$ is the $N$-th…

Number Theory · Mathematics 2020-10-29 Rufei Ren

Let $p$ be a prime, $m$ be a positive integer ( $m \geq 1$, and $m \geq 2$ if $p=2$), and $\chi_n$ be a multiplicative complex character on $\mathbb F^*_{p^m}$ with order $n| (p^m-1)$. We show that a partition $\mathcal A_1 \cup \mathcal…

Number Theory · Mathematics 2021-02-16 Michele Elia

Suppose that $n$ is $0$ or $4$ modulo $6$. We show that there are infinitely many primes of the form $p^2 + nq^2$ with both $p$ and $q$ prime, and obtain an asymptotic for their number. In particular, when $n = 4$ we verify the `Gaussian…

Number Theory · Mathematics 2024-10-15 Ben Green , Mehtaab Sawhney

In this paper, we construct a new class of complete permutation monomials and several classes of permutation polynomials. Further, by giving another characterization of o-polynomials, we obtain a class of permutation polynomials of the form…

Information Theory · Computer Science 2017-05-09 Nouara Zoubir , Kenza Guenda

Let $q>2$ be a prime power and $f=-{\tt x}+t{\tt x}^q+{\tt x}^{2q-1}$, where $t\in\Bbb F_q^*$. We prove that $f$ is a permutation polynomial of $\Bbb F_{q^2}$ if and only if one of the following occurs: (i) $q$ is even and…

Number Theory · Mathematics 2013-03-05 Xiang-dong Hou

Let $p$ be a prime and $n$ be a positive integer, and consider $f_b(X)=X+(X^p-X+b)^{-1}\in \Bbb F_p(X)$, where $b\in\Bbb F_{p^n}$ is such that $\text{Tr}_{p^n/p}(b)\ne 0$. It is known that (i) $f_b$ permutes $\Bbb F_{p^n}$ for $p=2,3$ and…

Number Theory · Mathematics 2020-08-11 Daniele Bartoli , Xiang-dong Hou

Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, four classes of monomial complete permutation polynomials and one class of…

Information Theory · Computer Science 2016-06-15 Jingxue Ma , Tao Zhang , Tao Feng , Gennian Ge

In this paper we establish function field versions of two classical conjectures on prime numbers. The first says that the number of primes in intervals (x,x+x^epsilon] is about x^epsilon/log x and the second says that the number of primes…

Number Theory · Mathematics 2015-11-03 Efrat Bank , Lior Bary-Soroker , Lior Rosenzweig