Related papers: Computing newforms using supersingular isogeny gra…
In this paper, we propose an algorithm to enumerate genus-4 superspecial hyperelliptic curves whose automorphism groups isomorphic to the quaternion group. By implementing this algorithm with Magma, we successfully obtain the number of…
We describe an algorithm to rigorously compute the power series expansion at a CM point of a weight $2$ cusp form of level coprime to $6$. Our algorithm works by bounding the denominators that appear due to ramification, and without…
We describe an algorithm for the exhaustive generation of non-isomorphic graphs with a given number $k \ge 0$ of hamiltonian cycles, which is especially efficient for small $k$. Our main findings, combining applications of this algorithm…
A hypergraph is said to be $1$-Sperner if for every two hyperedges the smallest of their two set differences is of size one. We present several applications of $1$-Sperner hypergraphs and their structure to graphs. In particular, we…
We consider the problem of approximately solving constraint satisfaction problems with arity $k > 2$ ($k$-CSPs) on instances satisfying certain expansion properties, when viewed as hypergraphs. Random instances of $k$-CSPs, which are also…
We consider two classes of random graphs: $(a)$ Poissonian random graphs in which the $n$ vertices in the graph have i.i.d.\ weights distributed as $X$, where $\mathbb{E}(X) = \mu$. Edges are added according to a product measure and the…
Let $N$ be a prime and $\phi$ be a Hecke-Maass cuspidal newform for the Hecke congruence subgroup $\Gamma_0(N)$ in $\operatorname{SL}_n(\mathbb{R})$. Let $\Omega$ be an adelic compactum and let $\Omega_N$ be its projection to $\Gamma_0(N)…
We prove several dimension formulas for spaces of scalar-valued Siegel modular forms of degree $2$ with respect to certain congruence subgroups of level $4$. In case of cusp forms, all modular forms considered originate from cuspidal…
We prove an upper bound for the L^4-norm and for the L^2-norm restricted to the vertical geodesic of a holomorphic Hecke cusp form of large weight. The method is based on Watson's formula and estimating a mean value of certain L-functions…
I give an algorithm for computing the full space of automorphic forms for definite unitary groups over Q, and apply this to calculate the automorphic forms of level $G(Z-hat)$ and various small weights for an example of a rank 3 unitary…
We give a summary of results for dimensions of spaces of cuspidal Siegel modular forms of degree 2. These results together with a list of dimensions of the irreducible representations of the finite groups GSp(4,Fp) are then used to produce…
We use isomorphism $\varphi$ between matrix algebras and simple orthogonal Clifford algebras $\cl(Q)$ to compute matrix exponential ${e}^{A}$ of a real, complex, and quaternionic matrix A. The isomorphic image $p=\varphi(A)$ in $\cl(Q),$…
In this paper, we present a polynomial-time algorithm that approximates sufficiently high-value Max 2-CSPs on sufficiently dense graphs to within $O(N^{\varepsilon})$ approximation ratio for any constant $\varepsilon > 0$. Using this…
Hypergraphs are an invaluable tool to understand many hidden patterns in large data sets. Among many ways to represent hypergraph, one useful representation is that of weighted clique expansion. In this paper, we consider this…
This paper presents an adaptation of recently developed algorithms for quadratic forms over number fields in arXiv:1304.0708 to global function fields of odd characteristics. First, we present algorithm for checking if a given…
We solve the graph bi-partitioning problem in dense graphs with arbitrary degree distribution using the replica method. We find the cut-size to scale universally with <k^1/2>. In contrast, earlier results studying the problem in graphs with…
We provide an explicit and algorithmic version of a theorem of Momose classifying isogenies of prime degree of elliptic curves over number fields, which we implement in Sage and PARI/GP. Combining this algorithm with recent work of…
We provide an algorithm to compute the 2-norm maximum of a multilinear map over a product of spheres. As a corollary we give a method to compute the first singular value of a linear map and an application to the theory of entangled states…
We propose a novel variational method for solving the sub-graph isomorphism problem on a gate-based quantum computer. The method relies (1) on a new representation of the adjacency matrices of the underlying graphs, which requires a number…
We give a formula for the number of newforms in $S_k^{\mathrm{new}}(N)$ that have prescribed ramified supercuspidal components $\pi_p$ at a set $T$ of primes dividing $N$. This dimension is given in terms of the trace of the Atkin--Lehner…