Related papers: Computing the intersection of two quadrics through…
These notes are intended as an easy-to-read supplement to part of the background material presented in my talks on enumerative geometry. In particular, the numbers $n_3$ and $n_4$ of plane rational cubics through eight points and of plane…
Given a projective intersection of two quadrics X in at least 9 variables, the quantitative behaviour of the rational points on X is investigated under the assumption that X contains a pair of conjugate singular points defined over the…
In this paper, we revisit the classical problem of determining osculating conics and sextactic points for a given algebraic curve. Our focus is on a particular family of plane cubic curves known as the Hesse pencil. By employing classical…
In this paper we present new results about arrangements of lines and osculating curves associated to the Fermat curves in the projective plane. We first consider the sextactic points on the Fermat curves and show that they are distributed…
Convex hulls are fundamental objects in computational geometry. In moderate dimensions or for large numbers of vertices, computing the convex hull can be impractical due to the computational complexity of convex hull algorithms. In this…
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 propose an algorithm based on Newton's method and subdivision for finding all zeros of a polynomial system in a bounded region of the plane. This algorithm can be used to find the intersections between a line and a surface, which has…
We study the arithmetic of complete intersections in projective space over number fields. Our main results include arithmetic Torelli theorems and versions of the Shafarevich conjecture, as proved for curves and abelian varieties by…
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…
Constructions and exploration of plane algebraic curves has received a new push with the development of automated methods, whose algorithms are continuously improved and implemented in various software packages. We use them to explore the…
We develop an essentially algebraic method to study biharmonic curves into an implicit surface. Although our method is rather general, it is especially suitable to study curves into surfaces defined by a polynomial equation: in particular,…
Optimization over the intersection of two manifolds arises in a broad range of applications, but is hindered by the coupled geometry of the feasible region. In this paper, we prove that the regularities -- clean intersection and intrinsic…
We address the problem of computing bounds for the self-intersection number (the minimum number of self-intersection points) of members of a free homotopy class of curves in the doubly-punctured plane as a function of their combinatorial…
Computed tomography is a method for synthesizing volumetric or cross-sectional images of an object from a collection of projections. Popular reconstruction methods for computed tomography are based on idealized models and assumptions that…
The average value of the number of intersection points of two plane curves given by trigonometrical polynomial maps of degree $N$ and bounded $L_2$- or $W_2^r$- norms is calculated
Let P be a point inside a convex quadrilateral ABCD. The lines from P to the vertices of the quadrilateral divide the quadrilateral into four triangles. If we locate a triangle center in each of these triangles, the four triangle centers…
A method for detecting and approximating fault lines or surfaces, respectively, or decision curves in two and three dimensions with guaranteed accuracy is presented. Reformulated as a classification problem, our method starts from a set of…
Using linear projections one gets new inequalities for the successive minima of the lattice of sections of an hermitian line bundle on an arithmetic surface.
There exist efficient algorithms to project a point onto the intersection of a convex cone and an affine subspace. Those conic projections are in turn the work-horse of a range of algorithms in conic optimization, having a variety of…
We study intersections of projective convex sets in the sense of Steinitz. In a projective space, an intersection of a nonempty family of convex sets splits into multiple connected components each of which is a convex set. Hence, such an…