Related papers: Computing Congruences Between an Elliptic Curve wi…
We present some algorithms that provide useful topological information about curves in surfaces. One of the main algorithms computes the geometric intersection number of two properly embedded 1-manifolds $C_1$ and $C_2$ in a compact…
Let $e_1,e_2,e_3$ be nonzero integers satisfying $e_1+e_2+e_3=0$. Let $(a,b,c)$ be a primitive triple of odd integers satisfying $e_1a^2+e_2b^2+e_3c^2=0$. Denote by $E: y^2=x(x-e_1)(x+e_2)$ and $\mathcal E: y^2=x(x-e_1a^2)(x+e_2b^2)$.…
Assuming the Generalized Riemann Hypothesis, we design a deterministic algorithm that, given a prime p and positive integer m=o(sqrt(p)/(log p)^4), outputs an elliptic curve E over the finite field F_p for which the cardinality of E(F_p) is…
We estimate from below the number of lines meeting each of given 4 disjoint smooth closed curves in a given cyclic order in the real projective 3-space and in a given linear order in the Euclidean 3-space. Similarly, we estimate the number…
A positive integer $n$ is called a $\theta$-congruent number if there is a triangle with sides $a,b$ and $c$ for which the angle between $a$ and $b$ is equal to $\theta$ and its area is $n\sqrt{r^2 - s^2}$, where $0 < \theta < \pi$, $\cos…
There are many applications in which a bounding sphere containing the given triangle E3 is needed, e.g. fast collision detection, ray-triangle intersecting in raytracing etc. This is a typical geometrical problem in E3 and it has also…
In this paper we provide, first, a general symbolic algorithm for computing the symmetries of a given rational surface, based on the classical differential invariants of surfaces, i.e. Gauss curvature and mean curvature. In practice, the…
Let $E$ be an elliptic curve defined over a field $K$ (with $char(K)\neq 2$) given by a Weierstrass equation and let $P=(x,y)\in E(K)$ be a point. Then for each $n$ $\geq 1$ and some $\gamma \in K^{\ast }$ we can write the $x$- and…
We enumerate plane complex algebraic curves of a given degree with one singularity of any given topological type. Our approach is to compute the homology classes of the corresponding equisingular strata in the parameter spaces of plane…
The Thue-Siegel method is used to obtain an upper bound for the number of primitive integral solutions to a family of quartic Thue's inequalities. This will provide an upper bound for the number of integer points on a family of elliptic…
It is a classical result (apparently due to Tate) that all elliptic curves with a torsion point of order n ($4 \leq n \leq 10$, or n = 12) lie in a one-parameter family. However, this fact does not appear to have been used ever for…
We establish new bounds on the number of tangencies and orthogonal intersections determined by an arrangement of curves. First, given a set of $n$ algebraic plane curves, we show that there are $O(n^{3/2})$ points where two or more curves…
We present a, hopefully, elementary mathematical treatment of the computational aspects of congruent numbers, such that an amateur could understand the problem and perform their own calculations.
Let $\ell$ be an odd prime, and suppose $E$ is an elliptic curve defined over the rational numbers $\mathbb{Q}$. If $E$ has an $\ell$-torsion point, then there has been significant work done on characterizing the $\ell$-divisibility of the…
The complexity of the elliptic curve method of factorization (ECM) is proven under the celebrated conjecture of existence of smooth numbers in short intervals. In this work we tackle a different version of ECM which is actually much more…
Let X be a (possibly nodal) K-trivial threefold moving in a fixed ambient space P. Suppose X contains a continuous family of curves, all of whose members satisfy certain unobstructedness conditions in P. A formula is given for computing the…
Some geometry on non-singular cubic curves, mainly over finite fields, is surveyed. Such a curve has 9,3,1 or 0 points of inflexion, and cubic curves are classified accordingly. The group structure and the possible numbers of rational…
We give new positive and negative results (some conditional) on speeding up computational algebraic geometry over the reals: (1) A new and sharper upper bound on the number of connected components of a semialgebraic set. Our bound is novel…
An elliptic divisibility sequence is an integer recurrence sequence associated to an elliptic curve over the rationals together with a rational point on that curve. In this paper we present a higher-dimensional analogue over arbitrary base…
We show how to speed up the computation of isomorphisms of hyperelliptic curves by using covariants. We also obtain new theoretical and practical results concerning models of these curves over their field of moduli.