相关论文: On Explicit Formula for Restricted Partition Funct…

We derive the recursive relations of the partition function for the eight-vertex model on an $N\times N$ square lattice with domain wall boundary condition. Solving the recursive relations, we obtain the explicit expression of the domain…

We consider running-time optimization for band-joins in a distributed system, e.g., the cloud. To balance load across worker machines, input has to be partitioned, which causes duplication. We explore how to resolve this tension between…

We review the (algebraic-)functional method devised by Galleas and further developed by Galleas and the author. We first explain the method using the simplest example: the computation of the partition function for the six-vertex model with…

A new concept is introduced for the adaptive finite element discretization of partial differential equations that have a sparsely representable solution. Motivated by recent work on compressed sensing, a recursive mesh refinement procedure…

Rook polynomials are a powerful tool in the theory of restricted permutations. It is known that the rook polynomial of any board can be computed recursively, using a cell decomposition technique of Riordan. In this paper, we give a new…

A number of recent papers have estimated ratios of the partition function $p(n-j)/p(n)$, which appears in many applications. Here, we prove an easy-to-use effective bound on these ratios. Using this, we then study second shifted difference…

We give an elementary proof for new strict upper and lower bounds for the correction term in Ramanujan's approximation for the factorial function

Functional integrals are central to modern theories ranging from quantum mechanics and statistical thermodynamics to biology, chemistry, and finance. In this work we present a new method for calculating functional integrals based on a…

We present an amelioration of current known algorithms for optimal spectral partitioning problems. The idea is to use the advantage of a representation using density functions while decreasing the computational time. This is done by…

We assume some standard choices for the branch cuts of a group of functions and consider the problem of then calculating the branch cuts of expressions involving those functions. Typical examples include the addition formulae for inverse…

The vector-matrix Riemann boundary value problem for the unit disk with piecewise constant matrix is constructively solved by a method of functional equations. By functional equations we mean iterative functional equations with shifts…

We propose a splitting algorithm for solving a system of composite monotone inclusions formulated in the form of the extended set of solutions in real Hilbert spaces. The resluting algorithm is a an extension of the algorithm in [4]. The…

We present LinApart, a routine designed for efficiently performing the univariate partial fraction decomposition of large symbolic expressions. Our method is based on an explicit closed formula for the decomposition of rational functions…

We set up a combinatorial framework for inclusion-exclusion on the partitions into distinct parts to obtain an alternative generating function of partitions into distinct and non-consecutive parts. In connection with Rogers-Ramanujan…

We prove a closed formula for the derivative, of any order, of a implicit function, in terms of some binomial building blocks, and explain the combinatorics behind the coefficients appearing in the formula.

The high-performance scalable parallel algorithm for rigorous calculation of partition function of lattice systems with finite number Ising spins was developed. The parallel calculations run by C++ code with using of Message Passing…

Provided a special function of one variable and some of its derivatives can be accurately computed over a finite range, a method is presented to build a series of polynomial approximations of the function with a defined relative error over…

We describe an approximate rational arithmetic with round-off errors (both absolute and relative) controlled by the user. The rounding procedure is based on the continued fraction expansion of real numbers. Results of computer experiments…

Algorithms for partition refinement are actively studied for a variety of systems, often with the optimisation called Hopcroft's trick. However, the low-level description of those algorithms in the literature often obscures the essence of…

This study reexamines diffusive representations for fractional integrals with the goal of pioneering new variants of such representations. These variants aim to offer highly efficient numerical algorithms for the approximate computation of…