Related papers: Computation of Jeffrey-Kirwan residue using Gr\"ob…
There are two approaches to computing the one-point functions for sine-Gordon model in infinite volume. One is a bootstrap type procedure based on the reflection relations. Another uses the fermionic basis which was originally found for the…
The Gilbert-Johnson-Keerthi (GJK) algorithm is an iterative improvement technique for finding the minimum distance between two convex objects. It can easily be extended to work with concave objects and return the pair of closest points. [4]…
This paper introduces QOperAv v1.5, a Java application available for free. (Source code included in the distribution.) QOperAv is a "code generator" for generating quantum circuits. The quantum circuits generated by QOperAv can be used to…
In this paper, we study residues of differential 2-forms on a smooth algebraic surface over an arbitrary field and give several statements about sums of residues. Afterwards, using these results we construct algebraic-geometric codes which…
Let G be the space of generating functions of a periodic infinite order linear recurrence. In this paper we provide an explicit procedure for computing a basis of G.
We present a numerical scheme that can be combined with any fixed boundary finite element based Poisson or Grad-Shafranov solver to compute the first and second partial derivatives of the solution to these equations with the same order of…
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 give a new residual intersection decomposition for the refined intersection products of Fulton-MacPherson. Our formula refines the celebrated residual intersection formula of Fulton, Kleiman, Laksov, and MacPherson. The new decomposition…
In this article we present ways to evaluate certain sums, products and continued fractions using tools from the theory of elliptic functions. The specific results appear to be new, although similar ones can be found in the leterature; in…
Two correspondences have been provided that associate any linear code over a finite field with a binomial ideal. In this paper, algorithms for computing their Graver bases and universal Gr\"obner bases are given. To this end, a connection…
In this paper we study the computational feasibility of an algorithm to prove orbifold equivalence between potentials describing Landau-Ginzburg models. Through a comparison with leading results of Groebner basis computations in cryptology,…
The present paper is about Bernstein-type estimates for Jacobi polynomials and their applications to various branches in mathematics. This is an old topic but we want to add a new wrinkle by establishing some intriguing connections with…
There are several efficient methods to solve linear interval polynomial systems in the context of interval computations, however, the general case of interval polynomial systems is not yet covered as well. In this paper we introduce a new…
Gr{\"o}bner bases is one the most powerful tools in algorithmic non-linear algebra. Their computation is an intrinsically hard problem with a complexity at least single exponential in the number of variables. However, in most of the cases,…
We compute exactly the overlap between the eigenvectors of two large empirical covariance matrices computed over intersecting time intervals, generalizing the results obtained previously for non-intersecting intervals. Our method relies on…
Multidimensional continued fractions generalize classical continued fractions with the aim of providing periodic representations of algebraic irrationalities by means of integer sequences. However, there does not exist any algorithm that…
We compute the $\mathbb{G}W$-spectrum (Karoubi--Grothendieck--Witt spectrum) of Grassmannians over divisorial schemes defined over fields of characteristic zero, and, as a corollary, determine their stabilized $\mathbb{L}$-theory spectrum.…
In this paper we describe an efficient involutive algorithm for constructing Groebner bases of polynomial ideals. The algorithm is based on the concept of involutive monomial division which restricts the conventional division in a certain…
We suggest a mathematical definition of the notion of master integrals and present a brief review of algorithmic methods to solve reduction problems for Feynman integrals based on integration by parts relations. In particular, we discuss a…
Imanishi, Jinzenji and Kuwata provided a recipe for computing Euler number of Grassmann manifold $G(k,N)$ using physical model and its path-integral [S.Imanishi, M.Jinzenji and K.Kuwata, Journal of Geometry and Physics, Volume 180, October…