Related papers: The Counting function for Elkies primes

Let $q=p^{e}$ be a prime power, $\ell$ be a prime number different from $p$, and $n$ be a positive integer divisible by neither $p$ nor $\ell$. In this paper we define the $\ell$-adic $q$-cyclotomic system $\mathcal{PC}(\ell,q,n)$ with base…

Let $P$ be a set of points in general position in the plane. Join all pairs of points in $P$ with straight line segments. The number of segment-crossings in such a drawing, denoted by $\crg(P)$, is the \emph{rectilinear crossing number} of…

We study how the torsion of elliptic curves over number fields grows upon base change, and in particular prove various necessary conditions for torsion growth. For a number field $F$, we show that for a large set of number fields $L$, whose…

Let $q$ be a prime power, and let $r=nk+1$ be a prime such that $r\nmid q$, where $n$ and $k$ are positive integers. Under a simple condition on $q$, $r$ and $k$, a Gauss period of type $(n,k)$ is a normal element of $\Bbb F_{q^n}$ over…

Let g >= 1 and let Q be a monic, squarefree polynomial of degree 2g + 1 in Z[x]. For an odd prime p not dividing the discriminant of Q, let Z_p(T) denote the zeta function of the hyperelliptic curve of genus g over the finite field F_p…

It is well known that limits can be computed by restricting along an initial functor, and that this often simplifies limit computation. We systematically study the algorithmic implications of this idea for diagrams indexed by a finite…

Let $E$ be an elliptic curve defined over a number field $K$. We say that a prime number $p$ is exceptional for $(E,K)$ if $E$ admits a $p$-isogeny defined over $K$. The so-called exceptional set of all such prime numbers is finite if and…

Let $\mathbb{F}_q$ be the finite field of $q$ elements. In this paper we obtain bounds on the following counting problem: given a polynomial $f(x)\in \mathbb{F}_q[x]$ of degree $k+m$ and a non-negative integer $r$, count the number of…

For $0\le k\le n$, write $\binom nk=uv$ where the primes dividing $u$ are at most $k$ and the primes dividing $v$ exceed $k$, and let $f(n)$ be the least $k$ with $u>n^2$; Erd\H{o}s problem 684 asks for bounds on $f(n)$. We resolve the…

Let $k,p\in \mathbb{N}$ with $p$ prime and let $f\in\mathbb{Z}[x_1,x_2]$ be a bivariate polynomial with degree $d$ and all coefficients of absolute value at most $p^k$. Suppose also that $f$ is variable separated, i.e., $f=g_1+g_2$ for…

For positive rank $r$ elliptic curves $E(\mathbb{Q})$, we employ ideal class pairings $$ E(\mathbb{Q})\times E_{-D}(\mathbb{Q}) \rightarrow \mathrm{CL}(-D), $$ for quadratic twists $E_{-D}(\mathbb{Q})$ with a suitable ``small $y$-height''…

In the present article, we consider Algebraic Geometry codes on some rational surfaces. The estimate of the minimum distance is translated into a point counting problem on plane curves. This problem is solved by applying the upper bound…

Let $a,b>0$ be coprime integers. Assuming a conjecture on Hecke eigenvalues along binary cubic forms, we prove an asymptotic formula for the number of primes of the form $ax^2+by^3$ with $x \leq X^{1/2}$ and $y \leq X^{1/3}$. The proof…

We obtain lower bounds for Selmer ranks of elliptic curves over dihedral extensions of number fields. Suppose $K/k$ is a quadratic extension of number fields, $E$ is an elliptic curve defined over $k$, and $p$ is an odd prime. Let $F$…

Given an elliptic curve E over a number field k, the Galois action on the torsion points of E induces a Galois representation, \rho_E : Gal(\bar{k}/k) \to GL_2(\hat{Z}). For a fixed number field k, we describe the image of \rho_E for a…

We show that Durr-Hoyer's quantum algorithm of searching for extreme point of integer function can not be sped up for functions chosen randomly. Any other algorithm acting in substantially shorter time $o(\sqrt{2^n})$ gives incorrect answer…

For any positive integer $l$ we prove that if $M$ is a simple matroid with no $(l+2)$-point line as a minor and with sufficiently large rank, then $|E(M)|\le \frac{q^{r(M)}-1}{q-1}$, where $q$ is the largest prime power less than or equal…

Let E_k denote the elliptic curve defined by y^2 = x(x^2 - k^2). We consider the curves with k = pl, p = l = 1 mod 8 primes, and show that the density of rank-0 curves among them is at least 1/2 by explicitly constructing nontrivial…

Let $p \geq 5$ be a prime and for $a, b \in \mathbb{F}_{p}$, let $E_{a,b}$ denote the elliptic curve over $\mathbb{F}_{p}$ with equation $y^2=x^3+a\,x + b$. As usual define the trace of Frobenius $a_{p,\,a,\,b}$ by \begin{equation*}…

Sorting has a natural generalization where the input consists of: (1) a ground set $X$ of size $n$, (2) a partial oracle $O_P$ specifying some fixed partial order $P$ on $X$ and (3) a linear oracle $O_L$ specifying a linear order $L$ that…