Related papers: Explicit arithmetic intersection theory and comput…

In a previous work of the authors, a result to algorithmically compute the topology types of the level curves of an algebraic surface, is given. From this result, here we derive applications based on level curves to determine some…

We introduce an operation that measures the self intersections of paths on a surface. As applications, we give a criterion of the realizability of a generalized Dehn twist, and derive a geometric constraint on the image of the Johnson…

Combining $2$-descent techniques with Riemann-Roch and B\'ezout's theorems, we give an upper bound on the number of rational points of bounded height on elliptic and hyperelliptic curves over function fields of characteristic $\neq 2$. We…

Given two curves in $\PP^3$, either implicitly or by a parameterization, we want to check if they intersect. For that purpose, we present and further develop generalized resultant techniques. Our aim is to provide a closed formula in the…

We show how for every integer n one can explicitly construct n distinct plane quartics and one hyperelliptic curve over the complex numbers all of whose Jacobians are isomorphic to one another as abelian varieties without polarization. When…

I illustrate a general formalism based upon the subtraction method for the calculation of next-to-leading order QCD cross sections for any number of jets in any type of hard collisions. I discuss the implementation of this formalism in a…

We propose a new formulation for integrating over smooth curves and surfaces that are described by their closest point mappings. Our method is designed for curves and surfaces that are not defined by any explicit parameterization and is…

We study the Jacobian scheme of a plane algebraic curve at an ordinary singularity, characterizing it through a geometric property. We compute the Tjurina number for a family of curves at an ordinary singularity showing that it reaches the…

We give a new definition of higher arithmetic Chow groups for smooth projective varieties defined over a number field, which is similar to Gillet and Soul\'e's definition of arithmetic Chow groups. We also give a compact description of the…

We give two algorithms to compute linear determinantal representations of smooth plane curves of any degree over any field. As particular examples, we explicitly give representatives of all equivalence classes of linear determinantal…

Given a reduced analytic space $Y$ we introduce a class of {\it nice} cycles, including all effective $\mathbb{Q}$-Cartier divisors. Equidimensional nice cycles that intersect properly allow for a natural intersection product. Using…

We give an explicitly computable lower bound for the arithmetic self-intersection number of the dualizing sheaf on a large class of arithmetic surfaces. If some technical conditions are satisfied, then this lower bound is positive. In…

Following the method of Seifert surfaces in knot theory, we define arithmetic linking numbers and height pairings of ideals using arithmetic duality theorems, and compute them in terms of n-th power residue symbols. This formalism leads to…

We give algorithms for computing with divisors on projective curves over finite fields, and with their Jacobians, using the algorithmic representation of projective curves developed by Khuri-Makdisi. We show that many desirable operations…

Line intersection with convex and un-convex polygons or polyhedron algorithms are well known as line clipping algorithms and very often used in computer graphics. Rendering of geometrical problems often leads to ray tracing techniques, when…

Computing the diameter of the intersection graphs of objects is a basic problem in computational geometry. Previous works showed that the complexity of computing the diameter mainly depends on the object types: for unit disks and squares in…

We present a topological recursion formula for calculating the intersection numbers defined on the moduli space of open Riemann surfaces. The spectral curve is $x = \frac{1}{2}y^2$, the same as spectral curve used to calculate intersection…

The problem deals with an exact calculation of the intersection area of a circle arbitrary placed on a grid of square shaped elements with gaps between them (finite fill factor). Usually an approximation is used for the calculation of the…

In a previous joint article with F. Abu Salem, we gave efficient algorithms for Jacobian group arithmetic of "typical" divisor classes on C_{3,4} curves, improving on similar results by other authors. At that time, we could only state that…

In this paper we prove an explicit formula for the arithmetic intersection number (CM(K).G1)_{\ell} on the Siegel moduli space of abelian surfaces, generalizing the work of Bruinier-Yang and Yang. These intersection numbers allow one to…