Related papers: Splitting primes

This work studies slice functions over finite-dimensional division algebras. Their zero sets are studied in detail along with their multiplicative inverses, for which some unexpected phenomena are discovered. The results are applied to…

We consider the issue of when the L-polynomial of one curve over $\F_q$ divides the L-polynomial of another curve. We prove a theorem which shows that divisibility follows from a hypothesis that two curves have the same number of points…

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…

Among topological modular forms with level structure, $TMF_0(7)$ at the prime $3$ is the first example that had not been understood yet. We provide a splitting of $TMF_0(7)$ at the prime 3 as $TMF$-module into two shifted copies of $TMF$…

We provide a framework for using elliptic curves with complex multiplication to determine the primality or compositeness of integers that lie in special sequences, in deterministic quasi-quadratic time. We use this to find large primes,…

For small odd primes $p$, we prove that most of the rational points on the modular curve $X_0(p)/w_p$ parametrize pairs of elliptic curves having infinitely many supersingular primes. This result extends the class of elliptic curves for…

For positive integers $K$ and $L$, we introduce and study the notion of $K$-multiplicative dependence over the algebraic closure $\overline{\mathbb{F}}_p$ of a finite prime field $\mathbb{F}_p$, as well as $L$-linear dependence of points on…

It is shown that there are finitely many perfect powers in an elliptic divisibility sequence whose first term is divisible by 2 or 3. For Mordell curves the same conclusion is shown to hold if the first term is greater than 1. Examples of…

We present several new heuristic algorithms to compute class polynomials and modular polynomials modulo a prime $p$ by revisiting the idea of working with supersingular elliptic curves. The best known algorithms to this date are based on…

Let $f(x)$ be a nonconstant polynomial with integer coefficients and nonzero discriminant. We study the distribution modulo primes of the set of squarefree integers $d$ such that the curve $dy^2=f(x)$ has a nontrivial rational or integral…

Let $(p_n)$ denote the sequence of prime numbers, with $2=p_1<p_2<\ldots$. We demonstrate the existence of an irrational number $\alpha$ having the property that the sequence $(\alpha p_n)$ is not well-distributed modulo $1$.

For $E/K$ an elliptic curve without complex multiplication we bound the index of the image of $\operatorname{Gal}(\bar{K}/K)$ in $\operatorname{GL}_2(\hat{\mathbb{Z}})$, the representation being given by the action on the Tate modules of…

Ideas and techniques from Khare's and Wintenberger's article on the proof of Serre's conjecture for odd conductors are used to establish that for a fixed prime l infinitely many of the groups PSL_2(F_{l^r}) (for r running) occur as Galois…

In this paper we present an iterative construction of irreducible polynomials over finite fields based upon repeated applications of transforms induced by endomorphisms of odd prime degree of ordinary elliptic curves.

We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…

Splitting a logic program allows us to reduce the task of computing its stable models to similar tasks for its subprograms. This can be used to increase solving performance and prove program correctness. We generalize the conditions under…

A number of authors have proven explicit versions of Lehmer's conjecture for polynomials whose coefficients are all congruent to 1 modulo m. We prove a similar result for polynomials f(X) that are divisible in (Z/mZ)[X] by a polynomial of…

It is well known that a polynomial $\phi(X)\in \mathbb{Z}[X]$ of given degree $d$ factors into at most $d$ factors in $\mathbb{F}_p$ for any prime $p$. We prove in this paper the existence of infinitely many primes $q$ so that the given…

Following work of V\'elez, we explicitly describe the splitting of the integral prime 2 in the radical extension $\mathbb{Q}(\sqrt[n]{a})$, where $x^n-a$ is an irreducible polynomial in $\mathbb{Z}[x]$. With previous work of the second…

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…