Related papers: Explicit arithmetic intersection theory and comput…
In this work we use arithmetic, geometric, and combinatorial techniques to compute the cohomology of Weil divisors of a special class of normal surfaces, the so-called rational ruled toric surfaces. These computations are used to study the…
We present subquadratic algorithms in the algebraic decision-tree model for several \textsc{3Sum}-hard geometric problems, all of which can be reduced to the following question: Given two sets $A$, $B$, each consisting of $n$ pairwise…
In their recent inspiring paper Mironov and Morozov claim a surprisingly simple expansion formula for the Kontsevich-Witten tau-function in terms of the Schur Q-functions. Here we provide a similar conjecture for the Br\'ezin-Gross-Witten…
We explicitly characterize when the Milnor number at the origin of a polynomial or power series (over an algebraically closed field k of arbitrary characteristic) is the minimum of all polynomials with the same Newton diagram, which…
We obtain algorithms for computing Tverberg partitions based on centerpoint approximations. This applies to a wide range of convexity spaces, from the classic Euclidean setting to geodetic convexity in graphs. In the Euclidean setting, we…
We find an algorithm to compute the quadratic Euler characteristic of a smooth projective complete intersection of hypersurfaces of the same degree. As an example, we compute the quadratic Euler characteristic of a smooth projective…
A Newton-Okounkov polytope of a complete flag variety can be turned into a convex geometric model for Schubert calculus. Namely, we can represent Schubert cycles by linear combinations of faces of the polytope so that the intersection…
We present an algorithm to evaluate the exact, tree-level matrix elements for multi-parton processes in QCD. We tested this technique, based on the recursive evaluation of the S-matrix, on processes such as gg -> n gluons and q qbar -> n…
Based on high precision computation of periods and lattice reduction techniques, we compute the Picard group of smooth surfaces. We also study the lattice reduction technique that is employed in order to quantify the possibility of…
Amoebas are projections of complex algebraic varieties in the algebraic torus under a Log-absolute value map, which have connections to various mathematical subjects. While amoebas of hypersurfaces have been intensively studied in recent…
In this paper we give an upper bound for the number of integral points on an elliptic curve E over F_q[T] in terms of its conductor N and q. We proceed by applying the lower bounds for the canonical height that are analogous to those given…
Many challenging Graver bases computations, like for multi-way tables in statistics, have a highly symmetric problem structure that is not exploited so far computationally. In this paper we present a Graver basis algorithm for sublattices…
In this paper, we compute the number of self-intersections of a plane projection of a generic complete intersection curve defined by polynomials with the given support. Moreover, we discuss the tropical counterpart of this problem.
After briefly recalling some computational aspects of blowing up and of representation of resolution data common to a wide range of desingularization algorithms (in the general case as well as in special cases like surfaces or binomial…
In previous work we computed the symplectic volume of the symplectic reduced space of the product of N adjoint orbits of a compact Lie group. In this paper we compute the intersection pairings of the same object.
In general, algorithms for computing the Selmer group of the Jacobian of a curve have relied on either homogeneous spaces or functions on the curve. We present a theoretical analysis of algorithms which use functions on the curve, and show…
Isotropic Quot schemes parameterize rank $r$ isotropic subsheaves of a vector bundle equipped with symplectic or symmetric quadratic form. We define a virtual fundamental class for isotropic Quot schemes over smooth projective curves. Using…
The geometric intersection number of a curve on a surface is the minimal number of self-intersections of any homotopic curve, i.e. of any curve obtained by continuous deformation. Given a curve $c$ represented by a closed walk of length at…
In 2013, Clader, Jacobs, and Sprouse developed a quantum computing algorithm that solves electromagnetic scattering problems exponentially faster than the best known classical algorithm for that problem. We examine this quantum algorithm's…
This is a review article on the Gauss-Manin system associated to the complete intersection singularities of projection. We show how the logarithmic vector fields appear as coefficients to the Gauss-Manin system. We examine further how the…