Related papers: Computing newforms using supersingular isogeny gra…

We present a novel framework for studying combinatorial identities through the geometric lens of subset distributions in q-valued cubes. By analyzing how elements of arbitrary subsets are distributed among the faces of the cube E_q^n, we…

If $D$ is the definite quaternion algebra over $\qu$ of discriminant $p$, we compute, for any prime $p>3$, the number of infinite dimensional cusp forms on $D^*$ which are trivial at infinity, tamely ramified at $p$, and have given…

Every graph G can be embedded in a Euclidean space as a two-distance set. The Euclidean representation number of G is the smallest dimension in which G is representable by such an embedding. We consider spherical and J-spherical…

We give algorithms for approximating the partition function of the ferromagnetic $q$-color Potts model on graphs of maximum degree $d$. Our primary contribution is a fully polynomial-time approximation scheme for $d$-regular graphs with an…

We prove explicit approximation hardness results for the Graphic TSP on cubic and subcubic graphs as well as the new inapproximability bounds for the corresponding instances of the (1,2)-TSP. The proof technique uses new modular…

In \cite{Oh22}, the second author defined a complex of groups decomposition of the fundamental group of a finitely generated 2-dimensional special group, called an \emph{intersection complex}, which is a quasi-isometry invariant. In this…

The sup-norm problem in analytic number theory asks for the largest value taken by a given automorphic form. We observe that the function-field version of this problem can be reduced to the geometric problem of finding the largest dimension…

We study singularities obtained by the contraction of the maximal divisor in compact (non kaehlerian) surfaces which contain global spherical shells. These singularities are of genus 1 or 2, may be Q-Gorenstein, numerically Gorenstein or…

Ribbon graphs embedded on a Riemann surface provide a useful way to describe the double line Feynman diagrams of large N computations and a variety of other QFT correlator and scattering amplitude calculations, e.g in MHV rules for…

In recent years, a variety of randomized constructions of sketching matrices have been devised, that have been used in fast algorithms for numerical linear algebra problems, such as least squares regression, low-rank approximation, and the…

This document is a companion for the Maple program : Discrete series and K-types for U(p,q) available on:http://www.math.jussieu.fr/~vergne We explain an algorithm to compute the multiplicities of an irreducible representation of U(p)x U(q)…

Let (G,w) be a weighted graph. The necessary and sufficient conditions under which a weight w : E(G)-->R^+ can be extended to a pseudoultrametric on V(G) are found. A criterion of the uniqueness of this extension is also obtained. It is…

Cusp forms are certain holomorphic functions defined on the upper half-plane, and the space of cusp forms for the principal congruence subgroup $\Gamma(p)$, $p$ a prime, is acted by $\mathrm{SL}_2(\mathbb{F}_p)$. Meanwhile, there is a…

We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. All of our algorithms run in O(n) time, where n is the number of vertices in the graph. In our proofs, we present an embedding algorithm for…

We attempt to compute expressions in terms of the Dedekind eta function for all weight 2 new cusp forms with level up to 100, using methods of Allen et. al. In cases where no expression exists, we raise the level instead of the weight,…

We design fast deterministic algorithms for distance computation in the congested clique model. Our key contributions include: -- A $(2+\epsilon)$-approximation for all-pairs shortest paths in $O(\log^2{n} / \epsilon)$ rounds on unweighted…

We consider the problem of finding edges of a hidden weighted graph using a certain type of queries. Let $G$ be a weighted graph with $n$ vertices. In the most general setting, the $n$ vertices are known and no other information about $G$…

With the method of the relative trace formula and the classification of simple supercuspidal representations, we establish some Fourier trace formulas for automorphic forms on $PGL(2)$ of cubic level. As applications, we obtain a…

For a general dyadic grid, we give a Calder\'{o}n-Zygmund type decomposition, which is the principle fact about the multilinear maximal function $\mathfrak{M}$ on the upper half-spaces. Using the decomposition, we study the boundedness of…

We prove the conjectures on the ($L^{\infty}$)-sizes of the spaces of Siegel cusp forms of degree $n$, weight $k$, for any congruence subgroup in the weight aspect as well as for all principal congruence subgroups in the level aspect, in…