Related papers: Computing twists of hyperelliptic curves

We develop a formula for tautological integrals over geometric subsets of the Hilbert scheme of points on complex manifolds. As an illustration of the theory, we derive a new iterated residue formula for the number of nodal curves in…

We give a method of counting the number of curves with a given type of singularity in a suitably ample linear series on a smooth surface using punctual Hilbert schemes. The types of singulaties for which our methods suffice include the…

We provide explicit faithful re-embeddings for all hyperelliptic curves of genus at most three and an algorithmic way to construct them. Both in the faithful tropicalization algorithm and the proofs of correctness, we showcase OSCAR-methods…

Using a quadratic version of the Bott residue theorem, we give a quadratic refinement of the count of twisted cubic curves on hypersurfaces and complete intersections in a projective space.

We introduce a novel class of rotation invariants of two dimensional curves based on iterated integrals. The invariants we present are in some sense complete and we describe an algorithm to calculate them, giving explicit computations up to…

We give an algorithm to determine factorization types of primes in the number fields generated by a single point of odd order on an elliptic curve. We apply this to compute coefficients of the Dedekind zeta function of the field.

We use an invariant-theoretic method to compute certain twists of the modular curves X(n) for n=7,9,11. Searching for rational points on these twists enables us to find non-trivial pairs of n-congruent elliptic curves over Q, i.e. pairs of…

This paper provides an algorithm enumerating superspecial trigonal curves of genus $5$ over finite fields. Executing the algorithm over a computer algebra system Magma, we enumerate them over finite fields $\mathbb{F}_{p^a}$ for any natural…

In this paper we study a family of curves obtained by fibre products of hyperelliptic curves. We then exploit this family to construct examples of curves of given genus g over a finite field Fq with many rational points. The results…

We present an efficient algorithm to compute the Hasse-Witt matrix of a hyperelliptic curve C/Q modulo all primes of good reduction up to a given bound N, based on the average polynomial-time algorithm recently introduced by Harvey. An…

We present a framework for constructing examples of smooth projective curves over number fields with explicitly given elements in their second K-group using elementary algebraic geometry. This leads to new examples for hyperelliptic curves…

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…

There is a natural question to ask whether the rich mathematical theory of the hyperelliptic curves can be extended to all superelliptic curves. Moreover, one wonders if all of the applications of hyperelliptic curves such as cryptography,…

We present a fast algorithm for computing discrete cubical homology of graphs over finite fields with an appropriate characteristic. This algorithm improves on several computational steps compared to constructions in the existing…

We investigate the geometry of smooth hyperelliptic curves that possess additional involutions, especially from the point of view of the Prym theory. Our main result is the injectivity of the Prym map for hyperelliptic…

We find a new class of the Fuchsian equations, which have an algebraic geometric solutions with the parameter belonging to a hyperelliptic curve. Methods of calculating the algebraic genus of the curve, and its branching points, are…

We find explicit equations for two-coverings of Jacobians of genus two curves over an arbitrary ground field of characteristic different from two.

By combining tools from different areas of mathematics, we obtain 3D visualizations of elliptic curves over different fields that faithfully capture the underlying algebra and geometry.

We describe algorithms based on invariant theory to solve problems on the geometry of curves, mainly those of genus 2, 3 and 4. New theoretical results building on the first author's PhD thesis are also included.

We study a popular algorithm for fitting polynomial curves to scattered data based on the least squares with gradient weights. We show that sometimes this algorithm admits a substantial reduction of complexity, and, furthermore, find…