相关论文: Complex Multiplication Tests for Elliptic Curves

For an elliptic curve $E$ defined over the field $\mathbb{C}$ of complex numbers, we classify all translates of elliptic curves in $E^3$ such that the $x$-coordinates satisfy a linear equation. This classification enables us to establish a…

For any elliptic curve E defined over the rationals with complex multiplication and for every prime p, we describe the image of the mod p Galois representation attached to E. We deduce information about the field of definition of torsion…

Division polynomials associated to an elliptic curve $E/K$ are polynomials $\phi_n, \psi_n^2$ that arise from the sequence of points $\{nP\}_{n \in \mathbb{N}}$ on this curve. If one wishes to study $\mathbb{Z}$--linear combination of…

We introduce the notion of isolated genus two curves. As there is no known efficient algorithm to explicitly construct isogenies between two genus two curves with large conductor gap, the discrete log problem (DLP) cannot be efficiently…

The orbit problem is at the heart of symmetry reduction methods for model checking concurrent systems. It asks whether two given configurations in a concurrent system (represented as finite strings over some finite alphabet) are in the same…

We represent vector bundles over a regular algebraic curve as pairs of lattices over the maximal orders of its function field and we give polynomial time algorithms for several tasks: computing determinants of vector bundles, kernels and…

We consider the problem of bounding the dimension of the linear system of curves in ${\bf P}^2$ of degree $d$ with prescribed multiplicities $m_1,...,m_n$ at $n$ general points (\cite{Hir1},\cite{Hir2}). We propose a new method, based on…

Let $K$ be an imaginary quadratic field, and let $\mathcal{O}_{K,f}$ be an order in $K$ of conductor $f\geq 1$. Let $E$ be an elliptic curve with CM by $\mathcal{O}_{K,f}$, such that $E$ is defined by a model over $\mathbb{Q}(j_{K,f})$,…

We outline a general algorithm for computing an explicit model over a number field of any curve of genus 2 whose (unpolarized) Jacobian is isomorphic to the product of two elliptic curves with CM by the same order in an imaginary quadratic…

We present a quantum probabilistic algorithm which tests with a polynomial computational complexity whether a given composite number is of the Carmichael type. We also suggest a quantum algorithm which could verify a conjecture by…

Given two closed curves in a surface, we propose an algorithm to detect whether they are of the same type or not.

Let $K$ be a number field. For which primes $p$ does there exist an elliptic curve $E / K$ admitting a $K$-rational $p$-isogeny? Although we have an answer to this question over the rationals, extending this to other number fields is a…

We describe a polynomial-time algorithm to compute a (tight) geodesic between two curves in the curve graph. As well as enabling us to compute the distance between a pair of curves, this has several applications to mapping classes. For…

We present computational algorithms to work with points on the modular curve associated to the normaliser of a non-split Cartan group of prime level $p$. Rather than working with explicit equations, we represent these points using the…

It is well known that the most challenging question in optimization and discrete geometry is whether there is a strongly polynomial time simplex algorithm for linear programs (LPs). This paper gives a positive answer to this question by…

Assuming GRH, we present an algorithm which inputs a prime $p$ and outputs the set of fundamental discriminants $D<0$ such that the reduction map modulo a prime above $p$ from elliptic curves with CM by $\order_{D}$ to supersingular…

This version is similar to math.CO/0210113. We've changed Conjectures 1.1 and 1.2 so that they cover arbitrary graphs(digraphs). Let G be an arbitrary graph(digraph). Then - in polynomial time - either an algorithm obtains a hamilton…

To determine the global root number of an elliptic curve defined over a number field, one needs to understand all the local root numbers. These have been classified except at places above 2, and in this paper we attempt to complete the…

Suppose $P$ is a symmetric convex polygon in the plane. We give a polynomial time algorithm that decides if $P$ can tile the plane by transations at some level (not necessarily at level one; this is multiple tiling). The main technical…

We show that the problem of deciding whether the vertex set of a graph can be covered with at most two bicliques is in NP$\cap$coNP. We thus almost determine the computational complexity of a problem whose status has remained open for quite…