相关论文: Counting components of an integral lamination
We explore the combination of deterministic and Monte Carlo methods to facilitate efficient automatic numerical computation of multidimensional integrals with singular integrands. Two adaptive algorithms are presented that employ recursion…
Efficient methods are proposed, for computing integrals appeaing in electronic structure calculations. The methods consist of two parts: the first part is to represent the integrals as contour integrals and the second one is to evaluate the…
We describe a method to numerically compute multi-loop integrals, depending on one dimensionless parameter $x$ and the dimension $d$, in the whole kinematic range of $x$. The method is based on differential equations, which, however, do not…
Consider the Fulton-MacPherson configuration space of $n$ points on $\P^1$, which is isomorphic to a certain moduli space of stable maps to $\P^1$. We compute the cone of effective ${\mathfrak S}_n$-invariant divisors on this space. This…
We describe an efficient algorithm to compute finite type invariants of type $k$ by first creating, for a given knot $K$ with $n$ crossings, a look-up table for all subdiagrams of $K$ of size $\lceil \frac{k}{2}\rceil$ indexed by dyadic…
A new approach to compute Feynman Integrals is presented. It relies on an integral representation of a given Feynman Integral in terms of simpler ones. Using this approach, we present, for the first time, results for a certain family of…
We present fast algorithms for the summation of Dyson series and the inchworm Monte Carlo method for quantum systems that are coupled with harmonic baths. The algorithms are based on evolving the integro-differential equations where the…
We present an algorithm that computes the composition factors of the n-th tensor power of the free associative algebra on a vector space. The composition factors admit a description in terms of certain coefficients $c_{\lambda\mu}$…
The correct computation of orbits of discrete dynamical systems on the interval is considered. Therefore, an arbitrary-precision floating-point approach based on automatic error analysis is chosen and a general algorithm is presented. The…
In this paper, we describe a numerical approach to evaluate Feynman loop integrals. In this approach the key technique is a combination of a numerical integration method and a numerical extrapolation method. Since the computation is carried…
Based on the Baikov representation, we present a systematic approach to compute cuts of Feynman Integrals, appropriately defined in $d$ dimensions. The information provided by these computations may be used to determine the class of…
The calculation of exclusive observables beyond the one-loop level requires elaborate techniques for the computation of multi-leg two-loop integrals. We discuss how the large number of different integrals appearing in actual two-loop…
The numerical analysis of gradient inclusions in a compact subset of $2\times 2$ diagonal matrices is studied. Assuming that the boundary conditions are reached after a finite number of laminations and using piecewise linear finite…
In this note we will give various exact formulas for functions on integer partitions including the functions $p(n)$ and $p(n,k)$ of the number of partitions of $n$ and the number of such partitions into exactly $k$ parts respectively. For…
In this paper we propose and realize (the code is publicly available at https://github.com/Thrawn1985/2D-Partition-Function) an algorithm for exact calculation of partition function for planar graph models with binary spins. The complexity…
A purely numerical method, Direct ComputationMethod is applied to evaluate Feynman integrals. This method is based on the combination of an efficient numerical integration and an efficient extrapolation. In addition, high-precision…
Hyperplanes of the form x_j = x_i + c are called affinographic. For an affinographic hyperplane arrangement in R^n, such as the Shi arrangement, we study the function f(M) that counts integral points in [1,M]^n that do not lie in any…
We obtain an explicit formula for the number of Lam\'e equations (modulo scalar equivalence) with index $n$ and projective monodromy group of order $2N$, for given $n \in \Z$ and $N \in \N$. This is done by performing the combinatorics of…
It is known that point searching in basic semialgebraic sets and the search for globally minimal points in polynomial optimization tasks can be carried out using $(s\,d)^{O(n)}$ arithmetic operations, where $n$ and $s$ are the numbers of…
We generalize Dynnikov coordinate system previosly defined on the standard punctured disk to an orientable surface of genus-1 with n punctures and one boundary component.