Related papers: About the choice of a basis in Kedlaya's algorithm
Building on the positive solution of Pillay's conjecture we present a notion of "intrinsic" reduction for elliptic curves over a real closed field K. We compare such notion with the traditional algebro-geometric reduction and produce a…
A Richelot isogeny between Jacobian varieties is an isogeny whose kernel is included in the $2$-torsion subgroup of the domain. A Richelot isogeny whose codomain is the product of two or more principally polarized abelian varieties is…
Let X be an irreducible smooth projective curve, of genus at least two, defined over an algebraically closed field of characteristic different from two. If X admits a nontrivial automorphism \sigma that fixes pointwise all the order two…
A computation method of algebraic local cohomology with parameters, associated with zero-dimensional ideal with parameter, is introduced. This computation method gives us in particular a decomposition of the parameter space depending on the…
Isogenies, the mappings of elliptic curves, have become a useful tool in cryptology. These mathematical objects have been proposed for use in computing pairings, constructing hash functions and random number generators, and analyzing the…
We give a classification of all non-symplectic automorphisms of prime order p acting on irreducible holomorphic symplectic fourfolds deformation equivalent to the Hilbert scheme of two points on a K3 surface, for p=2,3 and 7\leq p \leq 19.…
In this paper, we present an algorithm of simple exponential growth called COPOMATRIX for determining the copositivity of a real symmetric matrix. The core of this algorithm is a decomposition theorem, which is used to deal with simplicial…
The fastest known algorithm for factoring univariate polynomials over finite fields is the Kedlaya-Umans (fast modular composition) implementation of the Kaltofen-Shoup algorithm. It is randomized and takes $\widetilde{O}(n^{3/2}\log q + n…
Cubic spline interpolation on Euclidean space is a standard topic in numerical analysis, with countless applications in science and technology. In several emerging fields, for example computer vision and quantum control, there is a growing…
We give a characterization of the codomain $[\ell]E(k)$ of the multiplication-by-$\ell$ map $[\ell]$ in the case of elliptic curves over a field $k$ of characteristic $\ne 2,3$ with $\ell$-torsion $E[\ell]=\langle W_1,W_2 \rangle$ fully…
We study the cohomological properties of quasi-canonical lifts of an ordinary K3 surface over a finite field. As applications, we prove a Torelli type theorem for ordinary K3 surfaces over finite fields and establish the Hodge conjecture…
An effective exact method is proposed for computing generalized eigenspaces of a matrix of integers or rational numbers. Keys of our approach are the use of minimal annihilating polynomials and the concept of the Jourdan-Krylov basis. A new…
The study of parameter-dependent partial differential equations (parametric PDEs) with countably many parameters has been actively studied for the last few decades. In particular, it has been well known that a certain type of parametric…
We consider K3 surfaces of Picard rank 14 which admit a purely nonsymplectic automorphism of order 16. The automorphism acts on the second cohomology group with integer coefficients and we compute the invariant sublattice for the action. We…
The paper is an introduction to the use of the classical Newton-Puiseux procedure, oriented to an algorithmic description of it. This procedure enables to get polynomial approximations for parameterizations of branches of an algebraic plane…
Scheme-theoretic methods are used to classify ternary quadratic forms with values in line bundles over arbitrary schemes and to canonically determine the isomorphisms between them. The association of a quadratic bundle to its even Clifford…
We generalize Macdonald's formula for the cohomology of Hilbert schemes of points on a curve from smooth curves to curves with planar singularities: we relate the cohomology of the Hilbert schemes to the cohomology of the compactified…
Quadratic Chabauty is a $p$-adic method for determining rational points on curves. Local heights are arithmetic invariants used in the quadratic Chabauty method. We present an algorithm to compute these local heights for hyperelliptic…
In general, algorithms for computing the Selmer group of the Jacobian of a curve have relied on either homogeneous spaces or functions on the curve. We present a theoretical analysis of algorithms which use functions on the curve, and show…
The circular coordinates algorithm, a key tool in topological data analysis, relies on a theoretically unvalidated lifting step to convert cocycles from a prime field to integer coefficients. We provide a rigorous analysis of this…