Related papers: A database of rigorous Maass forms

We present a database of several hundred modular forms up to and including weight six on noncongruence subgroups of index $\leq 17$. In addition, our database contains expressions for the Belyi map for genus zero subgroups and equations of…

We develop a new algorithm to compute a basis for $M_k(\Gamma_0(N))$, the space of weight $k$ holomorphic modular forms on $\Gamma_0(N)$, in the case when the graded algebra of modular forms over $\Gamma_0(N)$ is generated at weight two.…

In this paper, we prove the existence of an efficient algorithm for the computation of $q$-expansions of modular forms of weight $k$ and level $\Gamma$, where $\Gamma \subseteq SL_{2}({\mathbb{Z}})$ is an arbitrary congruence subgroup. We…

We describe the computation of class groups and unit groups of number fields as implemented in Magma (V2.29). After quickly reviewing the main algorithms based on factor bases, relation collection, and analytic class number evaluation, we…

We describe an online database of number fields which accompanies this paper The database centers on complete lists of number fields with prescribed invariants. Our description here focuses on summarizing tables and connections to…

In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…

We derive an algorithm to rigorously compute and verify Maass cusp forms of squarefree level and trivial character. The main tool we use is an explicit version of the Selberg trace formula with Hecke operators due to Str\"{o}mbergsson. We…

We give explicit structure of the graded ring of modular forms with respect to Gamma(N) (N=1,2,3,4,5,6,7,8,9,10,12,16,18) and for some other congruence groups. We also study the modular forms of half-integer weight for certain groups.

For $n > 2$, let $\Gamma$ denote either $SL(n, Z)$ or $Sp(n, Z)$. We give a practical algorithm to compute the level of the maximal principal congruence subgroup in an arithmetic group $H\leq \Gamma$. This forms the main component of our…

We obtain asymptotic formulas for the number of matrices in the congruence subgroup \[ \Gamma_0(Q) = \left\{ A\in\mathrm{SL}_2(\mathbb Z):~c \equiv 0 \pmod Q\right\}, \] which are of naive height at most $X$. Our result is uniform in a very…

In two previous papers [AGM1, AGM2] we computed cohomology groups H^5(\Gamma_0 (N); \C) for a range of levels N, where \Gamma_0 (N) is the congruence subgroup of SL_4 (\Z) consisting of all matrices with bottom row congruent to (0,0,0,*)…

We give explicit formulae for a class of complex linear unitary characters of the congruence subgroups $\Gamma_0(N)$ which involve a variant of Rademacher's $\Psi$ function. We then prove that these characters cover all characters of…

Using the Kuznetsov formula, we prove several density theorems for exceptional Hecke and Laplacian eigenvalues of Maass cusp forms of weight 0 or 1 for the congruence subgroups $\Gamma_0(q)$, $\Gamma_1(q)$, and $\Gamma(q)$. These improve…

We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…

We present a Mathematica package for doing computations with gamma matrices, spinors, tensors and other objects, in any dimension and signature. The approach we use is based on defining the commutation relations of the relevant matrices,…

Graph neural networks (GNNs) are powerful deep learning models for graph-structured data, demonstrating remarkable success across diverse domains. Recently, the database (DB) community has increasingly recognized the potentiality of GNNs,…

Some recent additions to FORM are discussed. In particular large file support and the tablebases are presented.

In this paper, we present an algorithm to compute a basis of the space of algebraic modular forms on the maximal order of the definite quaternion algebra of discriminant $2$, and provide a database of such bases. One of our motivations is…

We survey group-theoretic algorithms for finding (some or all) subgroups of a finite group and discuss the implementation of these algorithms in the computer algebra system GAP

A statistical algorithm for categorizing different types of matches and fraud in image databases is presented. The approach is based on a generative model of a graph representing images and connections between pairs of identities, trained…