Related papers: Pure Spinor Partition Function Using Pade Approxim…

We have done a study of the zero-dimensional $\lambda\phi^{4}$ model. Firstly, we exhibit the partition function as a simple exact expression in terms of the Macdonald's function for $Re(\lambda)>0$. Secondly, an analytic continuation of…

Generic approximation of entire functions by their Pad\'{e} approximants has been achieved in the past (\cite{3}). In the present article we obtain generic approximation of holomorphic functions on arbitrary open sets by sequences of their…

The tree-level amplitude of six massless open strings is computed using the pure spinor formalism. The OPE poles among integrated and unintegrated vertices can be efficiently organized according to the cohomology of pure spinor superspace.…

In the present paper we introduce the class of slice-polynomial functions: slice regular functions {defined over the quaternions, outside the real axis,} whose restriction to any complex half-plane is a polynomial. These functions naturally…

We study a general class of singular degenerate parabolic stochastic partial differential equations (SPDEs) which include, in particular, the stochastic porous medium equations and the stochastic fast diffusion equation. We propose a fully…

We study the computational complexity of approximately computing the partition function of a spin system. Techniques based on standard counting-to-sampling reductions yield $\tilde{O}(n^2)$-time algorithms, where $n$ is the size of the…

Users frequently seek to fabricate objects whose outer surfaces consist of regions with different surface attributes, such as color or material. Manufacturing such objects in a single piece is often challenging or even impossible. The…

Let $\Lambda$ be a uniformly discrete set and $S$ be a compact set in $R$. We prove that if there exists a bounded sequence of functions in Paley--Wiener space $PW_S$, which approximates $\delta-$functions on $\Lambda$ with $l^2-$error $d$,…

We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…

Spatial approximations have been traditionally used in spatial databases to accelerate the processing of complex geometric operations. However, approximations are typically only used in a first filtering step to determine a set of candidate…

One of the most important recent developments in the complexity of approximate counting is the classification of the complexity of approximating the partition functions of antiferromagnetic 2-spin systems on bounded-degree graphs. This…

In this lectures we outline the construction of pure spinor superstrings. We consider both the open and closed pure spinor superstrings in critical and noncritical dimensions and on flat and curved target spaces with RR flux. We exhibit the…

Particle-In-Cell codes are widely used for plasma physics simulations. It is often the case that particles within a computational cell need to be split to improve the statistics or, in the case of non-uniform meshes, to avoid the…

Some important applicative problems require the evaluation of functions $\Psi$ of large and sparse and/or \emph{localized} matrices $A$. Popular and interesting techniques for computing $\Psi(A)$ and $\Psi(A)\mathbf{v}$, where $\mathbf{v}$…

This paper proposes a Direct Rational Radial Basis Functions Partition of Unity (D-RRBF-PU) approach to compute derivatives of functions with steep gradients or discontinuities. The novelty of the method concerns how derivatives are…

Based on the characterization of the polyconvex envelope of isotropic functions by their signed singular value representations, we propose a simple algorithm for the numerical approximation of the polyconvex envelope. Instead of operating…

Multivariate piecewise polynomial functions (or splines) on polyhedral complexes have been extensively studied over the past decades and find applications in diverse areas of applied mathematics including numerical analysis, approximation…

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…

In this work, we present a precise and model--independent method to extract resonance pole parameters from phase-shift scattering data. These parameters are defined from the associated poles in the second Riemann sheet, unfolded by the…

In this paper, we present a novel approach to approximate the gain function of the feedback particle filter (FPF). The exact gain function is the solution of a Poisson equation involving a probability-weighted Laplacian. The numerical…