Searcharxiv⌕ Search

arXiv subjects

Kannan Soundararajan

Publications and source records attributed to Kannan Soundararajan.

At least 19 recordsLinked to original sources
arXiv2026

The least quadratic residue and integers represented by quadratic forms

Let $\ell(n)$ denote the least non-trivial reduced quadratic residue modulo $n$; that is, $\ell(n)$ denotes the smallest square-free integer $r>1$ with $(r,n)=1$ and $r\equiv x^2 \bmod {n}$. We establish nearly optimal bounds for $\ell(n)$, both in terms of the magnitude of $n$ and of its number of prime factors $ω(n)$. In particular, we construct moduli $n$ for which $\ell(n)$ is unexpectedly large. As an application of our results, we prove bounds for the rate at which binary quadratic forms with bounded discriminant represent all positive integers up to $N$.

math.NT↗
arXiv2026

Distribution of random multiplicative functions in short intervals, with proper normalization

We determine the limiting distribution of partial sums of a Steinhaus random multiplicative function $\sum_{x\le n \le x+y} f(n)$ over short intervals $[x, x+y]$, where $y \rightarrow \infty$ but $y=o(x)$. We show that with appropriate normalization, the limiting distribution is Gaussian for all such $y$. A key new feature of our result is that the normalization factor is different from the standard deviation $\sqrt{y}$ when $y$ is very close to $x$. In contrast, when $y \asymp x$ there is no normalization for which the limiting distribution is a non-degenerate Gaussian.

math.NT↗
arXiv2026

Zeros in the character table of the symmetric group

Computations of Miller and Scheinerman suggest that the vast majority of the zeros appearing in the character table of the symmetric group are of a certain special type. While we cannot prove this, we resolve a conjecture arising in their paper concerning these zeros, and address a related question of Stanley.

math.CO↗
arXiv2024

Covering integers by $x^2 + dy^2$

What proportion of integers $n \leqslant N$ may be expressed as $x^2 + dy^2$ for some $d \leqslant Δ$, with $x,y $ integers? Writing $Δ$ as $(\log N)^{\log 2} 2^{α\sqrt{\log \log N}}$ for some $α\in (-\infty, \infty)$, we show that the answer is $Φ(α) + o(1)$, where $Φ$ is the Gaussian distribution function $Φ(α) = \frac{1}{2π} \int^α_{-\infty} e^{-x^2/2} dx$. A consequence of this is a phase transition: almost none of the integers $n \leqslant N$ can be represented by $x^2 + dy^2$ with $d \leqslant (\log N)^{\log 2 - \varepsilon}$, but almost all of them can be represented by $x^2 + dy^2$ with $d \leqslant (\log N)^{\log 2 + \varepsilon}$.

math.NT↗
arXiv2024

Ideals generated by power sums

We consider ideals in a polynomial ring generated by collections of power sum polynomials, and obtain conditions under which these define complete intersection rings, normal domains, and unique factorization domains. We also settle a key case of a conjecture of Conca, Krattenthaler, and Watanabe, and prove other results in that direction.

math.AC↗
arXiv2023

Central limit theorems for random multiplicative functions

A Steinhaus random multiplicative function $f$ is a completely multiplicative function obtained by setting its values on primes $f(p)$ to be independent random variables distributed uniformly on the unit circle. Recent work of Harper shows that $\sum_{n\le N} f(n)$ exhibits ``more than square-root cancellation," and in particular $\frac 1{\sqrt{N}} \sum_{n\le N} f(n)$ does not have a (complex) Gaussian distribution. This paper studies $\sum_{n\in {\mathcal A}} f(n)$, where ${\mathcal A}$ is a subset of the integers in $[1,N]$, and produces several new examples of sets ${\mathcal A}$ where a central limit theorem can be established. We also consider more general sums such as $\sum_{n\le N} f(n) e^{2πi nθ}$, where we show that a central limit theorem holds for any irrational $θ$ that does not have extremely good Diophantine approximations.

math.NT↗
arXiv2023

Conditional lower bounds on the distribution of central values in families of $L$-functions

We establish a general principle that any lower bound on the non-vanishing of central $L$-values obtained through studying the one-level density of low-lying zeros can be refined to show that most such $L$-values have the typical size conjectured by Keating and Snaith. We illustrate this technique in the case of quadratic twists of a given elliptic curve, and similar results would hold for the many examples studied by Iwaniec, Luo, and Sarnak in their pioneering work on $1$-level densities.

math.NT↗
arXiv2023

A supplement to Chebotarev's density theorem

Let $L/K$ be a Galois extension of number fields with Galois group $G$. We show that if the density of prime ideals in $K$ that split totally in $L$ tends to $1/|G|$ with a power saving error term, then the density of prime ideals in $K$ whose Frobenius is a given conjugacy class $C\subset G$ tends to $|C|/|G|$ with the same power saving error term. We deduce this by relating the poles of the corresponding Dirichlet series to the zeros of $ζ_L(s)/ζ_K(s)$.

math.NT↗
arXiv2022

The work of James Maynard

We give a brief account of some of the most spectacular results established by James Maynard for which he has been awarded the Fields Medal.

math.NT↗
arXiv2021

A model problem for multiplicative chaos in number theory

Resolving a conjecture of Helson, Harper recently established that partial sums of random multiplicative functions typically exhibit more than square-root cancellation. Harper's work gives an example of a problem in number theory that is closely linked to ideas in probability theory connected with multiplicative chaos; another such closely related problem is the Fyodorov-Hiary-Keating conjecture on the maximum size of the Riemann zeta function in intervals of bounded length on the critical line. In this paper we consider a problem that might be thought of as a simplified function field version of Helson's conjecture. We develop and simplify the ideas of Harper in this context, with the hope that the simplified proof would be of use to readers seeking a gentle entry-point to this fascinating area.

math.NT↗
arXiv2021

Exponential sums, twisted multiplicativity and moments

We study averages over squarefree moduli of the size of exponential sums with polynomial phases. We prove upper bounds on various moments of such sums, and obtain evidence of un-correlation of exponential sums associated to different suitably unrelated and generic polynomials. The proofs combine analytic arguments with the algebraic interpretation of exponential sums and their monodromy groups.

math.NT↗
arXiv2019

Many solutions to the $S$-unit equation $a+1=c$

We show that there are arbitrarily large sets $S$ of $s$ primes for which the number of solutions to $a+1=c$ where all prime factors of $ac$ lie in $S$ has $\gg \exp( s^{1/4}/\log s)$ solutions.

math.NT↗
arXiv2018

Weak subconvexity without a Ramanujan hypothesis

We describe a new method to obtain weak subconvexity bounds for $L$-functions with mild hypotheses on the size of the Dirichlet coefficients. We verify these hypotheses for all automorphic $L$-functions and (with mild restrictions) the Rankin-Selberg $L$-functions attached to two automorphic representations. The proof relies on a new unconditional log-free zero density estimate for Rankin-Selberg $L$-functions.

math.NT↗