相关论文: Volume computation for polytopes and partition fun…
We provide two algorithms for computing the volume of a convex polytope with half-space representation {x>=0; Ax <=b} for some (m,n) matrix A and some m-vector b. Both algorithms have a O(n^m) computational complexity which makes them…
The inversion of nabla Laplace transform, corresponding to a causal sequence, is considered. Two classical methods, i.e., residual calculation method and partial fraction method are developed to perform the inverse nabla Laplace transform.…
The efficient inversion of matrix polynomials is a critical challenge in computational mathematics. We design a procedure to determine the inverse of matrices polynomial of multidimensional Laplace matrices. The method is based on…
This paper introduces a novel method for the efficient and accurate computation of the volume of a domain whose boundary is given by an orientable hypersurface which is implicitly given as the iso-contour of a sufficiently smooth level-set…
Many combinatorial and topological invariants of a hyperplane arrangement can be computed in terms of its Tutte polynomial. Similarly, many invariants of a hypertoric arrangement can be computed in terms of its arithmetic Tutte polynomial.…
We describe the computation of polytope volumes by descent in the face lattice, its implementation in Normaliz, and the connection to reverse-lexicographic triangulations. The efficiency of the algorithm is demonstrated by several high…
Volume computation for $d$-polytopes $\mathcal{P}$ is fundamental in mathematics. There are known volume computation algorithms, mostly based on triangulation or signed-decomposition of $\mathcal{P}$. We consider $…
The canonical partition function of a system of rotators (classical X-Y spins) on a lattice, coupled by terms decaying as the inverse of their distance to the power alpha, is analytically computed. It is also shown how to compute a…
We present a rational version of the classical Landen transformation for elliptic integrals. This is employed to obtain explicit closed-form expressions for a large class of integrals of even rational functions and to develop an algorithm…
Our paper introduces a novel method for calculating the inverse $\mathcal{Z}$-transform of rational functions. Unlike some existing approaches that rely on partial fraction expansion and involve dividing by $z$, our method allows for the…
In this paper we revisit the work of E.T. Bell concerning partition polynomials in order to introduce the reciprocal partition polynomials. We give their explicit formulas and apply the result to compute closed formulae for some well-known…
In this paper we propose a novel efficient algorithm for calculating winding numbers, aiming at counting the number of roots of a given polynomial in a convex region on the complex plane. This algorithm can be used for counting and…
We describe a first attempt to calculate scalar 2-loop box-functions with arbitrary internal masses, applying a novel method proposed in hep-ph/9407234. Four of the eight integrals are accessible to integration by means of the residue…
We consider space-saving versions of several important operations on univariate polynomials, namely power series inversion and division, division with remainder, multi-point evaluation, and interpolation. Now-classical results show that…
We investigate the possibilities to calculate vector partition functions by means of iterated partial fraction decomposition, as suggested by Beck (2004). Particularly, for an important type of families of rational functions, we describe an…
The aim of this work is to introduce several different volume computation methods of the graph polytope associated with various type of finite simple graphs. Among them, we obtained the recursive volume formula (RVF) that is fundamental and…
We define and study the Tutte polynomial of a hyperplane arrangement. We introduce a method for computing it by solving an enumerative problem in a finite field. For specific arrangements, the computation of Tutte polynomials is then…
We review the Laporta algorithm for the reduction of scalar integrals to the master integrals and the differential equations technique for their evaluation. We discuss the use of the basis of harmonic polylogarithms for the analytical…
We give an algorithm to compute weighted Ehrhart functions of lattice polytopes for polynomial weights using Lagrange interpolation. We show how to compute generating functions of polynomials using those of unit cubes and Eulerian numbers,…
From a scalar field defined at the corner of a cube, an isosurface can be extracted using the Marching Cube algorithm. The isosurface separates the cell into two or more partial cells. A similar situation arises when an material interface…