Related papers: The Arithmetic of Curves Defined by Iteration

We generalize a theorem of D. Rohrlich concerning root numbers of elliptic curves over the field of rational numbers. Our result applies to curves of all higher genera over number fields. Namely, under certain conditions which naturally…

Let $C$ be a hyperelliptic curve given by the equation $y^2=f(x)$, where $f\in\Z[x]$ and $f$ hasn't multiple roots. We say that points $P_{i}=(x_{i}, y_{i})\in C(\Q)$ for $i=1,2,..., n$ are in arithmetic progression if the numbers $x_{i}$…

Let $C$ be a smooth plane curve. A point $P$ in the projective plane is said to be Galois with respect to $C$ if the function field extension induced from the point projection from $P$ is Galois. We denote by $\delta(C)$ (resp.…

We present a family of algorithms for computing the Galois group of a polynomial defined over a $p$-adic field. Apart from the "naive" algorithm, these are the first general algorithms for this task. As an application, we compute the Galois…

Given a family of rational curves depending on a real parameter, defined by its parametric equations, we provide an algorithm to compute a finite partition of the parameter space (${\Bbb R}$, in general) so that the shape of the family…

If F is a global function field of characteristic p>3, we employ Tate's theory of analytic uniformization to give an alternative proof of a theorem of Igusa describing the image of the natural Galois representation on torsion points of…

This note concerns the theoretical algorithmic problem of counting rational points on curves over finite fields. It explicates how the algorithmic scheme introduced by Schoof and generalized by the author yields an algorithm whose running…

Let $\mathbb F_{q^2}$ be the finite field with $q^2$ elements. We provide a simple and effective method, using reciprocal polynomials, for the construction of algebraic curves over $\mathbb F_{q^2}$ with many rational points. The curves…

A new characterization of rational torsion subgroups of elliptic curves is found, for points of order greater than 4, through the existence of solution for systems of Thue equations.

We introduce the class of rational plane curves parameterizable by conics as an extension of the family of curves parameterizable by lines (also known as monoid curves). We show that they are the image of monoid curves via suitable…

This paper introduces a novel approach to understanding Galois theory, one of the foundational areas of algebra, through the lens of machine learning. By analyzing polynomial equations with machine learning techniques, we aim to streamline…

We present a Galois theory of parameterized linear differential equations where the Galois groups are linear differential algebraic groups, that is, groups of matrices whose entries are functions of the parameters and satisfy a set of…

We determine all modular curves $X_0(N)$ with infinitely many quartic points. To do this, we define a pairing that induces a quadratic form representing all possible degrees of a rational morphism from $X_0(N)$ to a positive rank elliptic…

We introduce a notion of algorithmic randomness for algebraic fields. We prove the existence of a continuum of algebraic extensions of $\mathbb{Q}$ that are random according to our definition. We show that there are noncomputable algebraic…

We discuss the $\ell$-adic case of Mazur's "Program B" over $\mathbb{Q}$, the problem of classifying the possible images of $\ell$-adic Galois representations attached to elliptic curves $E$ over $\mathbb{Q}$, equivalently, classifying the…

We give practical algorithms for computing the divisor class group and the gonality of a curve over a finite field, achieving several orders of magnitude speedup over existing methods for sufficiently large genus or residue field. The…

We use explicit class field theory of rational function fields to prove a dynamical criterion for a polynomial of the form $x^{p^r}+ax+b$ over a field of characteristic $p$ to have dynamical Galois group as large as possible. When $p=2$ and…

Currently, the best upper bounds on the number of rational points on an absolutely irreducible, smooth, projective algebraic curve of genus g defined over a finite field F_q come either from Serre's refinement of the Weil bound if the genus…

We study the arithmetic (geometric) progressions in the $x$-coordinates of quadratic points on smooth projective planar curves defined over a number field $k$. Unless the curve is hyperelliptic, we prove that these progressions must be…

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…