Murmurations
We establish a case of the surprising correlation phenomenon observed in the recent works of He, Lee, Oliver, Pozdnyakov, and Sutherland between Fourier coefficients of families of modular forms and their root numbers.
math.NT↗
arXiv subjects
Nina Zubrilina
Publications and source records attributed to Nina Zubrilina.
Murmurations of Maass forms
We prove the existence of murmurations in the family of Maass forms of weight 0 and level 1 with their Laplace eigenvalue parameter going to infinity (i.e., correlations between the parity and Hecke eigenvalues at primes growing in proportion to the analytic conductor).
math.NT↗
Convergence to the Plancherel measure of Hecke Eigenvalues
We give improved uniform estimates for the rate of convergence to Plancherel measure of Hecke eigenvalues of holomorphic forms of weight 2 and level N. These are applied to determine the sharp cutoff for the non-backtracking random walk on arithmetic Ramanujan graphs and to Serre's problem of bounding the multiplicities of modular forms whose coefficients lie in number fields of degree d.
math.NT↗
Zeros of Optimal Functions in the Cohn-Elkies Linear Program
In a recent breakthrough, Viazovska and Cohn, Kumar, Miller, Radchenko, Viazovska solved the sphere packing problem in $\mathbb{R}^8$ and $\mathbb{R}^{24}$, respectively, by exhibiting explicit optimal functions, arising from the theory of weakly modular forms, for the Cohn-Elkies linear program in those dimensions. These functions have roots exactly at the lengths of points of the corresponding optimal lattices: $\{\sqrt{2n}\}_{n\geq 1}$ for the $E_8$ lattice, and $\{\sqrt{2n}\}_{n\geq 2}$, for the Leech lattice. The constructions of these optimal functions are in part motivated by the locations of the zeros. But what are the roots of optimal functions in other dimensions? We prove a number of theorems about the location of the zeros of optimal functions in arbitrary dimensions. In particular, we prove that distances between root lengths are bounded from above for $n \geq 1$ and not bounded from below for $n \geq 2$, and that the root lengths have to be arbitrarily close for arbitrarily long, that is, for any $C, \varepsilon > 0$, there is an interval of length $C$ in which the root lengths are at most $\varepsilon$ apart. We also establish a technique that allows one to improve a non-optimal function in some cases.
math.NT↗
Left-Right Pairs and Complex Forests of Infinite Rooted Binary Trees
Let $\mathcal{D}_0:= \{x + iy \ \vert x, y >0\}$, and let $(L, R)$ be a pair of Möbius transformations corresponding to $\mathrm{SL}_2(\mathbb{N}_0)$ matrices such that $R(\mathcal{D}_0)$ and $L(\mathcal{D}_0)$ are disjoint. Given such a pair (called a left-right pair), we can construct a directed graph $\mathcal{F}(L, R)$ with vertices $\mathcal{D}_0$ and edges $\{(z, R(z))\}_{z \in \mathcal{D}_0} \cup \{(z, L(z))\}_{z \in \mathcal{D}_0}$, which is a collection of infinite binary trees. We answer two questions of Nathanson by classifying all the pairs of elements of $\mathrm{SL}_2(\mathbb{N}_0)$ whose corresponding Möbius transformations form left-right pairs and showing that trees in $\mathcal{F}(L, R)$ are always rooted.
math.CO↗
On the Expected Value of the Maximal Bet in the Labouchere System
Consider a game consisting of independent turns with even money payoffs in which the player wins with a fixed probability $p \geq 1/3$ and loses with probability $1 - p$. The Labouchere system is a betting strategy which entails keeping a list of positive real numbers and betting the sum of the first and the last number on the list at every turn. In case of a victory, those two numbers are erased from the list, and, in case of a loss, the bet amount is appended to the end of the list. The player finishes the game when the list becomes empty. It is known that, in a game played with the Labouchere system with $p \leq 1/2$, both the sum of the bets and the maximal deficit have infinite expectation. Grimmett and Stirzaker raised the question of whether the same is true for the maximal bet. In this paper we show the expectation of the maximal bet is finite for $p > c$, where $c \approx 0.613763$ solves $(c-1)^2 c = \frac{8}{27(1+\sqrt{5})}$, thus partially answering this question.
math.PR↗
On the Number of Connected Components of Ranges of Divisor Functions
For $r \in \mathbb{R}, r> 1$ and $n \in \mathbb{Z}^+$, the divisor function $σ_{-r}$ is defined by $σ_{-r}(n) := \sum_{d \vert n} d^{-r}$. In this paper we show the number $C_r$ of connected components of $\overline{σ_{-r}(\mathbb{Z}^+)}$ satisfies $$π(r) + 1 \leq C_r \leq \frac{1}{2}\exp\left[\frac{1}{2}\dfrac{r^{20/9}}{(\log r)^{29/9}} \left( 1 + \frac{\log\log r}{\log r - \log\log r} + \frac{\mathcal{O}(1)}{\log r}\right) \right],$$ where $π(t)$ is the number of primes $p\leq t$. We also show that $C_r$ does not take all integer values, specifically that it cannot be equal to $4$.
math.NT↗
On Edge Dimension of a Graph
Given a connected graph $G(V, E)$, the edge dimension, denoted $\mathrm{edim}(G)$, is the least size of a set $S \subseteq V$ that distinguishes every pair of edges of $G$, in the sense that the edges have pairwise distinct tuples of distances to the vertices of $S$. The notation was introduced by Kelenc, Tratnik, and Yero, and in their paper, they asked several questions about properties of $\mathrm{edim}$. In this article we answer two of these questions: we classify the graphs for which $\mathrm{edim}(G) = n-1$ and show that $\frac{\mathrm{edim}(G)}{\dim(G)}$ isn't bounded from above (here $\dim(G)$ is the standard metric dimension of $G$). We also compute $\mathrm{edim}(G\Box P_m)$ and $\mathrm{edim}(G + K_1)$.
math.CO↗
On the edge metric dimension for the random graph
Let $G(V, E)$ be a connected simple undirected graph. In this paper we prove that the edge metric dimension (introduced by Kelenc, Tratnik and Yero) of the Erdős-Rényi random graph $G(n, p)$ is given by: $$\textrm{edim}(G(n, p)) = (1 + o(1))\frac{4\log(n)}{\log(1/q)},$$ where $q = 1 - 2p(1-p)^2(2-p)$.
math.CO↗