Related papers: Computing newforms using supersingular isogeny gra…

One of the biggest open problems in computational algebra is the design of efficient algorithms for Gr{\"o}bner basis computations that take into account the sparsity of the input polynomials. We can perform such computations in the case of…

Linear error-correcting codes can be used for constructing secret sharing schemes; however finding in general the access structures of these secret sharing schemes and, in particular, determining efficient access structures is difficult.…

We study biplane graphs drawn on a finite planar point set $S$ in general position. This is the family of geometric graphs whose vertex set is $S$ and can be decomposed into two plane graphs. We show that two maximal biplane graphs---in the…

For a graph G with real weights assigned to the vertices (edges), the MAX H-SUBGRAPH problem is to find an H-subgraph of G with maximum total weight, if one exists. The all-pairs MAX H-SUBGRAPH problem is to find for every pair of vertices…

The notions of bounded expansion and nowhere denseness not only offer robust and general definitions of uniform sparseness of graphs, they also describe the tractability boundary for several important algorithmic questions. In this paper we…

Fix a prime number $\ell$. Graphs of isogenies of degree a power of $\ell$ are well-understood for elliptic curves, but not for higher-dimensional abelian varieties. We study the case of absolutely simple ordinary abelian varieties over a…

Let $L(G)$ denote the maximum number of leaves in any spanning tree of a connected graph $G$. We show the (known) result that for the $n$-cube $Q_n$, $L(Q_n) \sim 2^n = |V(Q_n)|$ as $n\rightarrow \infty$. Examining this more carefully,…

The aim of this paper is to describe efficient algorithms for computing Maass waveforms on subgroups of the modular group PSL(2,Z) with general multiplier systems and real weight. A selection of numerical results obtained with these…

We prove a harmonically weighted equidistribution result for the $p$-th Satake parameters of the family of automorphic cuspidal representations of $\operatorname{PGSp}(2n)$ of fixed weight $\mathtt{k}$ and prime-to-$p$ level $N\to \infty$.…

We design new algorithms for approximating 2CSPs on graphs with bounded threshold rank, that is, whose normalized adjacency matrix has few eigenvalues larger than $\varepsilon$, smaller than $-\varepsilon$, or both. Unlike on worst-case…

We derive a mixed integer nonlinear programming formulation for the problem of finding a convex polygon with a given number of vertices that is small (diameter at most one) and has maximum perimeter. The formulation is based on a geometric…

We present a space and time efficient practical parallel algorithm for approximating the diameter of massive weighted undirected graphs on distributed platforms supporting a MapReduce-like abstraction. The core of the algorithm is a…

The all pairs shortest path problem (APSP) is one of the foundational problems in computer science. For weighted dense graphs on $n$ vertices, no truly sub-cubic algorithms exist to compute APSP exactly even for undirected graphs. This is…

We begin by explaining how to compute Fourier expansions at all cusps of any modular form of integral or half-integral weight thanks to a theorem of Borisov-Gunnells and explicit expansions of Eisenstein series at all cusps. Using this, we…

We quantify the topological expansion properties of bounded degree simplicial complexes in terms of a family of sublinear functions, in analogy with the separation profile of Benjamini-Schramm-Tim\'ar for classical expansion of bounded…

We consider generalized one-matrix models in which external fields allow control over the coordination numbers on both the original and dual lattices. We rederive in a simple fashion a character expansion formula for these models originally…

Let $N$ and $p$ be prime numbers with $p \geq 5$ such that $p || (N + 1)$. In a previous paper, we showed that there is a cuspform $f$ of weight 2 and level $\Gamma_0(N^2)$ whose $\ell$-th Fourier coefficient is congruent to $\ell + 1$…

We define the \emph{visual complexity} of a plane graph drawing to be the number of basic geometric objects needed to represent all its edges. In particular, one object may represent multiple edges (e.g., one needs only one line segment to…

We prove non-trivial bounds for bilinear forms with hyper-Kloosterman sums with characters modulo a prime $q$ which, for both variables of length $M$, are non-trivial as soon as $M\geq q^{3/8+\delta}$ for any $\delta>0$. This range, which…

We introduce a new family of closed differential forms naturally associated with minimal graphical submanifolds in Euclidean space, defined in arbitrary codimension. For each minimal graph, we construct an explicit closed form whose…