Related papers: Computing $A$-resultants via direct images
We prove an explicit uniform Chevalley theorem for direct summands of graded polynomial rings in mixed characteristic. Our strategy relies on the introduction of a new type of differential powers, which do not require the existence of a…
Effective computation of resultants is a central problem in elimination theory and polynomial system solving. Commonly, we compute the resultant as a quotient of determinants of matrices and we say that there exists a determinantal formula…
Let X be a smooth complex algebraic variety with the Zariski topology, and let Y be the underlying complex manifold with the complex topology. Grothendieck's algebraic de Rham theorem asserts that the singular cohomology of Y with complex…
In this paper we generalize the classical Groebner basis technique to prove the existence and present a method of computation of a dimension polynomial in two variables associated with a finitely generated D-module, that is, a finitely…
This paper concerns developing a numerical method of the Newton type to solve systems of nonlinear equations described by nonsmooth continuous functions. We propose and justify a new generalized Newton algorithm based on graphical…
In a recent paper \cite{ft} a new powerful method to calculate Feynman diagrams was proposed. It consists in setting up a Taylor series expansion in the external momenta squared. The Taylor coefficients are obtained from the original…
Let ${\cal L}$ be a variation of Hodge structures on the complement $X^{*}$ of a normal crossing divisor (NCD) $ Y$ in a smooth analytic variety $X$ and let $ j: X^{*} = X - Y \to X $ denotes the open embedding. The purpose of this paper is…
Suppose that $f: Y\to X$ is a proper, dominant, tamely ramified morphism of algebraic surfaces, over a perfect field. We show that it is possible to perform sequences of monoidal transforms $Y'\to Y$ and $X'\to X$ to obtain an induced…
This is the second in a pair of papers developing a framework to apply logarithmic methods in the study of singular curves of genus $1$. This volume focuses on logarithmic Gromov--Witten theory and tropical geometry. We construct a…
We present a general diagrammatic approach to the construction of efficient algorithms for computing a Fourier transform on a semisimple algebra. This extends previous work wherein we derive best estimates for the computation of a Fourier…
We present an enhanced algorithm for exploring mirror symmetry for elliptic curves through the correspondence of algebraic and tropical geometry, focusing on Gromov-Witten invariants of elliptic curves and, in particular, Hurwitz numbers.…
Weighted Gaussian Curvature is an important measurement for images. However, its conventional computation scheme has low performance, low accuracy and requires that the input image must be second order differentiable. To tackle these three…
Wave Kinetic Equations (WKEs) are often used to describe the evolution of ensemble averaged wave amplitudes for nonlinear wave systems. In the present manuscript we describe a new approach to direct numerical simulation of solutions to…
The purpose of this paper is to establish injectivity theorems for higher direct image sheaves of canonical bundles twisted by pseudo-effective line bundles and multiplier ideal sheaves. As applications, we generalize Koll'ar's torsion…
The BKMP conjecture (2006-2008), proposed a new method to compute closed and open Gromov-Witten invariants for every toric Calabi-Yau 3-folds, through a topological recursion based on mirror symmetry. So far, this conjecture had been…
Starting from the parametric representation of a Feynman diagram, we obtain it's well defined value in dimensional regularisation by changing the integrals over parameters into contour integrals. That way we eventually arrive at a…
We compute the cohomology of the complement of toric arrangements associated to root systems as representations of the corresponding Weyl groups. Specifically, we develop an algorithm for computing the cohomology of the complement of toric…
Algorithmicists are well-aware that fast dynamic programming algorithms are very often the correct choice when computing on compositional (or even recursive) graphs. Here we initiate the study of how to generalize this folklore intuition to…
We present a simple, accurate method for computing singular or nearly singular integrals on a smooth, closed surface, such as layer potentials for harmonic functions evaluated at points on or near the surface. The integral is computed with…
The Integral Image algorithm is often applied in tasks that require efficient integration over images, such as object detection. In this paper we discuss theoretical aspects of the algorithm's continuous version. We suggest to define the…