Related papers: Universal elliptic Gau{\ss} sums and applications
The field diffracted from a one-dimensional, coherently illuminated periodic structure at fractional Talbot distances can be described as a coherent sum of shifted units cells weighted by a set of phases given by quadratic Gauss sums. We…
We summarize recent computations with a class of elliptic generalizations of polylogarithms, arising from the massive sunrise integral. For the case of arbitrary masses we obtain results in two and four space-time dimensions. The iterated…
We put together some known theoretical results and the fact that certain computations can be done efficiently in SAGE to come up with a fast algorithm for calculating congruence primes linking a newform with integer coefficients (i.e. a…
We define a parametric variant of generalized Euler sums and construct contour integration to give some explicit evaluations of these parametric Euler sums. In particular, we establish several explicit formulas of (Hurwitz) zeta functions,…
The classical modular polynomial for $j$-invariants describes the relation between two elliptic curves connected by isogenies. This polynomial has been applied to various algorithms in computational number theory, such as point counting on…
In this paper we connect classical differential geometry with the concepts from geometric calculus. Moreover, we introduce and analyze a more general Laplacian for multivector-valued functions on manifolds. This allows us to formulate a…
Gauss quadrature integral approximation is extended to include integrals with a measure consisting of continuous as well as discrete components. That is, we give an approximation for the integral of a function plus its sum over a discrete…
Representation theory and the theory of symmetric functions have played a central role in Random Matrix Theory in the computation of quantities such as joint moments of traces and joint moments of characteristic polynomials of matrices…
We give two general transformations that allows certain quite general basic hypergeometric multi-sums of arbitrary depth (sums that involve an arbitrary sequence $\{g(k)\}$), to be reduced to an infinite $q$-product times a single basic…
We present a practical application of parallel symbolic computation in General Relativity: the calculation of curvature invariants for large dimension. We discuss the structure of the calculations, an implementation of the technique and…
Elliptic curves are planar curves which can be used to define an abelian group. The efficient computation of discrete logarithms over this group is a longstanding problem relevant to cryptography. It may be possible to efficiently compute…
We give an explicit construction of the cusp eigenforms on an elliptic curve defined over a finite field using the theory of Hall algebras and the Langlands correspondence for function fields and $\GL_n$. As a consequence we obtain a…
We prove that all elliptic curves defined over the cyclotomic $\mathbb{Z}_p$-extension of a real quadratic field are modular under the assumption that the algebraic part of the central value of a twisted $L$-function is a $p$-adic unit. Our…
We use the tropical geometry approach to compute absolute and relative Gromov-Witten invariants of complex surfaces which are $\CC P^1$-bundles over an elliptic curve. We also show that the tropical multiplicity used to count curves can be…
In this paper, we obtain some formulae for harmonic sums, alternating harmonic sums and Stirling number sums by using the method of integral representations of series. As applications of these formulae, we give explicit formula of several…
Given an elliptic curve E over a number field k, the Galois action on the torsion points of E induces a Galois representation, \rho_E : Gal(\bar{k}/k) \to GL_2(\hat{Z}). For a fixed number field k, we describe the image of \rho_E for a…
Many domains, from deep learning to finance, require compounding real numbers over long sequences, often leading to catastrophic numerical underflow or overflow. We introduce generalized orders of magnitude (GOOMs), a principled extension…
We introduce a new iterative method for computing solutions of elliptic equations with random rapidly oscillating coefficients. Similarly to a multigrid method, each step of the iteration involves different computations meant to address…
Algorithms for numerical computation of symmetric elliptic integrals of all three kinds are improved in several ways and extended to complex values of the variables (with some restrictions in the case of the integral of the third kind).…
We present several new heuristic algorithms to compute class polynomials and modular polynomials modulo a prime $p$ by revisiting the idea of working with supersingular elliptic curves. The best known algorithms to this date are based on…