Related papers: The Chebotarev density theorem for function fields…

For a class of polynomials $f \in \mathbb{Z}[X]$, which in particular includes all quadratic polynomials, and also trinomials of some special form, we show that, under some natural conditions (necessary for quadratic polynomials), the set…

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)|…

We prove a function-field version of Chebotarev's density theorem in the framework of difference algebraic geometry by developing the notion of Galois coverings of generalised difference schemes, and using Hrushovski's twisted Lang-Weil…

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 completely describe the functional graph associated to iterations of Chebyshev polynomials over finite fields. Then, we use our structural results to obtain estimates for the average rho length, average number of connected components and…

We generalize the Chebotarev density formulas of Dawsey (2017) and Alladi (1977) to the setting of arbitrary finite Galois extensions of number fields $L/K$. In particular, if $C \subset G = \textrm{Gal}(L/K)$ is a conjugacy class, then we…

For any $k\geq 1$, this paper studies the number of polynomials having $k$ irreducible factors (counted with or without multiplicities) in $\mathbf{F}_q[t]$ among different arithmetic progressions. We obtain asymptotic formulas for the…

Let $K/F$ be a finite Galois extension of number fields. It is well known that the Tchebotarev density theorem implies that an irreducible, finitely ramified $p$-adic representation $\rho$ of the absolute Galois group of $K$ is determined…

A new necessary and sufficient stability test in a tractable number of operations for linear neutral-type delay systems is introduced. It is developed in the Lyapunov-Krasovskii framework via functionals with prescribed derivatives. The…

We prove large sieve inequalities with multivariate polynomial moduli and deduce a general Bombieri--Vinogradov type theorem for a class of polynomial moduli having a sufficient number of variables compared to its degree. This sharpens…

Let P denote the set of all primes. Suppose that P_1, P_2, P_3 are three subsets of P with the sum of their lower densities relative to P is greater than 2. We prove that for sufficiently large odd integer n, there exist p_i\in P_i such…

By using the work of Frantzikinakis and Wierdl, we can see that for all $d\in\mathbb{N}$, $\alpha\in(d,d+1)$, and integers $k\ge d+2$ and $r\ge1$, there exist infinitely many $n\in\mathbb{N}$ such that the sequence…

We prove a Cherednik style $p$-adic uniformization theorem for Shimura varieties associated to certain groups of unitary similitudes of size two over totally real fields. Our basic tool is the alternative modular interpretation of the…

For a polynomial $F(t,A_1,\ldots,A_n)\in\mathbf{F}_p[t,A_1,\ldots,A_n]$ ($p$ being a prime number) we study the factorization statistics of its specializations $$F(t,a_1,\ldots,a_n)\in\mathbf{F}_p[t]$$ with $(a_1,\ldots,a_n)\in S$, where…

P\'olya's shire theorem identifies the final set of zeros of successive derivatives of an arbitrary meromorphic function with at least one pole with the Voronoi diagram of its finite poles. We prove a fixed-scale zero-counting law for…

In this paper, we employ a version of Stepanov's method, developed by Hanson and Petridis, to prove several results on additive irreducibility of multiplicative subgroups in finite fields of prime order $p$. Specifically, we show that if a…

We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…

The study of iterations of functions over a finite field and the corresponding functional graphs is a growing area of research with connections to cryptography. The behaviour of such iterations is frequently approximated by what is know as…

We consider sums of oscillating functions on intervals in cyclic groups of size close to the square root of the size of the group. We first prove non-trivial estimates for intervals of length slightly larger than this square root (bridging…

We prove a log-free zero density estimate for automorphic $L$-functions defined over a number field $k$. This work generalizes and sharpens the method of pseudo-characters and the large sieve used earlier by Kowalski and Michel. As…