相关论文: Counting components of an integral lamination

We present an algorithm for calculating the geometric intersection number of two multicurves on the $n$-punctured disk, taking as input their Dynnikov coordinates. The algorithm has complexity $O(m^2n^4)$, where $m$ is the sum of the…

Two algorithms for computing $P(n,m)$, the number of integer partitions of $n$ into exactly $m$ parts, are described, and using a combination of these two algorithms, the resulting algorithm is $O(n^{3/2})$. The second algorithm uses a list…

The problem of finding independent components of an indexed object (e.g., a tensor) with arbitrary number of indices and arbitrary linear symmetries is discussed. It is proved that the number of independent components $f(k)$ is a polynomial…

In this note, we obtain a formula which leads to a practical and efficient method to calculate the number of partitions of n into parts not divisible by m for given natural numbers n and m.

We consider the question about the number of master integrals for a multiloop Feynman diagram. We show that, for a given set of denominators, this number is totally determined by the critical points of the polynomials entering either of the…

We give an algorithm to compute inhomogeneous differential equations for definite integrals with parameters. The algorithm is based on the integration algorithm for $D$-modules by Oaku. Main tool in the algorithm is the Gr\"obner basis…

Contour integrals of rational functions over ${\cal M}_{0,n}$, the moduli space of $n$-punctured spheres, have recently appeared at the core of the tree-level S-matrix of massless particles in arbitrary dimensions. The contour is determined…

In this paper we describe a method of calculation of master integrals based on the solution of systems of difference equations in one variable. Various explicit examples are given, as well as the generalization to arbitrary diagrams.

We describe triangle coordinates for integral laminations on a non-orientable surface $N_{k,n}$ of genus $k$ with $n$ punctures and one boundary component, and give an explicit bijection from the set of integral laminations on $N_{k,n}$ to…

This paper presents a quantum algorithm for efficiently computing partial sums and specific weighted partial sums of quantum state amplitudes. Computation of partial sums has important applications, including numerical integration,…

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…

For the calculation of multi-loop Feynman integrals, a novel numerical method, the Direct Computation Method (DCM) is developed. It is a combination of a numerical integration and a series extrapolation. In principle, DCM can handle…

We present a numerical method to evaluate partition functions and associated correlation functions of inhomogeneous 2--D classical spin systems and 1--D quantum spin systems. The method is scalable and has a controlled error. We illustrate…

We propose quantum algorithms, purely quantum in nature, for calculating the determinant and inverse of an $(N-1)\times (N-1)$ matrix (depth is $O(N^2\log N)$) which is a simple modification of the algorithm for calculating the determinant…

We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.

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 propose a method to efficiently compute the Minkowski sum, denoted by binary operator $\oplus$ in the paper, of convex polytopes in $\Re^d$ using their face lattice structures as input. In plane, the Minkowski sum of convex polygons can…

We present a formula for the degree of the discriminant of a smooth projective toric variety associated to a lattice polytope P, in terms of the number of integral points in the interior of dilates of faces of dimension greater or equal…

We present an efficient algorithm for calculating multiloop Feynman integrals perturbatively.

The Postnikov character formula is used to express large portions of a Dirichlet character sum in terms of quadratic exponential sums. The quadratic sums are then computed using an analytic algorithm previously derived by the author. This…