Related papers: Computation of Jeffrey-Kirwan residue using Gr\"ob…
Based on Nielsen fixed point theory and Gr\"{o}bner-Shirshov basis, we obtain a simple method to compute geometric intersection numbers and self-intersection geometric numbers of loops on surfaces.
In this paper we consider systems of partial (multidimensional) linear difference equations. Specifically, such systems arise in scientific computing under discretization of linear partial differential equations and in computational high…
We prove an equality, predicted in the physical literature, between the Jeffrey-Kirwan residues of certain explicit meromorphic forms attached to a quiver without loops or oriented cycles and its Donaldson-Thomas type invariants. In the…
The computation of the entries of Jacobi operators associated with orthogonal polynomials has important applications in numerical analysis. From truncating the operator to form a Jacobi matrix, one can apply the Golub--Welsh algorithm to…
Grothendieck point residue is considered in the context of computational complex analysis. A new effective method is proposed for computing Grothendieck point residues mappings and residues. Basic ideas of our approach are the use of…
Building on recent advances in studying the co-homological properties of Feynman integrals, we apply intersection theory to the computation of Fourier integrals. We discuss applications pertinent to gravitational bremsstrahlung and deep…
Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible…
We describe an algorithm for computing certain characteristic numbers of surface scrolls using degenerations. As a corollary we obtain a method for computing the corresponding Gromov-Witten invariants of Grassmannians.
This paper is a detailed description of an algorithm based on a generalized Buchberger algorithm for constructing Groebner-type bases associated with polynomials of shift operators. The algorithm is used for calculating Feynman integrals…
We prove the famous Faber intersection number conjecture and other more general results by using a recursion formula of $n$-point functions for intersection numbers on moduli spaces of curves. We also present some vanishing properties of…
We present the Mathematica package MultivariateResidues, which allows for the efficient evaluation of multivariate residues based on methods from computational algebraic geometry. Multivariate residues appear in several contexts of…
Grothendieck local residue is considered in the context of symbolic computation. Based on the theory of holonomic D-modules, an effective method is proposed for computing Grothendieck local residues. The key is the notion of Noether…
We find explicit formulas for the Hilbert series of residual intersections of a scheme in terms of the Hilbert series of its conormal modules. In a previous paper we proved that such formulas should exist. We give applications to the…
Consider the space $R_{\Delta}$ of rational functions of several variables with poles on a fixed arrangement $\Delta$ of hyperplanes. We obtain a decomposition of $R_{\Delta}$ as a module over the ring of differential operators with…
Computing Gr\"obner bases is known to have a very high upper bound on computation time with respect to input length. Due to the connection between polyhedral geometry and Gr\"obner bases through the Gr\"obner fan, one can attempt an…
Using the generalized Schwinger-DeWitt technique, we calculate the divergent part of the one-loop effective action for gravity non-minimally coupled to a multiplet of scalar fields. All the calculations are consistently done in the Jordan…
We show herein that a pattern based on FGLM techniques can be used for computing Gr\"obner bases, or related structures, associated to linear codes. This Gr\"obner bases setting turns out to be strongly related to the combinatorics of the…
From the literature it is known that orthogonal polynomials as the Jacobi polynomials can be expressed by hypergeometric series. In this paper, the authors derive several contiguous relations for terminating multivariate hypergeometric…
Solving a polynomial system, or computing an associated Gr\"obner basis, has been a fundamental task in computational algebra. However, it is also known for its notorious doubly exponential time complexity in the number of variables in the…
In this study, we examine numerical approximations for 2nd-order linear-nonlinear differential equations with diverse boundary conditions, followed by the residual corrections of the first approximations. We first obtain numerical results…