Search

In this paper, we conduct a data-scientific investigation of Maass forms. We find that averaging the Fourier coefficients of Maass forms with the same Fricke sign reveals patterns analogous to the recently discovered "murmuration" phenomenon, and that these patterns become more pronounced when parity is incorporated as an additional feature. Approximately 43% of the forms in our dataset have an unknown Fricke sign. For the remaining forms, we employ Linear Discriminant Analysis (LDA) to machine learn their Fricke sign, achieving 96% (resp. 94%) accuracy for forms with even (resp. odd) parity. We apply the trained LDA model to forms with unknown Fricke signs to make predictions. The average values based on the predicted Fricke signs are computed and compared to those for forms with known signs to verify the reasonableness of the predictions. Additionally, a subset of these predictions is evaluated against heuristic guesses provided by Hejhal's algorithm, showing a match approximately 95% of the time. We also use neural networks to obtain results comparable to those from the LDA model., Comment: 14 pages, 10 figures, 5 tables

We prove that the transitive permutation group 17T7, isomorphic to a split extension of $C_2$ by $\mathrm{PSL}_2(\mathbb{F}_{16})$, is a Galois group over the rationals. The group arises from the field of definition of the 2-torsion on an abelian fourfold with real multiplication defined over a real quadratic field. We find such fourfolds using Hilbert modular forms. Finally, building upon work of Demb\'el\'e, we show how to conjecturally reconstruct a period matrix for an abelian variety attached to a Hilbert modular form; we then use this to exhibit an explicit degree 17 polynomial with Galois group 17T7., Comment: 23 pages, comments welcome

For a fixed positive integer $e$, we describe an algorithm for computing, for all primes $p \leq X$, the mod-$p^e$ reduction of the trace of Frobenius at $p$ of a fixed hypergeometric motive over $\mathbb{Q}$ in time quasilinear in $X$. This extends our previous work for the mod-$p$ reduction, again combining the Beukers--Cohen--Mellit trace formula with average polynomial time techniques of Harvey and Harvey--Sutherland; the key new ingredient is an expanded version of Harvey's "generic prime" construction, making it possible to incorporate certain $p$-adic transcendental functions into the computation. One of these is the $p$-adic Gamma function, whose average polynomial time computation is an intermediate step which may be of independent interest. We also provide an implementation in Sage and discuss the remaining computational issues around computing hypergeometric $L$-series., Comment: 20 pages (refereed version); to appear in ANTS-XVI

We describe algorithms for computing geometric invariants for Hilbert modular surfaces, and we report on their implementation., Comment: 27 pages, to appear in LuCaNT proceedings

We describe an efficient algorithm which, given a principally polarized (p.p.) abelian surface $A$ over $\mathbb{Q}$ with geometric endomorphism ring equal to $\mathbb{Z}$, computes all the other p.p. abelian surfaces over $\mathbb{Q}$ that are isogenous to $A$. This algorithm relies on explicit open image techniques for Galois representations, and we employ a combination of analytic and algebraic methods to efficiently prove or disprove the existence of isogenies. We illustrate the practicality of our algorithm by applying it to 1 440 894 isogeny classes of Jacobians of genus 2 curves., Comment: Presented at the conference "LMFDB, Computation, and Number Theory" (LuCaNT), Jul 10-14, 2023 at ICERM

We present efficient algorithms for counting points on a smooth plane quartic curve $X$ modulo a prime $p$. We address both the case where $X$ is defined over $\mathbb F_p$ and the case where $X$ is defined over $\mathbb Q$ and $p$ is a prime of good reduction. We consider two approaches for computing $\#X(\mathbb F_p)$, one which runs in $O(p\log p\log\log p)$ time using $O(\log p)$ space and one which runs in $O(p^{1/2}\log^2\!p)$ time using $O(p^{1/2}\log p)$ space. Both approaches yield algorithms that are faster in practice than existing methods. We also present average polynomial-time algorithms for $X/\mathbb Q$ that compute $\#X(\mathbb F_p)$ for good primes $p\le N$ in $O(N\log^3\! N)$ time using $O(N)$ space. These are the first practical implementations of average polynomial-time algorithms for curves that are not cyclic covers of $\mathbb P^1$, which in combination with previous results addresses all curves of genus $g\le 3$. Our algorithms also compute Cartier-Manin/Hasse-Witt matrices that may be of independent interest., Comment: 32 pages

