Related papers: Computing newforms using supersingular isogeny gra…

In this paper, we explore a two-way connection between quasimodular forms of depth $1$ and a class of second-order modular differential equations with regular singularities on the upper half-plane and the cusps. Here we consider the cases…

We provide a very effective and explicit algorithm of finding a Puiseux expansion of a cuspidal singularity of a plane curve, when this singularity is given in a parametric form.

This paper develops analityc methods for investigating uniform hypergraphs. Its starting point is the spectral theory of 2-graphs, in particular, the largest and the smallest eigenvalues of 2-graphs. On the one hand, this simple setup is…

We establish a version of the Furstenberg-Katznelson multi-dimensional Szemer\'edi in the primes ${\mathcal P} := \{2,3,5,\ldots\}$, which roughly speaking asserts that any dense subset of ${\mathcal P}^d$ contains constellations of any…

We dominate non-integral singular operators by adapted sparse operators and derive optimal norm estimates in weighted spaces. Our assumptions on the operators are minimal and our result applies to an array of situations, whose prototype are…

We design two variational algorithms to optimize specific 2-local Hamiltonians defined on graphs. Our algorithms are inspired by the Quantum Approximate Optimization Algorithm. We develop formulae to analyze the energy achieved by these…

High dimensional expanders simultaneously satisfying spectral and combinatorial (coboundary) expansion have recently played a major role in breakthroughs in PCP and coding theory, but the only known construction of such complexes is…

As the popularity of graph data increases, there is a growing need to count the occurrences of subgraph patterns of interest, for a variety of applications. Many graphs are massive in scale and also fully dynamic (with insertions and…

We present a framework to define a large class of neural networks for which, by construction, training by gradient flow provably reaches arbitrarily low loss when the number of parameters grows. Distinct from the fixed-space global…

Weierstrass representation is a classical parameterization of minimal surfaces. However, two functions should be specified to construct the parametric form in Weierestrass representation. In this paper, we propose an explicit parametric…

Constructing a spanning tree of a graph is one of the most basic tasks in graph theory. We consider a relaxed version of this problem in the setting of local algorithms. The relaxation is that the constructed subgraph is a sparse spanning…

We consider higher-dimensional generalizations of the normalized Laplacian and the adjacency matrix of graphs and study their eigenvalues for the Linial-Meshulam model $X^k(n,p)$ of random $k$-dimensional simplicial complexes on $n$…

We propose two fixed-parameter tractable algorithms for the weighted Max-Cut problem on embedded 1-planar graphs parameterized by the crossing number $k$ of the given embedding. A graph is called 1-planar if it can be drawn in the plane…

We give explicit upper bounds for the coefficients of arbitrary weight $k$, level 2 cusp forms, making Deligne's well-known $O(n^{\frac{k-1}{2}+\epsilon})$ bound precise. We also derive asymptotic formulas and explicit upper bounds for the…

We design algorithms for fitting a high-dimensional statistical model to a large, sparse network without revealing sensitive information of individual members. Given a sparse input graph $G$, our algorithms output a…

We consider supersymmetry in five dimensions, where the fermionic parameters are a 2-form under SL(5). Supermultiplets are investigated using the pure spinor superfield formalism, and are found to be closely related to infinite-dimensional…

There is a lifting from a non-CM elliptic curve $E/\mathbb{Q}$ to a paramodular form $f$ of degree $2$ and weight $3$ given by the symmetric cube map. We find the level of $f$ in an explicit way in terms of the coefficients of the…

We prove that the Weisfeiler-Leman (WL) dimension of the class of all finite planar graphs is at most 3. In particular, every finite planar graph is definable in first-order logic with counting using at most 4 variables. The previously best…

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 use the embedding tensor method to construct the most general maximal gauged/massive supergravity in d=9 dimensions and to determine its extended field content. Only the 8 independent deformation parameters (embedding tensor components,…