Related papers: Memory efficient hyperelliptic curve point countin…
The solution of linear systems of equations is a very frequent operation and thus important in many fields. The complexity using classical methods increases linearly with the size of equations. The HHL algorithm proposed by Harrow et al.…
This paper introduces a novel algorithm for solving the point-to-point shortest path problem in a static regular 8-neighbor connectivity (G8) grid. This algorithm can be seen as a generalization of Hadlock algorithm to G8 grids, and is…
Computing the edge expansion of a graph is a famously hard combinatorial problem for which there have been many approximation studies. We present two variants of exact algorithms using semidefinite programming (SDP) to compute this constant…
This paper deals with some nonlinear problems which exponential and biexponential decays are involved in. A proof of the quasiconvexity of the error function in some of these problems of optimization is presented. This proof is restricted…
The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms of global sections of line bundles on $E\times E$ and $E$, respectively, with respect to a given projective embedding of $E$…
We give a method for the computation of integral points on a hyperelliptic curve of odd degree over the rationals whose genus equals the Mordell-Weil rank of its Jacobian. Our approach consists of a combination of the $p$-adic approximation…
Skin modeling is an ongoing research area that highly benefits from modern parallel algorithms. This article aims at applying shape optimization to compute cell size and arrangement for elastic energy minimization of a cellular composite…
We describe a general methodology for enhancing the efficiency of adiabatic quantum computations (AQC). It consists of homotopically deforming the original "Hamiltonian surface" in a way that the redistribution of the Gaussian curvature…
We suggest a novel shape matching algorithm for three-dimensional surface meshes of disk or sphere topology. The method is based on the physical theory of nonlinear elasticity and can hence handle large rotations and deformations.…
Consider a hyperelliptic curve of genus $g$ over a field $K$ of characteristic zero. After extending $K$ we can view it as a marked curve with its $2g+2$ Weierstrass points. We prove some general properties of the stable reduction of this…
A novel algorithm to solve the quadratic programming problem over ellipsoids is proposed. This is achieved by splitting the problem into two optimisation sub-problems, quadratic programming over a sphere and orthogonal projection. Next, an…
We use an embedding of the symmetric $d$th power of any algebraic curve $C$ of genus $g$ into a Grassmannian space to give algorithms for working with divisors on $C$, using only linear algebra in vector spaces of dimension $O(g)$, and…
The use of time-domain boundary integral equations has proved very effective and efficient for three dimensional acoustic and electromagnetic wave equations. In even dimensions and when some dissipation is present, time-domain boundary…
We compute the $L$-functions of a large class of algebraic curves, and verify the expected functional equation numerically. Our computations are based on our previous results on stable reduction to calculate the local $L$-factor and the…
In [Pollack-Stevens 2011], efficient algorithms are given to compute with overconvergent modular symbols. These algorithms then allow for the fast computation of $p$-adic $L$-functions and have further been applied to compute rational…
A new algorithm to compute the restricted singular value decomposition of dense matrices is presented. Like Zha's method \cite{Zha92}, the new algorithm uses an implicit Kogbetliantz iteration, but with four major innovations. The first…
Many artificial intelligence (AI) problems naturally map to NP-hard optimization problems. This has the interesting consequence that enabling human-level capability in machines often requires systems that can handle formally intractable…
Let $p\ge5$ be a prime and $T$ a Kodaira type of the special fiber of an elliptic curve. We estimate the number of elliptic curves over $\mathbb Q$ up to height $X$ with Kodaira type $T$ at $p$. This enables us find the proportion of…
We analyze surface codes, the topological quantum error-correcting codes introduced by Kitaev. In these codes, qubits are arranged in a two-dimensional array on a surface of nontrivial topology, and encoded quantum operations are associated…
Consider a hyperelliptic curve of genus $g$ over a field $K$ of characteristic zero. After extending $K$ we can view it as a marked curve with its $2g+2$ Weierstrass points. We present an explicit algorithm to compute the stable reduction…