Related papers: Computing with necklaces on elliptic curves

Let $F$ be a number field and $p\geq7$ a rational prime. We obtain a simple descent criterion characterising those projective Galois representations $\overline\rho:G_F\to\mathrm{PGL}_2(\mathbb{F}_p)$ for which the corresponding twist…

In [Pollack-Stevens 2011], efficient algorithms are given to compute with overconvergent modular symbols. These algorithms then allow for the fast computation of $p$-adic $L$-functions and have further been applied to compute rational…

We present an oracle factorisation algorithm which finds a nontrivial factor of almost all positive integers $n$ based on the knowledge of the number of points on certain elliptic curves in residue rings modulo $n$.

We show that if $E/\mathbb{Q}$ is an elliptic curve without complex multiplication and for which there is a prime $q$ such that the image of $\bar{\rho}_{E,q}$ is contained in the normaliser of a split Cartan subgroup of…

Given an elliptic curve $E$ over a finite field $\F_q$ of $q$ elements, we say that an odd prime $\ell \nmid q$ is an Elkies prime for $E$ if $t_E^2 - 4q$ is a quadratic residue modulo $\ell$, where $t_E = q+1 - #E(\F_q)$ and $#E(\F_q)$ is…

We give a deterministic algorithm that very quickly proves the primality or compositeness of the integers N in a certain sequence, using an elliptic curve E/Q with complex multiplication by the ring of integers of Q(sqrt(-7)). The algorithm…

We prove the $p$-parity conjecture for elliptic curves over global fields of characteristic $p > 3$. We also present partial results on the $\ell$-parity conjecture for primes $\ell \neq p$.

Let H(N) denote the Hurwitz class number. It is known that if $p$ is a prime, then {equation*} \sum_{|r|<2\sqrt p}H(4p-r^2) = 2p. {equation*} In this paper, we investigate the behavior of this sum with the additional condition $r\equiv…

For the integer $ D=pq$ of the product of two distinct odd primes, we construct an elliptic curve $E_{2rD}:y^2=x^3-2rDx$ over $\mathbb Q$, where $r$ is a parameter dependent on the classes of $p$ and $q$ modulo 8, and show, under the parity…

The modular curves serve as excellent objects for testing conjectures in arithmetic geometry. They possess a natural geometric definition in contrast with rather nontrivial structure. On the other hand, they are well-studied from the…

In this paper, $p$ and $q$ are two different odd primes. First, We construct the congruent elliptic curves corresponding to $p$, $2p$, $pq$, and $2pq,$ then, in the cases of congruent numbers, we determine the rank of the corresponding…

Using a combination of several powerful modularity theorems and class field theory we derive a new modularity theorem for semistable elliptic curves over certain real abelian fields. We deduce that if $K$ is a real abelian field of…

We obtain asymptotic formulae for the number of primes $p\le x$ for which the reduction modulo $p$ of the elliptic curve $$ \E_{a,b} : Y^2 = X^3 + aX + b $$ satisfies certain ``natural'' properties, on average over integers $a$ and $b$ with…

We show how the modular symmetries that have been found to be consistent with most available scaling data from quantum Hall systems, derive from a rigid family of algebraic curves of the elliptic type. The complicated special functions…

Let $E$ be an elliptic curve defined over $\mathbb{Q}$ and, for a prime $p$ of good reduction for $E$ let $\tilde{E}_p$ denote the reduction of $E$ modulo $p$. Inspired by an elliptic curve analogue of Artin's primitive root conjecture…

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…

The classification of elliptic curves E over the rationals Q is studied according to their torsion subgroups E_{tors}(Q) of rational points. Explicit criteria for the classification are given when E_{tors}(Q) are cyclic groups with even…

We study the automorphisms of the non-split Cartan modular curves $X_{ns}(p)$ of prime level $p$. We prove that if $p\geq 37$ all the automorphisms preserve the cusps. Furthermore, if $p\equiv 1\text{ mod }12$ and $p\neq 13$, the…

A well-known and difficult problem in computational number theory and algebraic geometry is to write down equations for branched covers of algebraic curves with specified monodromy type. In this article, we present a technique for computing…

We address two variants of the classical necklace counting problem from enumerative combinatorics. In both cases, we fix a finite group $\mathcal{G}$ and a positive integer $n$. In the first variant, we count the ``identity-product…