arXiv subjects

Justine Dell

Publications and source records attributed to Justine Dell.

5 recordsLinked to original sources

arXiv2026

Counting metacyclic fields

By a metacyclic field $K$ we mean the Galois closure of a pure field $\mathbb{Q}(\sqrt[\ell]{D})$, $D\in\mathbb{Z}$, of odd prime degree $\ell$. Let $\mathcal{M}_\ell$ denote the collection of isomorphism classes of metacyclic fields of degree $\ell(\ell-1)$. Write $N_\ell(X)=\#\{K\in\mathcal{M}_\ell: |\Delta_K|\leq X\}$ for the associated counting function, where $\Delta_K$ denotes the discriminant of $K$. We show $$N_\ell(X)\sim A_\ell X^{\frac{1}{(\ell-1)^2}}(\log X)^{\ell-2}\,,$$ for an explicit constant $A_\ell$. We express $A_\ell$ as a rational number times a product over primes of a degree $\ell$ polynomial in $1/p$.

math.NT↗

arXiv2025

The shape of quadratic Gauss paths

We consider the distribution of quadratic Gauss paths, polygonal paths joining partial sums of quadratic Gauss sums to square-free fundamental discriminant moduli in a dyadic range [Q,2Q]. We prove that this striking ensemble converges in law, as Q->\infty, to a random Fourier series we explicitly describe, and we prove a convergence in probability result and a classification result for the limiting shapes that explain the visually remarkable properties of these Gauss paths.

math.NT↗

arXiv2022

On the moments of one-level densities in families of holomorphic cusp forms in the level aspect

We study the $n^{\rm th}$ centered moments of the $1$-level density for the low-lying zeros of $L$-functions attached to holomorphic cuspidal newforms of large prime level and fixed weight. Assuming the Generalized Riemann Hypotheses, we compute this statistic for any $n\ge 1$ and for all test functions whose Fourier transforms are supported in $\left(-2/n, \, 2/n\right)$. This is believed to be the natural limit of the current technology. Our work significantly extends beyond the trivial range $(-1/n, \, 1/n)$ and surpasses the previous record of $(-1/(n-1),\, 1/(n-1))$ whenever $n>2$. The Katz-Sarnak philosophy predicts that the aforementioned statistic can be modeled by the corresponding statistic for the eigenvalues of random orthogonal matrices. We prove that this is the case for test functions with Fourier support contained in $(-2/n,\, 2/n)$. The main technical innovation is a tractable vantage to evaluate the combinatorial zoo of terms, similar to the work of Conrey-Snaith and Mason-Snaith. As an application, our work provides better bounds on the order of vanishing at the central point for the $L$-functions in our family.

math.NT↗

arXiv2021

Irreducibility over the Max-Min Semiring

For sets $A, B\subset \mathbb N$, their sumset is $A + B := \{a+b: a\in A, b\in B\}$. If we cannot write a set $C$ as $C = A+B$ with $|A|, |B|\geq 2$, then we say that $C$ is $\textit{irreducible}$. The question of whether a given set $C$ is irreducible arises naturally in additive combinatorics. Equivalently, we can formulate this question as one about the irreducibility of boolean polynomials, which has been discussed in previous work by K. H. Kim and F. W. Roush (2005) and Y. Shitov (2014). We prove results about the irreducibility of polynomials and power series over the max-min semiring, a natural generalization of the boolean polynomials. We use combinatorial and probabilistic methods to prove that almost all polynomials are irreducible over the max-min semiring, generalizing work of Y. Shitov (2014) and proving a 2011 conjecture by D. L. Applegate, M. Le Brun, and N. J. A. Sloane. Furthermore, we use measure-theoretic methods and apply Borel's result on normal numbers to prove that almost all power series are asymptotically irreducible over the max-min semiring. This result generalizes work of E. Wirsing (1953).

math.CO↗

arXiv2021

The Generalized Bergman Game

Every positive integer may be written uniquely as a base-$β$ decomposition--that is a legal sum of powers of $β$--where $β$ is the dominating root of a non-increasing positive linear recurrence sequence. Guided by earlier work on a two-player game which produces the Zeckendorf Decomposition of an integer (see [Bai+19]), we define a broad class of two-player games played on an infinite tuple of non-negative integers which decompose a positive integer into its base-$β$ expansion. We call this game the Generalized Bergman Game. We prove that the longest possible Generalized Bergman game on an initial state $S$ with $n$ summands terminates in $Θ(n^2)$ time, and we also prove that the shortest possible Generalized Bergman game on an initial state terminates between $Ω(n)$ and $O(n^2)$ time. We also show a linear bound on the maximum length of the tuple used throughout the game.

math.NT↗