Related papers: Low-degree factors of random polynomials

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…

Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…

We study a random polynomial of degree $n$ over the finite field $\mathbb{F}_q$, where the coefficients are independent and identically distributed and uniformly chosen from the squares in $\mathbb{F}_q$. Our main result demonstrates that…

In this paper, given a simple linear recurrence sequence of algebraic numbers, which has either a dominant characteristic root or exactly two characteristic roots of maximal modulus, we give some explicit lower bounds for the index beyond…

This brief note concerns the invertibility of certain alternant matrices. In particular those that consisting of polynomials and products of polynomials and logarithms are shown to be invertible under appropriate conditions on the degrees…

We study properties of eigenvalues of a matrix associated with a randomly chosen partial automorphism of a regular rooted tree. We show that asymptotically, as the numbers of levels goes to infinity, the fraction of non-zero eigenvalues…

A degree-$d$ polynomial $p$ in $n$ variables over a field $\F$ is {\em equidistributed} if it takes on each of its $|\F|$ values close to equally often, and {\em biased} otherwise. We say that $p$ has a {\em low rank} if it can be expressed…

We study delocalization of null vectors and eigenvectors of random matrices with i.i.d entries. Let $A$ be an $n\times n$ random matrix with i.i.d real subgaussian entries of zero mean and unit variance. We show that with probability at…

We consider random polynomials whose coefficients are independent and identically distributed on the integers. We prove that if the coefficient distribution has bounded support and its probability to take any particular value is at most…

The ring of integer-valued polynomials over a given subset $S$ of $\Z$ (or $ \mathrm{Int}(S,\Z ))$ is defined as the set of polynomials in $\Q[x]$ which maps $S$ to $\Z$. In factorization theory, it is crucial to check the irreducibility of…

A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we enumerate self-reciprocal irreducible monic polynomials over a finite field with prescribed leading coefficients.…

As an extension of the classical irreducibility result of Dumas, a factorization result for polynomials over any valued field with a Krull valuation of arbitrary rank is proved. Further, a lower degree factor bound on factors of a given…

It is well known, that if polynomial with rational coefficients of degree $n$ takes integer values in points $0,1,...,n$ then it takes integer values in all integer points. Are there sets of $n+1$ points with the same property in other…

This paper seeks to further explore the distribution of the real roots of random polynomials with non-centered coefficients. We focus on polynomials where the typical values of the coefficients have power growth and count the average number…

In this paper, we investigate characteristic polynomials of matrices in min-plus algebra. Eigenvalues of min-plus matrices are known to be the minimum roots of the characteristic polynomials based on tropical determinants which are designed…

Let n be a positive integer and let p be a prime. We calculate the probability that a random monic polynomial of degree n with coefficients in the ring Z_p of p-adic integers splits over Z_p into linear factors.

Let $x \in S^{n-1}$ be a unit eigenvector of an $n \times n$ random matrix. This vector is delocalized if it is distributed roughly uniformly over the real or complex sphere. This intuitive notion can be quantified in various ways. In these…

We consider polynomials with integer coefficients and discuss their factorization properties in Z[[x]], the ring of formal power series over Z. We treat polynomials of arbitrary degree and give sufficient conditions for their reducibility…

A number $\lambda \in \mathbb C $ is called an {\it eigenvalue} of the matrix polynomial $P(z)$ if there exists a nonzero vector $x \in \mathbb C^n$ such that $P(\lambda)x = 0$. Note that each finite eigenvalue of $P(z)$ is a zero of the…

We consider the logarithm of the characteristic polynomial of random permutation matrices, evaluated on a finite set of different points. The permutations are chosen with respect to the Ewens distribution on the symmetric group. We show…