Related papers: Prime Number Theorems for Polynomials from Homogen…

We establish formulae for the moments of the moments of the characteristic polynomials of random orthogonal and symplectic matrices in terms of certain lattice point count problems. This allows us to establish asymptotic formulae when the…

With probability 1, we assess the average behaviour of various arithmetic functions at the values of degree d polynomials f that are ordered by height. This allows us to establish averaged versions of the Bateman-Horn conjecture, the…

We obtain the strong asymptotics of polynomials $p_n(\lambda)$, $\lambda\in\mathbb{C}$, orthogonal with respect to measures in the complex plane of the form $$ e^{-N(|\lambda|^{2s}-t\lambda^s-\overline{t\lambda}^s)}dA(\lambda), $$ where $s$…

This paper introduces a novel class of prime-generating quadratic polynomials defined by $f_{Z,k,H}(n) = n^2 - (2Zk - 1)n + \frac{(2Zk - 1)^2 + H}{4}$, where $Zk \in \mathbb{Z}_{\geq 0}$ and $H$ belongs to the set of Heegner numbers. This…

Let $\mathbf{f} = (f_1, \ldots, f_R)$ be a system of polynomials with integer coefficients in which the degrees need not all be the same. We provide sufficient conditions for which the system of equations $f_j (x_1, \ldots, x_n) = 0 \ (1…

We establish asymptotic formulae for the number of $k$-free values of polynmilas $F(x_1,\cdots,x_n)\in\mathbb{Z}[x_1,\cdots,x_n]$ of degree $d\geq 2$ for any $n\geq 1$, including when the variables are prime, as long as $k\geq (3d+1)/4$.…

Let $P_1,\dots,P_k \colon {\bf Z} \to {\bf Z}$ be polynomials of degree at most $d$ for some $d \geq 1$, with the degree $d$ coefficients all distinct, and admissible in the sense that for every prime $p$, there exists integers $n,m$ such…

Let K be a field and let M_n(K) denote the space of n x n matrices with entries in K. Let M be a subspace of M_n(K) of dimension d with the property that there are elements in M with non-zero determinant. Given a basis of M, we define the…

We consider integer recurrences of the form a_n = f(a_{n-1}), where f is a quadratic polynomial with integer coefficients. We show, for four infinite families of f, that the set of primes dividing at least one term of such a sequence must…

Let $S=\mathbb{C}[x_{ij}]$ be a polynomial ring of $m\times n$ generic variables (resp. a polynomial ring of $(2n+1) \times (2n+1)$ skew-symmetric variables) over $\mathbb{C}$ and let $I$ (resp. Pf) be the determinantal ideal of maximal…

We derive a formula for the number of pre-images under a non-degenerate harmonic mapping $f$, using the argument principle. This formula reveals a connection between the pre-images and the caustics. Our results allow to deduce the number of…

We study the difference between the number of primitive roots modulo $p$ and modulo $p+k$ for prime pairs $p,p+k$. Assuming the Bateman-Horn conjecture, we prove the existence of strong sign biases for such pairs. More importantly, we prove…

We introduce a new notion of the determinant, called symmetrized determinant, for a square matrix with the entries in an associative algebra $\AA$. The monomial expansion of the symmetrized determinant is obtained from the standard…

The probability for two monic polynomials of a positive degree n with coefficients in the finite field F_q to be relatively prime turns out to be identical with the probability for an n x n Hankel matrix over F_q to be nonsingular.…

Let $f(z,w)=(p(z),q(z,w))$ be a polynomial skew product such that the degrees of $p$ and $q$ are grater than or equal to $2$. Under one or two conditions, we prove that $f$ is conjugate to a monomial map on an invariant region near…

Let $f \in \mathbb{Z}[y]$ be a polynomial such that $f(\mathbb{N}) \subseteq \mathbb{N}$, and let $p_{\mathcal{A}_{f}}(n)$ denote number of partitions of $n$ whose parts lie in the set $\mathcal{A}_f:=\{f(n):n \in \mathbb{N}\}$. Under…

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

There has been significant interest in studying the asymptotics of certain generalised moments, called the moments of moments, of characteristic polynomials of random Haar-distributed unitary and symplectic matrices, as the matrix size $N$…

We study the characteristic polynomial $p_{n}(x)=\prod_{j=1}^{n}(|z_{j}|-x)$ where the $z_{j}$ are drawn from the Mittag-Leffler ensemble, i.e. a two-dimensional determinantal point process which generalizes the Ginibre point process. We…

Motivated by Stanley's generalization of the chromatic polynomial of a graph to the chromatic symmetric function, we introduce the characteristic polynomial of a representation of the symmetric group, or more generally, of a symmetric…