Related papers: About the choice of a basis in Kedlaya's algorithm

Let $K$ be a quadratic field which is not an imaginary quadratic field of class number one. We describe an algorithm to compute the primes $p$ for which there exists an elliptic curve over $K$ admitting a $K$-rational $p$-isogeny. This…

In the 1960s, Dwork developed a p-adic cohomology theory of de Rham type for varieties over finite fields, based on a trace formula for the action of a Frobenius operator on certain spaces of p-adic analytic functions. One can consider a…

This paper presents algorithmic approaches to study superspecial hyperelliptic curves. The algorithms proposed in this paper are: an algorithm to enumerate superspecial hyperelliptic curves of genus $g$ over finite fields $\mathbb{F}_q$,…

We present an effective algorithm for computing the standard cohomology spaces of finitely generated Lie (super) algebras over a commutative field K of characteristic zero. In order to reach explicit representatives of some generators of…

Context. Many algorithms to solve Kepler's equations require the evaluation of trigonometric or root functions. Aims. We present an algorithm to compute the eccentric anomaly and even its cosine and sine terms without usage of other…

We describe several improvements to algorithms for the rigorous computation of the endomorphism ring of the Jacobian of a curve defined over a number field.

Let $\mathcal{C}$ be a plane curve given by an equation $f(x,y)=0$ with $f\in K[x][y]$ a monic squarefree polynomial. We study the problem of computing an integral basis of the algebraic function field $K(\mathcal{C})$ and give new…

We propose a numerical method for computing all eigenvalues (and the corresponding eigenvectors) of a nonlinear holomorphic eigenvalue problem that lie within a given contour in the complex plane. The method uses complex integrals of the…

Multipoint evaluation is the computational task of evaluating a polynomial given as a list of coefficients at a given set of inputs. And while \emph{nearly linear time} algorithms have been known for the univariate instance of multipoint…

Using a refinement of the differential method introduced by Oguiso and Yu, we provide effective conditions under which the automorphisms of a smooth degree $d$ hypersurface of $\mathbf{P}^{n+1}$ are given by generalized triangular matrices.…

For a given matrix subspace, how can we find a basis that consists of low-rank matrices? This is a generalization of the sparse vector problem. It turns out that when the subspace is spanned by rank-1 matrices, the matrices can be obtained…

We obtain algorithms for computing Tverberg partitions based on centerpoint approximations. This applies to a wide range of convexity spaces, from the classic Euclidean setting to geodetic convexity in graphs. In the Euclidean setting, we…

In this paper, we study the problem of sampling random supersingular elliptic curves with unknown endomorphism rings. This problem has recently gained considerable attention as many isogeny-based cryptographic protocols require such…

The purpose of this paper is to prove a basic $p$-adic comparison theorem for smooth rigid analytic and dagger varieties over the algebraic closure $C$ of a $p$-adic field: $p$-adic pro-\'etale cohomology, in a stable range, can be…

For some kernel matrices, low-rank approximations can be quickly obtained via analytic techniques. One important class of analytic methods that has received attention in recent years is based on the use of proxy points. Accuracy analysis…

In this note we consider certain elliptic curves defined over real quadratic fields isogenous to their Galois conjugate. We give a construction of algebraic points on these curves defined over almost totally real number fields. The main…

We study the problem of lifting curves from finite fields to number fields in a genus and gonality preserving way. More precisely, we sketch how this can be done efficiently for curves of gonality at most four, with an in-depth treatment of…

This paper addresses the problem of determining the symmetries of a plane or space curve defined by a rational parametrization. We provide effective methods to compute the involution and rotation symmetries for the planar case. As for space…

This article generalizes the geometric quadratic Chabauty method, initiated over $\mathbb{Q}$ by Edixhoven and Lido, to curves defined over arbitrary number fields. The main result is a conditional bound on the number of rational points on…

We describe an algorithm to compute the local component at p of the Coleman-Gross p-adic height pairing on divisors on hyperelliptic curves. As the height pairing is given in terms of a Coleman integral, we also provide new techniques to…