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 over the same field, with at most four irreducible factors. We then complete, in this manner, a list given by J.T. B. Beard Jr.
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} +1$, for a Mersenne prime $M$ and for a positive integer $h$. Other consequences of such a factorization are new results about odd perfect 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 $σ(A)/A $ is still a binary polynomial. Technically, we prove that the only (unitary) perfect polynomials over $\F_2$ that are products of $x$, $x+1$ and of Mersenne primes are precisely the nine (resp. nine "classes") known ones. This follows from a new result about the factorization of $M^{2h+1} +1$, for a Mersenne prime $M$ and for a positive integer $h$.
The notion of block divisibility naturally leads one to introduce unitary cyclotomic polynomials. We formulate some basic properties of unitary cyclotomic polynomials and study how they are connected with cyclotomic, inclusion-exclusion and Kronecker polynomials. Further, we derive some related arithmetic function identities involving the unitary analog of the Dirichlet convolution.
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.
The notion of block divisibility naturally leads one to introduce unitary cyclotomic polynomials $Φ_n^*(x)$. They can be written as certain products of cyclotomic poynomials. We study the case where $n$ has two or three distinct prime factors using numerical semigroups, respectively Bachman's inclusion-exclusion polynomials. Given $m\ge 1$ we show that every integer occurs as a coefficient of $Φ^*_{mn}(x)$ for some $n\ge 1$. Here $n$ will typically have many different prime factors. We also consider similar questions for the polynomials $(x^n-1)/Φ_n^*(x),$ the inverse unitary cyclotomic polyno…
A unitary cyclotomic polynomial of order three is a polynomial of the form \[ Φ^*_{PQR}(x)=\frac{(x^{PQR}-1)(x^P-1)(x^Q-1)(x^R-1)}{(x^{PQ}-1)(x^{QR}-1)(x^{RP}-1)(x-1)}, \] where $P$, $Q$ and $R$ are powers of three distinct primes $p$, $q$ and $r$. Fixing any such prime triple generates a family of these polynomials corresponding to all possible choices of $P=p^a$, $Q=q^b$ and $R=r^c$. We study the coefficients of polynomials in such a family. In particular, we show that the coefficients of polynomials in every such family cover all of $\mathbb{Z}$.
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 \emph{all} known perfect polynomials, and to open a way of finding more of them (if they exist).
Using an elementary identity, we prove that for infinitely many polynomials $P(x)\in \mathbb{Z}[X]$ of fourth degree, the equation $\prod\limits_{k=1}^{n}P(k)=y^2$ has finitely many solutions in $\mathbb{Z}$. We also give an example of a quartic polynomial for which the product of it's first consecutive values is infinitely often a perfect square.
We show the finiteness of perfect powers in orbits of polynomial dynamical systems over an algebraic number field. We also obtain similar results for perfect powers represented by ratios of consecutive elements in orbits. Assuming the $abc$-Conjecture for number fields, we obtain a finiteness result for powers in ratios of arbitrary elements in orbits.
Following the work of Conrey, Rubinstein and Snaith and Forrester and Witte we examine a mixed moment of the characteristic polynomial and its derivative for matrices from the unitary group U(N) (also known as the CUE) and relate the moment to the solution of a Painleve differential equation. We also calculate a simple form for the asymptotic behaviour of moments of logarithmic derivatives of these characteristic polynomials evaluated near the unit circle.
We provide a combinatorial derivation of an asymptotic formula for averages of mixed ratios of characteristic polynomials over the unitary group, where mixed ratios are products of ratios and/or logarithmic derivatives. Our proof of this formula is a generalization of Bump and Gamburd's elegant combinatorial proof of Conrey, Forrester and Snaith's formula for averages of ratios of characteristic polynomials over the unitary group. One application of this formula is an asymptotic expression for sums over zeros of a random characteristic polynomial from the unitary group, which we call an explic…
In this paper we recast the Serret theorem about a characterization of palindromic continued fractions in the context of polynomial continued fractions. Then, using the relation between symmetric tridiagonal matrices and polynomial continued fractions we give a quick exposition of the mathematical aspect of the perfect quantum state transfer problem.