Related papers: Chebyshev's bias for products of irreducible polyn…

We study sums of Dirichlet characters over polynomials in $\mathbb{F}_q[t]$ with a prescribed number of irreducible factors. Our main results are explicit formulae for these sums in terms of zeros of Dirichlet L-functions. We also exhibit…

We study how often exceptional configurations of irreducible polynomials over finite fields occur in the context of prime number races and Chebyshev's bias. In particular, we show that three types of biases, which we call "complete bias",…

Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…

Under two assumptions, we determine the distribution of the difference between two functions each counting the numbers < x that are in a given arithmetic progression modulo q and the product of two primes. The two assumptions are (i) the…

For any $k\geq 1$, we study the distribution of the difference between the number of integers $n\leq x$ with $\omega(n)=k$ or $\Omega(n)=k$ in two different arithmetic progressions, where $\omega(n)$ is the number of distinct prime factors…

We prove an asymptotic formula for the number of integers $\leq x$ which can be written as the product of $k ~(\geq 2)$ distinct primes $p_1\cdots p_k$ with each prime factor in an arithmetic progression $p_j\equiv a_j \bmod q$, $(a_j,…

In this article, we study the distribution of the irrational factor function of order $k$, introduced first by Atanassov for $k=2$ and later it was generalized by Dong et al. for all $k\geq 2$. We introduce the irrational factor function in…

In this paper we discuss the generalizations of the concept of Chebyshev's bias from two perspectives. First we give a general framework for the study of prime number races and Chebyshev's bias attached to general $L$-functions satisfying…

We show that the counts of low degree irreducible factors of a random polynomial $f$ over $\mathbb{F}_q$ with independent but non-uniform coefficients behave like that of a uniform random polynomial, exhibiting a form of universality for…

The discriminants of certain polynomials related to Chebyshev polynomials factor into the product of two polynomials, one of which has coefficients that are much larger than the other's. Remarkably, these polynomials of dissimilar size have…

For a fixed polynomial $\Delta$, we study the number of polynomials $f$ of degree $n$ over $\mathbb F_q$ such that $f$ and $f+\Delta$ are both irreducible, an $\mathbb F_q[T]$-analogue of the twin primes problem. In the large-$q$ limit, we…

We provide upper bounds on the total number of irreducible factors, and in particular irreducibility criteria for some classes of bivariate polynomials $f(x,y)$ over an arbitrary field $\mathbb{K}$. Our results rely on information on the…

We confirm Chebyshev's observation that primes are strikingly more abundant in non-square residue classes modulo a fixed integer under the Generalized Riemann Hypothesis (GRH) by proving a (natural) density $1$ statement for prime counting…

Let $k \geq 1$ be a natural number and $f \in \mathbb{F}_q[t]$ be a monic polynomial. Let $\omega_k(f)$ denote the number of distinct monic irreducible factors of $f$ with multiplicity $k$. We obtain asymptotic estimates for the first and…

Prime counting functions are believed to exhibit, in various contexts, discrepancies beyond what famous equidistribution results predict; this phenomenon is known as Chebyshev's bias. Rubinstein and Sarnak have developed a framework which…

We investigate $k$-superirreducible polynomials, by which we mean irreducible polynomials that remain irreducible under any polynomial substitution of positive degree at most $k$. Let $\mathbb F$ be a finite field of characteristic $p$. We…

The estimates of the uniform norm of the Chebyshev polynomials associated with a compact set $K$ in the complex plane are established. These estimates are exact (up to a constant factor) in the case where $K$ consists of a finite number of…

The estimates of the uniform norm of the Chebyshev polynomial associated with a compact set $K$ consisting of a finite number of continua in the complex plane are established. These estimates are exact (up to a constant factor) in the case…

Let t be any integer and fix an odd prime ell. Let Phi(x) = T_ell^n(x)-t denote the n-fold composition of the Chebyshev polynomial of degree ell shifted by t. If this polynomial is irreducible, let K = bbq(theta), where theta is a root of…

We establish a new asymptotic formula for the number of polynomials of degree $n$ with $k$ prime factors over a finite field $\mathbb{F}_q$. The error term tends to $0$ uniformly in $n$ and in $q$, and $k$ can grow beyond $\log n$.…