Given a prime power $q$ and $n \gg 1$, we prove that every integer in a large subinterval of the Hasse--Weil interval $[(\sqrt{q}-1)^{2n},(\sqrt{q}+1)^{2n}]$ is $#A(\mathbb{F}_q)$ for some geometrically simple ordinary principally polarized abelian variety $A$ of dimension $n$ over $\mathbb{F}_q$. As a consequence, we generalize a result of Howe and Kedlaya for $\mathbb{F}_2$ to show that for each prime power $q$, every sufficiently large positive integer is realizable, i.e., $#A(\mathbb{F}_q)$ for some abelian variety $A$ over $\mathbb{F}_q$. Our result also improves upon the best known constructions of sequences of simple abelian varieties with point counts towards the extremes of the Hasse--Weil interval. A separate argument determines, for fixed $n$, the largest subinterval of the Hasse--Weil interval consisting of realizable integers, asymptotically as $q \to \infty$; this gives an asymptotically optimal improvement of a 1998 theorem of DiPippo and Howe. Our methods are effective: We prove that if $q \le 5$, then every positive integer is realizable, and for arbitrary $q$, every positive integer $\ge q^{3 \sqrt{q} \log q}$ is realizable.

We describe an algorithm for computing, for all primes $p \leq X$, the mod-$p$ reduction of the trace of Frobenius at $p$ of a fixed hypergeometric motive in time quasilinear in $X$. This combines the Beukers--Cohen--Mellit trace formula with average polynomial time techniques of Harvey et al., Comment: 15 pages, 1 figure; v4 several exposition improvements as suggested the referees

We give an algorithm that takes a smooth hypersurface over a number field and computes a $p$-adic approximation of the obstruction map on the Tate classes of a finite reduction. This gives an upper bound on the "middle Picard number" of the hypersurface. The improvement over existing methods is that our method relies only on a single prime reduction and gives the possibility of cutting down on the dimension of Tate classes by two or more. The obstruction map comes from $p$-adic variational Hodge conjecture and we rely on the recent advancement by Bloch-Esnault-Kerz to interpret our bounds., Comment: 35 pages, 2 figures; v3 typos corrected and a new example

We discuss practical and some theoretical aspects of computing a database of classical modular forms in the L-functions and Modular Forms Database (LMFDB)., Comment: 63 pages; minor edits, including a correction to Conjecture 8.5.1

Inspired by experimental data, this paper investigates which isogeny classes of abelian varieties defined over a finite field of odd characteristic contain the Jacobian of a hyperelliptic curve. We provide a necessary condition by demonstrating that the Weil polynomial of a hyperelliptic Jacobian must have a particular form modulo 2. For fixed ${g\geq1}$, the proportion of isogeny classes of $g$ dimensional abelian varieties defined over $\mathbb{F}_q$ which fail this condition is $1 - Q(2g + 2)/2^g$ as $q\to\infty$ ranges over odd prime powers, where $Q(n)$ denotes the number of partitions of $n$ into odd parts., Comment: 15 pages, 1 figure. To appear in the Simons Symposia proceedings volume for the Simons Collaboration "Arithmetic Geometry, Number Theory and Computation"

We give some arithmetic-geometric interpretations of the moments M_2[a_1], M_1[a_2], and M_1[s_2] of the Sato-Tate group of an abelian variety A defined over a number field by relating them to the ranks of the endomorphism ring and N\'eron-Severi group of A., Comment: 4 pages

Assuming the Mumford-Tate conjecture, we show that the center of the endomorphism ring of an abelian variety defined over a number field can be recovered from an appropriate intersection of the fields obtained from its Frobenius endomorphisms. We then apply this result to exhibit a practical algorithm to compute this center., Comment: 12 pages, minor revision

We describe an algorithm to compute the zeta function of a cyclic cover of the projective line over a finite field of characteristic $p$ that runs in time $p^{1/2 + o(1)}$. We confirm its practicality and effectiveness by reporting on the performance of our SageMath implementation on a range of examples. The algorithm relies on Gon\c{c}alves's generalization of Kedlaya's algorithm for cyclic covers, and Harvey's work on Kedlaya's algorithm for large characteristic., Comment: 16 pages; v2 with minor changes

