Related papers: Explicit Coleman Integration in Larger Characteris…

Assuming GRH, we present an algorithm which inputs a prime $p$ and outputs the set of fundamental discriminants $D<0$ such that the reduction map modulo a prime above $p$ from elliptic curves with CM by $\order_{D}$ to supersingular…

We calculate convergent 3-loop Feynman diagrams containing a single massive loop equipped with twist $\tau =2$ local operator insertions corresponding to spin $N$. They contribute to the massive operator matrix elements in QCD describing…

We present a method of finding weighted Koppelman formulas for $(p,q)$-forms on $n$-dimensional complex manifolds $X$ which admit a vector bundle of rank $n$ over $X \times X$, such that the diagonal of $X \times X$ has a defining section.…

This note contains a generalization to $p>2$ of the authors' previous calculations of the coefficients of $(\mathbb{Z}/2)^n$-equivariant ordinary cohomology with coefficients in the constant $\mathbb{Z}/2$-Mackey functor. The algberaic…

We study congruences relating Fourier coefficients of meromorphic modular forms and Frobenius eigenvalues of elliptic curves corresponding to their poles. We develop a $p$-adic cohomological framework that interprets these congruences via…

In general dimension, there is no known total polynomial algorithm for either convex hull or vertex enumeration, i.e. an algorithm whose complexity depends polynomially on the input and output sizes. It is thus important to identify…

We are interested in the fast computation of the exact value of integrals of polynomial functions over convex polyhedra. We present speed ups and extensions of the algorithms presented in previous work. We present the new software…

Let C/Q be a curve of genus three, given as a double cover of a plane conic. Such a curve is hyperelliptic over the algebraic closure of Q, but may not have a hyperelliptic model of the usual form over Q. We describe an algorithm that…

The multiscale Monte-Carlo algorithm outlined in Bai and Brandt[1] is applied to a simple model of the polypeptide backbone. Effective coarse level Hamiltonians are derived by a fast Newtonian iterative scheme. The coarse Hamiltonian…

In arithmetic and algebraic geometry, superspecial (s.sp.\ for short) curves are one of the most important objects to be studied, with applications to cryptography and coding theory. If $g \geq 4$, it is not even known whether there exists…

We introduce a fully differentiable approximation to higher-order inference for coreference resolution. Our approach uses the antecedent distribution from a span-ranking architecture as an attention mechanism to iteratively refine span…

We establish a new perturbation theory for orthogonal polynomials using a Riemann--Hilbert approach and consider applications in numerical linear algebra and random matrix theory. This new approach shows that the orthogonal polynomials with…

We study exponential sums whose coefficients are completely multiplicative and belong to the complex unit disc. Our main result shows that such a sum has substantial cancellation unless the coefficient function is essentially a Dirichlet…

Higher-order tensor methods were recently proposed for minimizing smooth convex and nonconvex functions. Higher-order algorithms accelerate the convergence of the classical first-order methods thanks to the higher-order derivatives used in…

Elliptic curves have a well-known and explicit theory for the construction and application of endomorphisms, which can be applied to improve performance in scalar multiplication. Recent work has extended these techniques to hyperelliptic…

An idea of Hopf's for applying complex analysis to the study of constant mean curvature spheres is generalized to cover a wider class of spheres, namely, those satisfying a Weingarten relation of a certain type, namely H = f(H^2-K) for some…

Algorithms for many hypergraph problems, including partitioning, utilize multilevel frameworks to achieve a good trade-off between the performance and the quality of results. In this paper we introduce two novel aggregative coarsening…

We show that for an arbitrary totally complex number field $L$ the (regularized) critical $L$-values of algebraic Hecke characters of $L$ divided by certain periods are algebraic integers. This relies on a new construction of an equivariant…

We provide a quasilinear time algorithm for the $p$-center problem with an additive error less than or equal to 3 times the input graph's hyperbolic constant. Specifically, for the graph $G=(V,E)$ with $n$ vertices, $m$ edges and hyperbolic…

We present an efficient nodal discontinuous Galerkin method for approximating nearly incompressible flows using the Boltzmann equations. The equations are discretized with Hermite polynomials in velocity space yielding a first order…