Related papers: Modifying partition functions: a way to solve the …
We propose an approach for approximating the partition function which is based on two steps: (1) computing the partition function of a simplified model which is obtained by deleting model edges, and (2) rectifying the result by applying an…
We perform the a posteriori error analysis of residual type of a transmission problem with sign changing coefficients. According to [6] if the contrast is large enough, the continuous problem can be transformed into a coercive one. We…
Integro-partial differential equations occur in many contexts in mathematical physics. Typical examples include time-dependent diffusion equations containing a parameter (e.g., the temperature) that depends on integrals of the unknown…
Given a sequence of $N$ positive real numbers $\{a_1,a_2,..., a_N \}$, the number partitioning problem consists of partitioning them into two sets such that the absolute value of the difference of the sums of $a_j$ over the two sets is…
Multiphysics problems involving two or more coupled physical phenomena are ubiquitous in science and engineering. This work develops a new partitioned exponential approach for the time integration of multiphysics problems. After a possible…
The infamous numerical sign problem poses a fundamental obstacle to particle-based stochastic Wigner simulations in high dimensional phase space. Although the existing particle annihilation via uniform mesh significantly alleviates the sign…
The solution of the continuous time filtering problem can be represented as a ratio of two expectations of certain functionals of the signal process that are parametrized by the observation path. We introduce a new time discretisation of…
Probabilistic graphical models have emerged as a powerful modeling tool for several real-world scenarios where one needs to reason under uncertainty. A graphical model's partition function is a central quantity of interest, and its…
Quantum Monte Carlo methods are sophisticated numerical techniques for simulating interacting quantum systems. In some cases, however, they suffer from the notorious "sign problem" and become too inefficient to be useful. A recent…
The study consists of two parts. Objective of the first part is modern language constructions responsible for algorithmically insolvability of parallelizing problem. Second part contains several ways to modify the constructions to make the…
We investigate two problems for a class C of regular word languages. The C-membership problem asks for an algorithm to decide whether an input language belongs to C. The C-separation problem asks for an algorithm that, given as input two…
We propose a new approach to solve the classical Monty Hall problem in its general form. The solution is based on basic tools of probability theory, by defining three elementary events which decompose the sample space into a partition. The…
This paper deals with the problem of classifying signals. The new method for building so called local classifiers and local features is presented. The method is a combination of the lifting scheme and the support vector machines. Its main…
A novel approach to an old symmetry problem is developed. A new proof is given for the following symmetry problem, studied earlier.
Linearization problem of ordinary differential equations by a new set of tangent transformations is considered in the paper. This set of transformations allows one to extend the set of transformations applied for the linearization problem.…
In lattice field theory, the interactions of elementary particles can be computed via high-dimensional integrals. Markov-chain Monte Carlo (MCMC) methods based on importance sampling are normally efficient to solve most of these integrals.…
We propose an integral transform, called metamorphism, which allow us to reduce the order of a differential equation. For example, the second order Helmholtz equation is transformed into a first order equation, which can be solved by the…
In this paper we describe a new integration method for the groups $U(N)$ and $SU(N)$, for which we verified numerically that it is polynomially exact for $N\le 3$. The method is applied to the example of 1-dimensional QCD with a chemical…
Partition functions for non-interacting particles are known to be symmetric functions. It is shown that powerful group-theoretical techniques can be used not only to derive these relationships, but also to significantly simplify calculation…
We introduce the partition function of edge-colored graph homomorphisms, of which the usual partition function of graph homomorphisms is a specialization, and present an efficient algorithm to approximate it in a certain domain. Corollaries…