Related papers: Computing twists of hyperelliptic curves
We give several algorithms addressing computations of intersections of conjugate subgroups.
The group of units modulo constants of an affine variety over an algebraically closed field is free abelian of finite rank. Computing this group is difficult but of fundamental importance in tropical geometry, where it is desirable to…
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…
Let $[K:\mathbb{Q}]=p$ be a prime number and let $E/K$ be an elliptic curve with $j(E) \in \mathbb{Q}$. We determine the all possibilities for $E(K)_{tors}$. We obtain these results by studying Galois representations of $E$ and of it's…
In this paper we study the possible torsions of elliptic curves over $\mathbb Q(i)$ and $\mathbb Q(\sqrt {-3})$.
We study smooth tropical plane quartic curves and show that they satisfy certain properties analogous to (but also different from) smooth plane quartics in algebraic geometry. For example, we show that every such curve admits either…
For affine algebraic plane curves we reduce a calculation of its invariants to calculation of the intersection of kernels of some derivations.
In this paper we study genus-$4$ curves obtained as double covers of elliptic curves. Firstly we shall give explicit defining equations of such curves with explicit criterion for whether it is nonsingular, and show the irreducibility of the…
We give a computational algorithm for computing Ext groups between bounded complexes of coherent sheaves on a projective variety, and we describe an implementation of this algorithm in Macaulay2. In particular, our results yield methods for…
Let E_G be a family of hyperelliptic curves over F2^(alg cl) with general Weierstrass equation given over a very small field F. We describe in this paper an algorithm to compute the zeta function of E_g for g in a degree n extension field…
We look for elliptic curves featuring rational points whose coordinates form two arithmetic progressions, one for each coordinate. A constructive method for creating such curves is shown, for lengths up to 5.
In the article, we exhibit a series of new examples of rigid plane curves, that is, curves, whose collection of singularities determines them almost uniquely up to a projective transformation of the plane.
We determine the crossing number of polynomial size curve systems on standard surfaces, in terms of the genus, up to high precision.
We compute numerically the homology of several graph complexes in low loop orders, extending previous results.
It has been conjectured that every algebraic curve may be defined either over its field of moduli or over an extension of degree two of it. In this paper we provide a negative answer to it by giving examples of hyperelliptic curves which…
We stratify families of projective and very affine hypersurfaces according to their topological Euler characteristic. Our new algorithms compute all strata using algebro-geometric techniques. For very affine hypersurfaces, we investigate…
We present a deterministic and explicit algorithm to compute the endomorphism rings of supersingular elliptic curves. As an example we compute the endomorphism rings of all supersingular elliptic curves defined over characteristic…
While the numbers of superspecial curves of genus at most 3 are well understood, and several computational approaches have been developed to count superspecial curves of genus 4 with large automorphism groups, much less is known in higher…
Abstractly, tropical hyperelliptic curves are metric graphs that admit a two-to-one harmonic morphism to a tree. They also appear as embedded tropical curves in the plane arising from triangulations of polygons with all interior lattice…
Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to…