相关论文: Pure Spinor Partition Function Using Pade Approxim…

We study the approximability of computing the partition functions of two-state spin systems. The problem is parameterized by a $2\times 2$ symmetric matrix. Previous results on this problem were restricted either to the case where the…

This paper makes three contributions to estimating the number of perfect matching in bipartite graphs. First, we prove that the popular sequential importance sampling algorithm works in polynomial time for dense bipartite graphs. More…

Tame functions are a class of nonsmooth, nonconvex functions, which feature in a wide range of applications: functions encountered in the training of deep neural networks with all common activations, value functions of mixed-integer…

We demonstrate the high accuracy of the density splitting method to compute the gravitational potential and field in the plane of razor-thin, axially symmetric discs, as preliminarily outlined in Pierens & Hure (2004). Because residual…

For a wide class of polynomially nonlinear systems of partial differential equations we suggest an algorithmic approach to the s(trong)-consistency analysis of their finite difference approximations on Cartesian grids. First we apply the…

Motivated by the relationship between orthogonal complex structures and spure spinors, we define twisted partially pure spinors in order to characterize spinorially subspaces of Euclidean space endowed with a complex structure.

In this paper we provide a rigorous mathematical foundation for continuous approximations of a class of systems with piece-wise continuous functions. By using techniques from the theory of differential inclusions, the underlying piece-wise…

We present fully polynomial approximation schemes for a broad class of Holant problems with complex edge weights, which we call Holant polynomials. We transform these problems into partition functions of abstract combinatorial structures…

In this paper we discuss approximation of partially smooth functions. The problem arises naturally in the study of laminated currents.

Probabilistic graphical models are a key tool in machine learning applications. Computing the partition function, i.e., normalizing constant, is a fundamental task of statistical inference but it is generally computationally intractable,…

We study the problem of learning to partition users into groups, where one must learn the compatibilities between the users to achieve optimal groupings. We define four natural objectives that optimize for average and worst case…

In this paper, we focus on approximating a natural class of functions that are compositions of smooth functions. Unlike the low-dimensional support assumption on the covariate, we demonstrate that composition functions have an intrinsic…

A numerical analysis for the fully discrete approximation of an operator Lyapunov equation related to linear SPDEs (stochastic partial differential equations) driven by multiplicative noise is considered. The discretization of the Lyapunov…

Pad'e approximants are used to improve the convergence behavior of perturbative results in massless scalar and gauge field theories at finite temperature.

Using the new variational approach proposed recently for a systematic improvement of the locally harmonic Feynman-Kleinert approximation to path integrals we calculate the partition function of the anharmonic oscillator for all temperatures…

We present an algorithm to compute best least-squares approximations of discrete real-valued functions by first-degree splines (broken lines) with free knots. We demonstrate that the algorithm delivers after a finite number of steps a…

This thesis discusses how the pure spinor formalism can be used to efficiently compute superstring scattering amplitudes. We emphasize the pure spinor superspace form of the kinematic factors, where the simplifying features of this language…

An extension of the method and results of A. Schwarz for evaluating the partition function of a quadratic functional is presented. This enables the partition functions to be evaluated for a wide class of quadratic functionals of interest in…

Smeared link fermionic actions can be straightforwardly simulated with partial-global updating. The efficiency of this simulation is greatly increased if the fermionic matrix is written as a product of several near-identical terms. Such a…

The aim of this paper is to extend the approximate quasi-interpolation on a uniform grid by dilated shifts of a smooth and rapidly decaying function on a uniform grid to scattered data quasi-interpolation. It is shown that high order…