相关论文: Efficient computation of p-adic heights

In this work we use elementary methods to discuss the question of the minimal number of points with bad reduction over the projective line for elliptic curves E/k(T) which are non-constant resp. have non-constant j-invariant.

We design algorithms for computing values of many p-adic elementary and special functions, including logarithms, exponentials, polylogarithms, and hypergeometric functions. All our algorithms feature a quasi-linear complexity with respect…

We consider the problem of computing the topology and describing the geometry of a parametric curve in $\mathbb{R}^n$. We present an algorithm, PTOPO, that constructs an abstract graph that is isotopic to the curve in the embedding space.…

Let $\pi : E\to B$ be an elliptic surface defined over a number field $K$, where $B$ is a smooth projective curve, and let $P: B \to E$ be a section defined over $K$ with canonical height $\hat{h}_E(P)\not=0$. In this article, we show that…

In this paper, we present efficient algorithms for computing the number of points and the order of the Jacobian group of a superelliptic curve over finite fields of prime order p. Our method employs the Hasse-Weil bounds in conjunction with…

Let $E/\mathbb{Q}$ be an elliptic curve of level $N$ and rank equal to $1$. Let $p$ be a prime of ordinary reduction. We experimentally study conjecture $4$ of B. Mazur and J. Tate in his article "Refined Conjectures of the Birch and…

In this paper, for every prime $p$ and every $0\le n\le \infty$, we classify the structure of the torsion subgroup of the group of $\mathbb{Q}_p(\mu_{p^n})$-rational points of elliptic curves over $\mathbb{Q}_p$ with good reduction, where…

In this paper, we present a deterministic algorithm to find a strong generic position for an algebraic space curve. We modify our existing algorithm for computing the topology of an algebraic space curve and analyze the bit complexity of…

We count the number of rational elliptic curves of bounded naive height that have a rational $N$-isogeny, for $N \in \{2,3,4,5,6,8,9,12,16,18\}$. For some $N$, this is done by generalizing a method of Harron and Snowden. For the remaining…

Let $\ell$ and $p \geq 3$ be different primes. Let $E/\mathbb{Q}_\ell$ and $E'/\mathbb{Q}_\ell$ be elliptic curves with isomorphic $p$-torsion. Assume that $E$ has potentially multiplicative reduction. We classify when all…

In general dimension, there is no known total polynomial algorithm for either convex hull or vertex enumeration, i.e. an algorithm whose complexity depends polynomially on the input and output sizes. It is thus important to identify…

We consider the set of points in projective $n$-space that generate an extension of degree $e$ over given number field $k$, and deduce an asymptotic formula for the number of such points of absolute height at most $X$, as $X$ tends to…

In this note we investigate the $p$-degree function of elliptic curves over the field $\mathbb{Q}_p$ of $p$-adic numbers. The $p$-degree measures the least complexity of a non-zero $p$-torsion point on an elliptic curve. We prove some…

We establish an explicit lower bound for the N\'eron-Tate height on elliptic curves with complex multiplication, for nontorsion points defined over the maximal abelian extension of a number field. Building on a strategy developed by…

Let $X$ be a curve of genus $g>1$ over $\mathbb{Q}$ whose Jacobian $J$ has Mordell--Weil rank $r$ and N\'eron--Severi rank $\rho$. When $r < g+ \rho - 1$, the geometric quadratic Chabauty method determines a finite set of $p$-adic points…

We present a fast algorithm that takes as input an elliptic curve defined over $\mathbb Q$ and an integer $d$ and returns all the number fields $K$ of degree $d'$ dividing $d$ such that $E(K)_{tors}$ contains $E(F)_{tors}$ as a proper…

Restricting ourselves to elliptic curves over $\mathbb{Q}$, we reformulate the $p$-adic Beilinson conjecture due to Perrin-Riou, which is customized to our computational approach. We then develop a new algorithm for numerical verifications…

Let $P$ be an arbitrary point on an elliptic curve over the complex numbers of the form $y^2=x^3+a_4\,x+a_6$ or of the form $y^2=x^3+a_2\,x^2+a_4\,x$. We provide explicit formulae to compute the points $P/2$, i.e., the points $Q$ such that…

We will describe an algorithm to construct an elliptic curve $E_{f_q}$ over some prime field $\mathbb{F}_p$ such that such that $|E_{f_q}(\mathbb{F}_p)| = f_q$, where $f_q$ is a probable Fibonacci prime for some prime index $q$. The…

In this paper we give an upper bound for the number of integral points on an elliptic curve E over F_q[T] in terms of its conductor N and q. We proceed by applying the lower bounds for the canonical height that are analogous to those given…