Related papers: Merit factors of polynomials derived from differen…

Let L be the zero set of a nonconstant monic polynomial with complex coefficients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion…

Starting from Montgomery's conjecture, there has been a substantial interest on the connections of random matrix theory and the theory of L-functions. In particular, moments of characteristic polynomials of random matrices have been…

Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…

Using the formalism of polynomials with positive coefficients, the fact that exactly half of all subsets of a finite set have even cardinality can be generalized asymptotically.

Polynomial ensembles are determinantal point processes associated with (non necessarily orthogonal) projections onto polynomial subspaces. The aim of this survey article is to put forward the use of recurrence coefficients to obtain the…

We provide a short proof of the theorem that every real multivariate polynomial has a symmetric determinantal representation, which was first proved in J. W. Helton, S. A. McCullough, and V. Vinnikov, Noncommutative convexity arises from…

Hayes equivalence is defined on monic polynomials over a finite field $\fq$ in terms of the prescribed leading coefficients and the residue classes modulo a given monic polynomial $Q$. We study the distribution of the number of zeros in a…

It is conjectured that all separable polynomials with integers coefficients, satisfying some local conditions, take infinitely many square free values on integer arguments. But not a single polynomial of degree greater than $3$ is proven to…

We study a family of monic orthogonal polynomials which are orthogonal with respect to the varying, complex valued weight function, $\exp(nsz)$, over the interval $[-1,1]$, where $s\in\mathbb{C}$ is arbitrary. This family of polynomials…

In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…

We establish, utilizing the Hardy-Littlewood Circle Method, an asymptotic formula for the number of pairs of primes whose differences lie in the image of a fixed polynomial. We also include a generalization of this result where differences…

We review some recent results on asymptotic properties of polynomials of large degree, of general holomorphic sections of high powers of positive line bundles over Kahler manifolds, and of Laplace eigenfunctions of large eigenvalue on…

Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…

We obtain some results on the asymptotic behaviour of Geometric polynomials in both the complex plane minus $[-1,0]$ and the interval $(-1,0)$. We also find the distance of consecutive zeros of these polynomials in the bulk of the interval…

Define the $n$-th fibotomic polynomial to be the product of the monic irredicible factors of the $n$-th Fibonacci polynomial which are not factors of any Fibonacci polynomial of smaller degree. In this paper, we prove a number of properties…

We consider sequences of polynomials that satisfy differential-difference recurrences. Polynomials satisfying such recurrences frequently appear as generating polynomials of integer valued random variables that are of interest in discrete…

Keating and Snaith showed that the $2k^{th}$ absolute moment of the characteristic polynomial of a random unitary matrix evaluated on the unit circle is given by a polynomial of degree $k^2$. In this article, uniform asymptotics for the…

We construct many irreducible polynomials within semigroups generated by sets of the form $S=\{x^2+c_1,\dots,x^2+c_s\}$ under composition.

Although we expect to find many smooth numbers (i.e., numbers with no large prime factors) among the values taken by a polynomial with integer coefficients, it is unclear what the asymptotic number of such smooth values should be; this is…

We study moments of the logarithmic derivative of characteristic polynomials of orthogonal and symplectic random matrices. In particular, we compute the asymptotics for large matrix size, $N$, of these moments evaluated at points which are…