English
Related papers

Related papers: Non-splitting bi-unitary perfect polynomials over …

200 papers

We give, in this paper, all bi-unitary perfect polynomials over the prime field $\mathbb{F}_2$, with at most four irreducible factors.

Number Theory · Mathematics 2022-05-24 Olivier Rahavandrainy

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…

Number Theory · Mathematics 2022-05-10 Olivier Rahavandrainy

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.

Number Theory · Mathematics 2023-11-14 Luis H. Gallardo , Olivier Rahavandrainy

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.

Number Theory · Mathematics 2022-05-10 Luis H. Gallardo , Olivier Rahavandrainy

We find all unitary perfect polynomials over the prime field $\F_2$ with less than five distinct prime factors.

Number Theory · Mathematics 2010-03-30 Luis H. Gallardo , Olivier Rahavandrainy

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…

Number Theory · Mathematics 2007-12-18 Luis H. Gallardo , Olivier Rahavandrainy

For a fixed quadratic irreducible polynomial $f$ with no fixed prime factors at prime arguments, we prove that there exist infinitely many primes $p$ such that $f(p)$ has at most 4 prime factors, improving a classical result of Richert who…

Number Theory · Mathematics 2016-09-02 Jie Wu , Ping Xi

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.

Number Theory · Mathematics 2020-08-18 L. H. Gallardo , O. Rahavandrainy

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

Number Theory · Mathematics 2022-02-15 Luis H. Gallardo , Olivier Rahavandrainy

In this article, we consider polynomials of the form $f(x)=a_0+a_{n_1}x^{n_1}+a_{n_2}x^{n_2}+\dots+a_{n_r}x^{n_r}\in \mathbb{Z}[x],$ where $|a_0|\ge |a_{n_1}|+\dots+|a_{n_r}|,$ $|a_0|$ is a prime power and $|a_0|\nmid |a_{n_1}a_{n_r}|$. We…

Number Theory · Mathematics 2020-04-02 Biswajit Koley , A. Satyanarayana Reddy

H. Lenstra has pointed out that a cubic polynomial of the form (x-a)(x-b)(x-c) + r(x-d)(x-e), where {a,b,c,d,e} is some permutation of {0,1,2,3,4}, is irreducible modulo 5 because every possible linear factor divides one summand but not the…

Number Theory · Mathematics 2022-09-22 Evan M. O'Dorney

Regarding non-unique factorization of integer-valued polynomials over a discrete valuation domain $(R,M)$ with finite residue field, it is known that there exist absolutely irreducible elements, that is, irreducible elements all of whose…

Commutative Algebra · Mathematics 2022-03-16 Sophie Frisch , Sarah Nakato , Roswitha Rissner

In this article, we consider the polynomials of the form $f(x)=a_0+a_1x+a_2x^2+\cdots+a_nx^n\in \mathbb{Z}[x],$ where $|a_0|=|a_1|+\dots+|a_n|$ and $|a_0|$ is a prime. We show that these polynomials have a cyclotomic factor whenever…

Number Theory · Mathematics 2020-06-09 Biswajit Koley , A. Satyanarayana Reddy

We classify complete permutation polynomials of type $aX^{\frac{q^n-1}{q-1}+1}$ over the finite field with $q^n$ elements, for $n+1$ a prime and $n^4 < q$. For the case $n+1$ a power of the characteristic we study some known families. We…

Combinatorics · Mathematics 2017-02-20 Daniele Bartoli , Massimo Giulietti , Luciane Quoos , Giovanni Zini

Let $\mathcal{A}$ and $\mathcal{B}$ be sets of polynomials of degree $n$ over a finite field. We show, that if $\mathcal{A}$ and $\mathcal{B}$ are large enough, then $A+B$ has an irreducible divisor of large degree for some…

Number Theory · Mathematics 2022-06-28 László Mérai

In this paper, we give error bounds on the number of monic irreducible polynomials $a_0+a_1x+\dots+a_{n-1}x^{n-1}+x^n$ over a finite field $\mathbb{F}_q$ of degree $n$ with $(a_0, a_1, \dots, a_{n-1}, 1)$ lying in a fixed affine algebraic…

Number Theory · Mathematics 2025-12-11 Neil Kolekar

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

Number Theory · Mathematics 2026-05-19 Jitender Singh

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…

Number Theory · Mathematics 2022-02-15 Luis H. Gallardo , Olivier Rahavandrainy

Given a prime power $q$ and positive integers $m,t,e$ with $e > mt/2$, we determine the number of all monic irreducible polynomials $f(x)$ of degree $m$ with coefficients in $\mathbb{F}_q$ such that $f(x^t)$ contains an irreducible factor…

Group Theory · Mathematics 2019-03-27 Sabina B. Pannek

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…

Number Theory · Mathematics 2022-10-31 Geoffrey Price , Katherine Thompson
‹ Prev 1 2 3 10 Next ›