On Mersenne polynomials over F₂
Let \(A\in \mathbb{F}_2[x]\) be a nonzero polynomial. \(A\) is called \textit{even} if it has a linear factor and it is called \textit{odd} otherwise. \textit{Mersenne polynomial} over \(\mathbb{F}_2\) is defined as a polynomial of the form \(1+x^a(x+1)^b\), for some \(a, b\in \mathbb{N}^*\). If such a polynomial is irreducible, it is called a Mersenne prime. Let \(\omega(A)\) denote the number of distinct irreducible (or prime) factors of \(A\) over \(\mathbb{F}_2\), \(\sigma(A)\) the sum of all divisors of \(A\) and ord\((A)\) the order or period of \(A\). Note that \(\sigma\) is a multiplicative function. If \(\sigma(A)=A\), then \(A\) is called a \textit{perfect} polynomial. The polynomial \(1+x^a(x+1)^b\) is obviously reducible when \(\mathrm{gcd}(a,b)\neq 1\) and it is square-free if and only if \(a\) and \(b\) are not both even. So, the authors only consider the case in which \(\mathrm{gcd}(a,b)=1\). They discover a new relation between Mersenne polynomials \(M_{ab}:= x^a(x+1)^b+1\) with \(\mathrm{gcd}(a,b)=1\) and trinomials \(T_{ab}:= x^{a+b}+x^b+1\), that is: \(r:= \omega(M_{ab})=\omega(T_{ab})\). This is important since most known results about trinomials (and more general polynomials) are about the parity of \(r\). Testing irreducibility for polynomials (in particular, trinomials) over a finite field remains a difficult problem. The following conjecture, which is about the factorization of \(\sigma(M^{2h})\) (and hence about that of \(M^{2h+1}+1=(M+1)\sigma(M^{2h}))\), appeared in [\textit{L. H. Gallardo} and \textit{O. Rahavandrainy}, Finite Fields Appl. 18, No. 5, 920--932 (2012; Zbl 1273.11175)]. \textbf{Conjecture} Let \(M\) be a Mersenne prime over \(\mathbb{F}_2\). Then the polynomial \(\sigma(M^{2h})\) is divisible by a non Mersenne prime if and only if \((h\geq 2\,\,\mathrm{ or}\,\,M\not \in \{1+x+x^3, 1+x^2+x^3\})\). The conjecture implies that all even perfect polynomials over \(\mathbb{F}_2\), which are products of Mersenne primes, are indeed the nine of the eleven non-trivial known even perfect polynomials. In this paper, the authors show that for any \(h\), \(\sigma(M^{2h})\) is square-free and it is not a Mersenne prime (even if it may be irreducible), and then consider the special case \(\omega(\sigma(M^{2h})=2\).
- On the prime factors of _p(M)
- Primitive t-Nomials (t = 3, 5) Over GF(2) Whose Degree is a Mersenne Exponent 44497
- Ten new primitive binary trinomials
- New primitive t-nomials (t = 3,5) over GF(2) whose degree is a Mersenne exponent
- On polynomials x^n-1 over binary fields whose irreducible factors are binomials and trinomials
- A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377
- A Generalization of Swan's Theorem
- Characterization of sporadic perfect polynomials over \(\mathbb{F}_2\)
- Even perfect polynomials over F₂ with four prime factors
- Factorization of polynomials over finite fields
- scientific article; zbMATH DE number 967590 (Why is no real title available?)
- Odd perfect polynomials over \(\mathbb F_2\)
- On a conjecture of Beard, O'Connell and West concerning perfect polynomials
- On even (unitary) perfect polynomials over F₂
- On the Nagell-Ljunggren equation $(x^n - 1)/(x - 1) = y^q$
- On trinomials xn + x}2 + 1 and x8/ ± 3 + xk + 1 irreducible over GF(2)
- On xn + x + 1 over GF(2)
- Parity of the number of irreducible factors for composite polynomials
- Round trinomials
- The great trinomial hunt
- The Nagell-Ljunggren equation via Runge's method
- The parity of the number of irreducible factors for some pentanomials
- The sum of the divisors of a polynomial
- There is no odd perfect polynomial over \(\mathbb F_{2}\) with four prime factors
- Some families of unitary perfect polynomials over \(\mathbb{F}_2\)
- New primitive t-nomials (t = 3,5) over GF(2) whose degree is a Mersenne exponent
- On the prime factors of _p(M)
- A polynomial variant of perfect numbers
- scientific article; zbMATH DE number 3893301 (Why is no real title available?)
- Fixed points of the sum of divisors function on \({{\mathbb{F}}}_2[x]\)
- scientific article; zbMATH DE number 7673549 (Why is no real title available?)
- On the index of special perfect polynomials
- Reduction-free multiplication for finite fields and polynomial rings
- On factors of \(\Phi_p(M)\) in \(\mathbb{F}_2[X]\) and self-reciprocal polynomials
- Splitting sums of binary polynomials
- All even (unitary) perfect polynomials over \(\mathbb{F_2}\) with only Mersenne primes as odd divisors
- A variant of Collatz's conjecture over binary polynomials
- Factorization of cyclotomic polynomial values at Mersenne prime polynomials
This page was built for publication: On Mersenne polynomials over \(\mathbb{F}_2\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2326698)
