Related papers: Hunting for curves with many points

The formal group law of an elliptic curve has seen recent applications to computational algebraic geometry in the work of Couveignes to compute the order of an elliptic curve over finite fields of small characteristic. The purpose of this…

In this work, we propose a novel technique to generate shapes from point cloud data. A point cloud can be viewed as samples from a distribution of 3D points whose density is concentrated near the surface of the shape. Point cloud generation…

We consider families of smooth projective curves of genus 2 with a single point removed and study their integral points. We show that in many such families there is a dense set of fibres for which the integral points can be effectively…

The action of the mapping class group of a surface on the collection of homotopy classes of disjointly embedded curves or arcs in the surface is discussed here as a tool for understanding Riemann's moduli space and its topological and…

The weight hierarchy of generalized Reed-Muller codes over arbitrary finite fields was determined by Heijnen and Pellikaan. In this paper we produce curves over finite fields with many points which are closely related to this weight…

We prove results concerning the specialisation of torsion line bundles on a variety $V$ defined over $\mathbb{Q}$ to ideal classes of number fields. This gives a new general technique for constructing and counting number fields with large…

We determine all complex hyperelliptic curves with many automorphisms and decide which of their jacobians have complex multiplication.

We construct new examples of free curve arrangements in the complex projective plane using point-line operators recently defined by the second author. In particular, we construct a new example of a conic-line arrangement with ordinary…

Genus 5 curves can be hyperelliptic, trigonal, or non-hyperelliptic non-trigonal, whose model is a complete intersection of three quadrics in $\mathbb{P}^4$. We present and explain algorithms we used to determine, up to isomorphism over…

We prove that there are only finitely many modular curves of $D$-elliptic sheaves over $\mathbb{F}_q(T)$ which are hyperelliptic. In odd characteristic we give a complete classification of such curves.

In this paper we investigate Uludag's method for constructing new curves whose fundamental groups are central extensions of the fundamental group of the original curve by finite cyclic groups. In the first part, we give some generalizations…

The "defect" of a curve over a finite field is the difference between the number of rational points on the curve and the Weil-Serre bound for the curve. We present a construction for producing genus-4 double covers of genus-2 curves over…

We introduce a generalisation of norm relations in the group algebra Q[G], where G is a finite group. We give some properties of these relations, and use them to obtain relations between the S-unit groups of different subfields of the same…

In this paper, we initiate a systematic study of entanglements of division fields from a group theoretic perspective. For a positive integer $n$ and a subgroup $G\subseteq \text{GL}_2(\mathbb{Z}/{n}\mathbb{Z})$ with surjective determinant,…

We generalize the explicit quadratic Chabauty techniques for integral points on odd degree hyperelliptic curves and for rational points on genus 2 bielliptic curves to arbitrary number fields using restriction of scalars. This is achieved…

In this article, we give a numerical algorithm to compute braid groups of curves, hyperplane arrangements, and parameterized system of polynomial equations. Our main result is an algorithm that determines the cross-locus and the generators…

We discuss the possibility of the existence of finite algorithms that may give distinct knot classes. In particular we present two attempts for such algorithms which seem promising, one based on knot projections on a plane, the other on…

In this article we give the details of an effective point counting algorithm for genus two curves over finite fields of characteristic three. The algorithm has an application in the context of curve based cryptography. One distinguished…

Let $S$ be a connected orientable surface of finite topological type. We prove that there is an exhaustion of the curve complex $\mathcal{C}(S)$ by a sequence of finite rigid sets.

In this paper we give an algorithm to determine all finite matrix groups over a number field. Our algorithm is based on the representation theory of finite groups.