Related papers: Two-cover descent on hyperelliptic curves

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 irreducible smooth projective curve over $\mathbb{F}\_q$ is called \textit{pointless} if it has no $\mathbb{F}\_q$-rational points. In this paper we study the lower existence bound on the genus of such a curve over a fixed finite field…

We discuss sufficient conditions for a given curve to be covered by a maximal curve with the covering being unramified; it turns out that the given curve itself will be also maximal. We relate our main result to the question of whether or…

Let $K$ be an algebraically closed field of characteristic different from 2, $g$ a positive integer, $f(x)$ a degree $(2g+1)$ polynomial with coefficients in $K$ and without multiple roots, $C: y^2=f(x)$ the corresponding genus $g$…

In this article we give an algorithm for the computation of the number of rational points on the Jacobian variety of a generic ordinary hyperelliptic curve defined over a finite field of cardinality $q$ with time complexity $O(n^{2+o(1)})$…

We establish the sharp estimate <<_d N^{2/d} for the number of rational points of height at most N on an irreducible projective curve of degree d. We deduce this from a result for general hypersurfaces that is sensitive to the coefficients…

Consider an elliptic curve $\mathcal{C}$ with coefficients in $\mathbb{K}$ with $[\mathbb{K}:\mathbb{Q}]<\infty$ and $\delta \in \mathcal{C}(\mathbb{K})$ a non torsion point. We consider an elliptic difference equation $\sum_{i=0}^l a_i(p)…

We prove the first polynomial bound on the number of monotonic homotopy moves required to tighten a collection of closed curves on any compact orientable surface, where the number of crossings in the curve is not allowed to increase at any…

We revisit the classical dual ascent algorithm for minimization of convex functionals in the presence of linear constraints, and give convergence results which apply even for non-convex functionals. We describe limit points in terms of the…

In this paper we consider the question of whether there exists a hyperelliptic curve of genus $g$ which is defined over $\FF_q$ but has no rational points over $\FF_q$ for various pairs $(g,q)$.

We design and analyze an algorithm for computing rational points of hypersurfaces defined over a finite field based on searches on "vertical strips", namely searches on parallel lines in a given direction. Our results show that, on average,…

Quadratic Chabauty is a $p$-adic method for determining rational points on curves. Local heights are arithmetic invariants used in the quadratic Chabauty method. We present an algorithm to compute these local heights for hyperelliptic…

A method is presented for computing all the affine equivalences between two rational ruled surfaces defined by rational parametrizations that works directly in parametric rational form, i.e. without computing or making use of the implicit…

In this paper, we prove three related results; (1) Extension of our result in [10] to all generic hypersurfaces. More precisely, the normal sheaf of a generic rational map $c_0$ to a generic hypersurface $X_0$ of $\mathbf P^n, n\geq 4$ has…

We consider the problem of checking whether an elliptic curve defined over a given number field has complex multiplication. We study two polynomial time algorithms for this problem, one randomized and the other deterministic. The randomized…

This paper presents a fast and simple new 2-approximation algorithm for minimum weighted vertex cover. The unweighted version of this algorithm is equivalent to a well-known greedy maximal independent set algorithm. We prove that this…

In this paper, a new iterative two-level algorithm is presented for solving the finite element discretization for nonsymmetric or indefinite elliptic problems. The iterative two-level algorithm uses the same coarse space as the traditional…

We consider a Hamiltonian decomposition problem of partitioning a regular graph into edge-disjoint Hamiltonian cycles. It is known that verifying vertex non-adjacency in the 1-skeleton of the symmetric and asymmetric traveling salesperson…

We study families of ropes of any codimension that are supported on lines. In particular, this includes all non-reduced curves of degree two. We construct suitable smooth parameter spaces and conclude that all ropes of fixed degree and…

It is well known that an irreducible algebraic curve is rational (i.e. parametric) if and only if its genus is zero. In this paper, given a tolerance $\epsilon>0$ and an $\epsilon$-irreducible algebraic affine plane curve $\mathcal C$ of…