We give an interim report on some improvements and generalizations of the Abbott-Kedlaya-Roe method to compute the zeta function of a nondegenerate ample hypersurface in a projectively normal toric variety over $\mathbb{F}_p$ in linear time in $p$. These are illustrated with a number of examples including K3 surfaces, Calabi-Yau threefolds, and a cubic fourfold. The latter example is a non-special cubic fourfold appearing in the Ranestad-Voisin coplanar divisor on moduli space; this verifies that the coplanar divisor is not a Noether-Lefschetz divisor in the sense of Hassett., Comment: 17 pages, 3 figures; v3 updated discussion regarding cubic fourfolds

We describe several improvements to algorithms for the rigorous computation of the endomorphism ring of the Jacobian of a curve defined over a number field., Comment: 37 pages, 1 figure; v5 missing reference added

Let $\mathbb{P}$ denote the weighted projective space with weights $(1,1,1,3)$ over the rationals, with coordinates $x,y,z,$ and $w$; let $\mathcal{X}$ be the generic element of the family of surfaces in $\mathbb{P}$ given by \begin{equation*} X\colon w^2=x^6+y^6+z^6+tx^2y^2z^2. \end{equation*} The surface $\mathcal{X}$ is a K3 surface over the function field $\mathbb{Q}(t)$. In this paper, we explicitly compute the geometric Picard lattice of $\mathcal{X}$, together with its Galois module structure, as well as derive more results on the arithmetic of $\mathcal{X}$ and other elements of the family $X$., Comment: 20 pages; v2 with some all additions and clarifications suggested by the referee

We report on our results concerning the distribution of the geometric Picard ranks of $K3$ surfaces under reduction modulo various primes. In the situation that $\rk \Pic S_{\overline{K}}$ is even, we introduce a quadratic character, called the jump character, such that $\rk \Pic S_{\overline\bbF_{\!\frakp}} > \rk \Pic S_{\overline{K}}$ for all good primes, at which the character evaluates to $(-1)$., Comment: Revised version, corresponding to the first half of the original submission. To appear in Research in Number Theory

The zeta function of a curve $C$ over a finite field may be expressed in terms of the characteristic polynomial of a unitary matrix $\Theta_C$. We develop and present a new technique to compute the expected value of $\mathrm{Tr}(\Theta_C^n)$ for various moduli spaces of curves of genus $g$ over a fixed finite field in the limit as $g$ is large, generalizing and extending the work of Rudnick and Chinis. This is achieved by using function field zeta functions, explicit formulae, and the densities of prime polynomials with prescribed ramification types at certain places as given by Bucur, David, Feigon, Kaplan, Lal\'in and Wood [BDF$^+$16] and by Zhao. We extend [BDF$^+$16] by describing explicit dependence on the place and give an explicit proof of the Lindel\"{o}f bound for function field Dirichlet $L$-functions $L(1/2 + it, \chi)$. As applications, we compute the one-level density for hyperelliptic curves, cyclic $\ell$-covers, and cubic non-Galois covers., Comment: 24 pages

We study the behavior of geometric Picard ranks of K3 surfaces over the rationals under reduction modulo primes. We compute these ranks for reductions of smooth quartic surfaces modulo all primes $p<2^{16}$ in several representative examples and investigate the resulting statistics., Comment: 12 pages

In 2010 Zagier introduced the notion of a quantum modular form. One of his first examples was the "strange" function $F(q)$ of Kontsevich. Here we produce a new example of a quantum modular form by making use of some of Ramanujan's mock theta functions. Using these functions and their transformation behaviour, we also compute asymptotic expansions similar to expansions of $F(q)$., Comment: 7 pages

A Wilson prime is a prime p such that (p-1)! = -1 mod p^2. We report on a search for Wilson primes up to 2 * 10^13, and describe several new algorithms that were used in the search. In particular we give the first known algorithm that computes (p-1)! mod p^2 in average polynomial time per prime., Comment: 24 pages, simplified notation and space analysis

The best known unconditional deterministic complexity bound for computing the prime factorization of an integer N is O(M_int(N^(1/4) log N)), where M_int(k) denotes the cost of multiplying k-bit integers. This result is due to Bostan--Gaudry--Schost, following the Pollard--Strassen approach. We show that this bound can be improved by a factor of (log log N)^(1/2)., Comment: 7 pages