arXiv subjects
Publications and source records attributed to David Roe.
We give an algorithm for choosing a distinguished defining polynomial for a p-adic field extension. This algorithm formed an important ingredient in the recent expansion of the database of p-adic fields within the L-functions and modular forms database.
Given an integer $D$ and an ordinary isogeny class of abelian varieties defined over a finite field $\mathbb{F}_q$ with commutative $\mathbb{F}_q$-endomorphism algebra, we provide algorithms for computing all isogenies of degree dividing $D$ and polarizations of degree dividing $D$. We discuss phenomena that arise for higher dimension abelian varieties but not elliptic curves, bounds on the diameter of the graph of minimal isogenies, and decompositions of isogeny graphs into orbits for the Picard group of the Frobenius order.
We improve the database of $p$-adic fields in the LMFDB by systematically using Krasner-Monge polynomials and working relatively as well as absolutely. These improvements organize $p$-adic fields into families. They thereby make long lists of fields more manageable and various theoretical structures more evident. In particular, the database now includes all degree $n$ extensions of $\mathbb{Q}_p$, for $p<200$ and $n \leq 23$.
We describe a deterministic process to associate a practical, permanent label to isomorphism classes of abelian varieties defined over finite fields with commutative endomorphism algebra as long as they are ordinary or defined over a prime field. In the ordinary case, we also provide labels for the polarizations they admit.
A database of abstract groups has been added to the L-functions and Modular Forms Database (LMFDB), available at https://www.lmfdb.org/Groups/Abstract/. We discuss the functionality of the database and what makes it distinct from other available databases of abstract groups. We describe solutions to mathematical problems we encountered while creating the database, as well as connections between the abstract groups database and other collections of objects in the LMFDB.
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.
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.
Ahmadi-Shparlinski conjectured that every ordinary, geometrically simple Jacobian over a finite field has maximal angle rank. Using the L-Functions and Modular Forms Database, we provide two counterexamples to this conjecture in dimension 4.
This document is intended to summarize the theory and methods behind fq_isog collection inside the ab_var database in the LMFDB as well as some observations gleaned from these databases. This collection consists of tables of Weil q-polynomials, which by the Honda-Tate theorem are in bijection with isogeny classes of abelian varieties over finite fields.
We discuss practical and some theoretical aspects of computing a database of classical modular forms in the L-functions and Modular Forms Database (LMFDB).
We describe a method for counting the number of extensions of $\mathbb{Q}_p$ with a given Galois group $G$, founded upon the description of the absolute Galois group of $\mathbb{Q}_p$ due to Jannsen and Wingberg. Because this description is only known for odd $p$, our results do not apply to $\mathbb{Q}_2$. We report on the results of counting such extensions for $G$ of order up to $2000$ (except those divisible by $512$), for $p=3,5,7,11,13$. In particular, we highlight a relatively short list of minimal $G$ that do not arise as Galois groups. Motivated by this list, we prove two theorems about the inverse Galois problem for $\mathbb{Q}_p$: one giving a necessary condition for $G$ to be realizable over $\mathbb{Q}_p$ and the other giving a sufficient condition.
We present a new package ZpL for the mathematical software system SM. It implements a sharp tracking of precision on p-adic numbers, following the theory of ultrametric precision introduced in [4]. The underlying algorithms are mostly based on automatic dierentiation techniques. We introduce them, study their complexity and discuss our design choices. We illustrate the bene-ts of our package (in comparison with previous implementations) with a large sample of examples coming from linear algebra, com-mutative algebra and dierential equations.
We analyze the precision of the characteristic polynomial of an $n\times n$ p-adic matrix A using differential precision methods developed previously. When A is integral with precision O(p^N), we give a criterion (checkable in time O~(n^omega)) for $\chi$(A) to have precision exactly O(p^N). We also give a O~(n^3) algorithm for determining the optimal precision when the criterion is not satisfied, and give examples when the precision is larger than O(p^N).
We show that some types for supercuspidal representations of tamely ramified $p$-adic groups that appear in Jiu-Kang Yu's work are geometrizable. To do so, we define a function-sheaf dictionary for one-dimensional characters of arbitrary smooth group schemes over finite fields. In previous work we considered the case of commutative smooth group schemes and found that the standard definition of character sheaves produced a dictionary with a nontrivial kernel. In this paper we give a modification of the category of character sheaves that remedies this defect, and is also extensible to non-commutative groups. We then use these commutative character sheaves to geometrize the linear characters that appear in the types introduced by Jiu-Kang Yu, assuming that the character vanishes on a certain derived subgroup. To define geometric types, we combine commutative character sheaves with Gurevich and Hadani's geometrization of the Weil representation and Lusztig's character sheaves.
This paper introduces a novel graph-analytic approach for detecting anomalies in network flow data called GraphPrints. Building on foundational network-mining techniques, our method represents time slices of traffic as a graph, then counts graphlets -- small induced subgraphs that describe local topology. By performing outlier detection on the sequence of graphlet counts, anomalous intervals of traffic are identified, and furthermore, individual IPs experiencing abnormal behavior are singled-out. Initial testing of GraphPrints is performed on real network data with an implanted anomaly. Evaluation shows false positive rates bounded by 2.84% at the time-interval level, and 0.05% at the IP-level with 100% true positive rates at both.
Let $G$ be a connected reductive group over a non-Archimedean local field. We prove that its parahoric subgroups are definable in the Denef-Pas language, which is a first-order language of logic used in the theory of motivic integration developed by Cluckers and Loeser. The main technical result is the definability of the connected component of the N\'eron model of a tamely ramified algebraic torus. As a corollary, we prove that the canonical Haar measure on $G$, which assigns volume $1$ to the particular \emph{canonical} maximal parahoric defined by Gross, is motivic. This result resolves a technical difficulty that arose in Cluckers-Gordon-Halupczok and Shin-Templier and permits a simplification of some of the proofs in those articles. It also allows us to show that formal degree of a compactly induced representation is a motivic function of the parameters defining the representation.
Using the differential precision methods developed previously by the same authors, we study the p-adic stability of standard operations on matrices and vector spaces. We demonstrate that lattice-based methods surpass naive methods in many applications, such as matrix multiplication and sums and intersections of subspaces. We also analyze determinants , characteristic polynomials and LU factorization using these differential methods. We supplement our observations with numerical experiments.
We present a new method to propagate $p$-adic precision in computations, which also applies to other ultrametric fields. We illustrate it with many examples and give a toy application to the stable computation of the SOMOS 4 sequence.