Related papers: Explicit arithmetic intersection theory and comput…
We translate the results of Yansong Xu into the language of~\cite{GGV1}, obtaining nearly the same formulas for the intersection number of Jacobian pairs, but with an inequality instead of an equality.
We present a new general algorithm for calculating arbitrary jet cross sections in arbitrary scattering processes to next-to-leading accuracy in perturbative QCD. The algorithm is based on the subtraction method. The key ingredients are new…
We compute the production cross section of a top-antitop pair in association with a jet at hadron colliders at next-to-leading order accuracy matched with parton shower algorithms to make predictions at the hadron level. The parton shower…
We prove upper bounds for the number of rational points on non-singular cubic curves defined over the rationals. The bounds are uniform in the curve and involve the rank of the corresponding Jacobian. The method used in the proof is a…
This paper will appear in the Santa Cruz proceedings. An overview of the braid group techniques in the theory of algebraic surfaces, from Zariski to the latest results, is presented. An outline of the Van Kampen algorithm for computing…
We show a direct calculation of Jacobian matrices in the old problems of rational curves on generic hypersurfaces.
Intersection numbers of twisted cocycles arise in mathematics in the field of algebraic geometry. Quite recently, they appeared in physics: Intersection numbers of twisted cocycles define a scalar product on the vector space of Feynman…
We describe an algorithm for computing the Picard-Fuchs equation for a family of twists of a fixed elliptic surface. We then apply this algorithm to obtain the equation for several examples, which are coming from families of Kummer surfaces…
We construct a new quantum algorithm for the graph collision problem; that is, the problem of deciding whether the set of marked vertices contains a pair of adjacent vertices in a known graph G. The query complexity of our algorithm is…
In this paper we present the algorithms for calculating the differential geometric properties {t,n,b1,b2,b3,k1,k2,k3,k4} along-with geodesic curvature and geodesic torsion of the transversal intersection curve of four hypersurfaces (given…
The Chabauty--Coleman--Kim method in depth two describes the rational points on a curve in terms of a generalisation of Nekov\'a\v{r}'s $p$-adic height pairing which replaces $\mathbb{G}_m$ with a higher Chow group. It is unclear both what…
This article gives an introduction for mathematicians interested in numerical computations in algebraic geometry and number theory to some recent progress in algorithmic number theory, emphasising the key role of approximate computations…
We present a series of new results we obtained recently about the intersection numbers of tautological classes on moduli spaces of curves, including a simple formula of the n-point functions for Witten's $\tau$ classes, an effective…
Let S be a smooth projective surface, and consider the following two subvarieties of the Hilbert scheme parameterizing closed subschemes of S of length n: A = {subschemes with support in a fixed point of S} B = {subschemes with support in…
The problem of finding a point in the intersection of closed sets can be solved by the method of alternating projections and its variants. It was shown in earlier papers that for convex sets, the strategy of using quadratic programming (QP)…
Let $\mathcal C$ be a real plane algebraic curve defined by the resultant of two polynomials (resp. by the discriminant of a polynomial). Geometrically such a curve is the projection of the intersection of the surfaces $P(x,y,z)=Q(x,y,z)=0$…
We give necessary and sufficient criteria for a smooth Enriques surface S in P^r to be scheme-theoretically an intersection of quadrics. Moreover we prove in many cases that, when S contains plane cubic curves, the intersection of the…
For affine algebraic plane curves we reduce a calculation of its invariants to calculation of the intersection of kernels of some derivations.
We compute equations for real multiplication on the divisor classes of genus two curves via algebraic correspondences. We do so by implementing van Wamelen's method for computing equations for endomorphisms of Jacobians on examples drawn…
Let $\mathcal{Q}_1$ and $\mathcal{Q}_2$ be two arbitrary quadrics with no common hyperplane in ${\mathbb{P}}^n(\mathbb{F}_q)$. We give the best upper bound for the number of points in the intersection of these two quadrics. Our result…