arXiv subjects

Guido Lido

Publications and source records attributed to Guido Lido.

5 recordsLinked to original sources

arXiv2025

Maximal curves over finite fields and a modular isogeny

We prove the existence of curves of genus $7$ and $12$ over the field with $11^5$ elements, reaching the Hasse-Weil-Serre upper bound. These curves are quotients of modular curves and we give explicit equations. We compute the number of points of many quotient modular curves in the same family without providing equations. For various pairs (genus, finite field) we find new records for the largest known number of points. In other instances we find quotient modular curves that are maximal, matching already known results. To perform these computations, we provide a generalization of Chen's isogeny result.

math.NT↗

arXiv2025

A provably quasi-polynomial algorithm for the discrete logarithm problem in finite fields of small characteristic

We describe a provably quasi-polynomial algorithm to compute discrete logarithms in the multiplicative groups of finite fields of small characteristic, that is finite fields whose characteristic is logarithmic in the order. We partially follow the heuristically quasi-polynomial algorithm presented by Barbulescu, Gaudry, Joux and Thome'. The main difference is to use a presentation of the finite field based on elliptic curves: the abundance of elliptic curves ensures the existence of such a presentation.

math.NT↗

arXiv2022

Modular Curves with many Points over Finite Fields

We describe an algorithm to compute the number of points over finite fields on a broad class of modular curves: we consider quotients $X_H/W$ for $H$ a subgroup of $\GL_2(\mathbb Z/n\mathbb Z)$ such that for each prime $p$ dividing $n$, the subgroup $H$ at $p$ is either a Borel subroup, a Cartan subgroup, or the normalizer of a Cartan subgroup of $\GL_2(\mathbb Z/p^e\mathbb Z)$, and for $W$ any subgroup of the Atkin-Lehner involutions of $X_H$. We applied our algorithm to more than ten thousands curves of genus up to 50, finding more than one hundred record-breaking curves, namely curves $X/\FF_q$ with genus $g$ that improve the previously known lower bound for the maximum number of points over $\FF_q$ of a curve with genus $g$. As a key technical tool for our computations, we prove the generalization of Chen's isogeny to all the Cartan modular curves of composite level.

math.NT↗

arXiv2021

Automorphisms of Cartan modular curves of prime and composite level

We study the automorphisms of modular curves associated to Cartan subgroups of $\mathrm{GL}_2(\mathbb Z/n\mathbb Z)$ and certain subgroups of their normalizers. We prove that if $n$ is large enough, all the automorphisms are induced by the ramified covering of the complex upper half-plane. We get new results for non-split curves of prime level $p\ge 13$: the curve $X_{\text{ns}}^+(p)$ has no non-trivial automorphisms, whereas the curve $X_{\text{ns}}(p)$ has exactly one non-trivial automorphism. Moreover, as an immediate consequence of our results we compute the automorphism group of $X_0^*(n):=X_0(n)/W$, where $W$ is the group generated by the Atkin-Lehner involutions of $X_0(n)$ and $n$ is a large enough square.

math.NT↗

arXiv2021

Geometric quadratic Chabauty

Determining all rational points on a curve of genus at least 2 can be difficult. Chabauty's method (1941) is to intersect, for a prime number p, in the p-adic Lie group of p-adic points of the jacobian, the closure of the Mordell-Weil group with the p-adic points of the curve. If the Mordell-Weil rank is less than the genus then this method has never failed. Minhyong Kim's non-abelian Chabauty programme aims to remove the condition on the rank. The simplest case, called quadratic Chabauty, was developed by Balakrishnan, Dogra, Mueller, Tuitman and Vonk, and applied in a tour de force to the so-called cursed curve (rank and genus both 3). This article aims to make the quadratic Chabauty method small and geometric again, by describing it in terms of only `simple algebraic geometry' (line bundles over the jacobian and models over the integers).

math.AG↗