Related papers: On splitting perfect polynomials over $\mathbb{F}_…
We give all splitting bi-unitary perfect polynomials over the field $\mathbb{F}_4$ and some splitting ones over $\mathbb{F}_{p^2}$, if $p$ is an odd prime.
We give all bi-unitary non splitting even perfect polynomials over the prime field of two elements, which are divisible by Mersenne irreducible polynomials raised to special exponents. We also identify all bi-unitary perfect polynomials…
A perfect polynomial over the binary field $\F_2$ is a polynomial $A \in \F_2[x]$ that equals the sum of all its divisors. If $\gcd(A,x^2-x) \neq 1$ then we call $A$ even. The list of all even perfect polynomials over $\F_2$ with at most 3…
The paper is about an arithmetic problem in $\F_2[x]$. We give \emph{admissible} (necessary) conditions satisfied by a set of odd prime divisors of perfect polynomials over $\F_2$. This allows us to prove a new characterization of…
We find all unitary perfect polynomials over the prime field $\F_2$ with less than five distinct prime factors.
The only (unitary) perfect polynomials over $\mathbb{F}_2$ that are products of $x$, $x+1$ and Mersenne primes are precisely the nine (resp. nine "classes") known ones. This follows from a new result about the factorization of $M^{2h+1}…
We give, in this paper, all bi-unitary perfect polynomials over the prime field $\mathbb{F}_2$, with at most four irreducible factors.
We give necessary conditions satisfied by the set of odd prime divisors of binary perfect polynomials. This allows us to get a new characterization of all the known perfect binary polynomials.
We address an arithmetic problem in the ring $\F_2[x]$ related to the fixed points of the sum of divisors function. We study some binary polynomials $A$ such that $\sigma(A)/A $ is still a binary polynomial. Technically, we prove that the…
In a rather straightforward manner, we develop the well-known formula for the Stirling numbers of the first kind in terms of the (exponential) complete Bell polynomials where the arguments include the generalised harmonic numbers. We also…
We adapt (over $\mathbb{F}_2$) the general notions of multiplicative function, Dirichlet convolution and Inverse. We get some interesting results, namely necessary conditions for an odd binary polynomial to be perfect. Note that we are…
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…
In this paper, we consider central complete and incomplete Bell polynomials which are generalizations of the recently introduced central Bell polynomials and central analogues for the complete and incomplete Bell polynomials. We investigate…
In this paper, we present a linear algebraic approach to the study of permutation polynomials that arise from linear maps over a finite field $\mathbb{F}_{q^2}$. We study a particular class of permutation polynomials over…
We give all non splitting bi-unitary perfect polynomials over the prime field of two elements, which have only Mersenne polynomials as odd irreducible divisors.
In this paper, we study properties of polynomials over division rings. Moreover, we present formulas for finding roots of some polynomials
We consider almost-primes of the form $f(p)$ where $f$ is an irreducible polynomial over $\mathbb Z$ and $p$ runs over primes. We improve a result of Richert for polynomials of degree at least $3$. In particular we show that, when the…
Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a…
Let $p$ be a prime. In this paper, we give a complete classification of self-reciprocal polynomials arising from Fibonacci polynomials over $\mathbb{Z}$ and $\mathbb{Z}_p$, where $p=2$ and $p>5$. We also present some partial results when…
We consider the distance to the nearest integer of f(p), where f is a quadratic polynomial with irrational leading coefficient. This distance is very small as a function of p, for infinitely many primes p. We give a 14% improvement in the…