Related papers: Faster computation of the Tate pairing
We determine de Weierstrass semigroup of a pair of certain rational points on the GK-curves. We use this semigroup to obtain two-point AG codes with better parameters than comparable one-point AG codes arising from these curves. These…
Let $C$ be a curve of genus $g$ over a field $k$. We describe probabilistic algorithms for addition and inversion of the classes of rational divisors in the Jacobian of $C$. After a precomputation, which is done only once for the curve $C$,…
We present an algorithm for computing curves and families of curves of prescribed degree and geometric genus on real rational surfaces.
In this paper we give an algorithm of how to determine a Weierstrass equation with minimal discriminant for superelliptic curves generalizing work of Tate for elliptic curves and Liu for genus 2 curves.
Let E_G be a family of hyperelliptic curves defined by Y^2=Q(X,G), where Q is defined over a small finite field of odd characteristic. Then with g in an extension degree n field over this small field, we present a deterministic algorithm…
Macaulay dual spaces provide a local description of an affine scheme and give rise to computational machinery that is compatible with the methods of numerical algebraic geometry. We introduce eliminating dual spaces, use them for computing…
Elliptic functions are largely studied and standardized mathematical objects. The two usual approaches are due to Jacobi and Weierstrass. From a contour integral which allowed us to unify many summation formulae (Euler-MacLaurin, Poisson,…
The main goal of the paper is to introduce methods which compute B\'ezier curves faster than Casteljau's method does. These methods are based on the spectral factorization of a $n\times n$ Bernstein matrix, $B^e_n(s)= P_nG_n(s)P_n^{-1}$,…
In studying the complexity of iterative processes it is usually assumed that the arithmetic operations of addition, multiplication, and division can be performed in certain constant times. This assumption is invalid if the precision…
We present an accelerated Schoof-type point-counting algorithm for curves of genus 2 equipped with an efficiently computable real multiplication endomorphism. Our new algorithm reduces the complexity of genus 2 point counting over a finite…
The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to include any number of points with given…
Introducing an active space approximation is inevitable for the quantum computations of chemical systems. However, this approximation ignores the electron correlations related to non-active orbitals. Here, we propose a computational method…
We exhibit an algorithm to compute equations of an algebraic curve over a computable characteristic 0 field from the power series expansions of its regular 1-forms at a nonrational point of the curve, extending a 2005 algorithm of Baker,…
Censor-Hillel et al. [PODC'15] recently showed how to efficiently implement centralized algebraic algorithms for matrix multiplication in the congested clique model, a model of distributed computing that has received increasing attention in…
We count tilings of the $n \times m$ rectangular grid, cylinder, and torus with arbitrary tile sets up to arbitrary symmetries of the square and rectangle, along with cyclic shifting of rows and columns. This provides a unifying framework…
In this paper, we propose a new adaptation of the D-iteration algorithm to numerically solve the differential equations. This problem can be reinterpreted in 2D or 3D (or higher dimensions) as a limit of a diffusion process where the…
We present a new transform, triple dqds, to help to compute the eigenvalues of a real tridiagonal matrix C using real arithmetic. The algorithm uses the real dqds transform to shift by a real number and triple dqds to shift by a complex…
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…
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…
This is the text accompanying my Bourbaki seminar on the work of Einsiedler and Lindenstrauss on joinings. The first five sections surveys their proof of the classification of joinings of higher-rank torus actions on arithmetic quotients of…