Related papers: Fast point counting on genus two curves in charact…
We propose a fast approximate algorithm for large graph matching. A new projected fixed-point method is defined and a new doubly stochastic projection is adopted to derive the algorithm. Previous graph matching algorithms suffer from high…
We study the extent to which curves over finite fields are characterized by their zeta functions and the zeta functions of certain of their covers. Suppose C and C' are curves over a finite field K, with K-rational base points P and P', and…
We study quantum algorithms for problems in computational geometry, such as POINT-ON-3-LINES problem. In this problem, we are given a set of lines and we are asked to find a point that lies on at least $3$ of these lines. POINT-ON-3-LINES…
We present an algorithm for computing curves and families of curves of prescribed degree and geometric genus on real rational surfaces.
Given a genus $2$ curve $C$ with a rational Weierstrass point defined over a number field, we construct a family of genus $5$ curves that realize descent by maximal unramified abelian two-covers of $C$, and describe explicit models of the…
In 2010, A. Shpilka and I. Volkovich established a prominent result on the equivalence of polynomial factorization and identity testing. It follows from their result that a multilinear polynomial over the finite field of order 2 can be…
Pairing based cryptography is in a dangerous position following the breakthroughs on discrete logarithms computations in finite fields of small characteristic. Remaining instances are built over finite fields of large characteristic and…
We study the problem of determining the minimal genus of a simple finite connected graph. We present an algorithm which, for an arbitrary graph $G$ with $n$ vertices and $m$ edges, determines the orientable genus of $G$ in…
In this paper, we highlight that the point group structure of elliptic curves over finite or infinite fields, may be also observed on singular cubics with a quadratic component. Starting from this, we are able to introduce in a very general…
Kernel methods are an important class of techniques in machine learning. To be effective, good feature maps are crucial for mapping non-linearly separable input data into a higher dimensional (feature) space, thus allowing the data to be…
We give an algorithm to compute the conductor for curves of genus 2. It is based on the analysis of 3-torsion of the Jacobian for genus 2 curves over 2-adic fields.
A unique decoding algorithm for general AG codes, namely multipoint evaluation codes on algebraic curves, is presented. It is a natural generalization of the previous decoding algorithm which was only for one-point AG codes. As such, it…
In algebraic geometry, superspecial curves are important research objects. While the number of superspecial genus-3 curves in characteristic $p$ is known, the number of hyperelliptic ones among them has not been determined even for small…
We propose a fast and scalable algorithm to project a given density on a set of structured measures defined over a compact 2D domain. The measures can be discrete or supported on curves for instance. The proposed principle and algorithm are…
We develop algorithms to compute two versions of the motivic Hilbert zeta function for curve singularities: the classical version, applicable to singularities with a monomial valuation semigroup or to singular curves defined by…
We prove that the number of curves of a fixed genus g over finite fields is a polynomial function of the size of the field if and only if g is at most 8. Furthermore, we determine for each positive genus g the smallest n such that the…
A novel algorithm for creating a mathematical model of curved shapes is introduced. The core of the algorithm is based on building a graph representation of the contoured image, which occupies less storage space than produced by raster…
We show that efficient geodesics have the strong property of "super efficiency". For any two vertices, $v , w \in \mathcal{C}(S_g)$, in the complex of curves of a closed oriented surface of genus $g \geq 2 $, and any efficient geodesic, $v…
We show that the variation of the topology at infinity of a two-variable polynomial function is localisable at a finite number of "atypical points" at infinity. We construct an effective algorithm with low complexity in order to detect…
We determine all genus 2 curves, defined over $\mathbb C$, which have simultaneously degree 2 and 3 elliptic subcovers. The locus of such curves has three irreducible 1-dimensional genus zero components in $\mathcal M_2$. For each component…