Related papers: Exact formula for 1-lower run overpartitions
In this work we obtain recurrent formulae for the number of permutations with either increasing or monotonic (i.e., both increasing and decreasing) runs of bounded length. Our formulae allow one to efficiently compute the number of such…
In 1918, Hardy and Ramanujan made a breakthrough by developing the circle method to deduce an asymptotic formula for the partition function $p(n)$, which was later refined by Rademacher in 1937 to produce an absolutely convergent series…
This paper gives the additivity and reduction formulas for mixed multiplicities of multi-graded modules $M$ and mixed multiplicities of arbitrary ideals, and establishes the recursion formulas for the sum of all the mixed multiplicities of…
In this paper, we will first give the numerical simulation of the sub-fractional Brownian motion through the relation of fractional Brownian motion instead of its representation of random walk. In order to verify the rationality of this…
Approximating Subset Sum is a classic and fundamental problem in computer science and mathematical optimization. The state-of-the-art approximation scheme for Subset Sum computes a $(1-\varepsilon)$-approximation in time…
We present an algorithm for computing the integral closure of a reduced ring that is finitely generated over a finite field.
We introduce a new type of cubature formula for the evaluation of an integral over the disk with respect to a weight function. The method is based on an analysis of the Fourier series of the weight function and a reduction of the bivariate…
We briefly review numerical methods for calculations beyond one loop and then describe new developments within the method of sector decomposition in more detail. We also discuss applications to two-loop integrals involving several mass…
This paper develops an algorithmic approach for obtaining estimates of the weight enumerators of Reed-Muller (RM) codes. Our algorithm is based on a technique for estimating the partition functions of spin systems, which in turn employs a…
We take a fresh look at the classical problem of runs in a sequence of i.i.d.\ coin tosses and derive a general identity/recursion which can be used to compute (joint) distributions of functionals of run types. This generalizes and unifies…
A Rademacher-type convergent series formula which generalizes the Hardy-Ramanujan-Rademacher formula for the number of partitions of $n$ and the Zuckerman formula for the Fourier coefficients of $\vartheta_4(0\vert \tau)^{-1}$ is presented.
In this article we give an algorithm for computing the integral closure of a reduced Noetherian ring R, in case this integral closure is finitely generated over R.
Unitarity cut method has been proved to be very useful in the computation of one-loop integrals. In this paper, we generalize the method to the situation where the powers of propagators in the denominator are larger than one in general. We…
We give an upper bound that relates the minimum weight of a nonzero componentwise product of codewords from some given number of linear codes, with the dimensions of these codes. Its shape is a direct generalization of the classical…
Let $N(n,r,k)$ denote the number of binary words of length $n$ that begin with $0$ and contain exactly $k$ runs (i.e., maximal subwords of identical consecutive symbols) of length $r$. We show that the generating function for the sequence…
Using groups with triality we obtain some general multiplication formulas in Moufang loops, construct Moufang extensions of abelian groups, and describe the structure of minimal extensions for finite simple Moufang loops over abelian…
We give a substantial improvement for the error term in the asymptotic formula for the smallest parts function $\mathrm{spt}(n)$ of Andrews. Our methods depend on an explicit bound for sums of Kloosterman sums of half integral weight on the…
We use the Circle Method to derive asymptotic formulas for functions related to the number of parts of partitions in particular residue classes.
Taking partial traces for computing reduced density matrices, or related functions, is a ubiquitous procedure in the quantum mechanics of composite systems. In this article, we present a thorough description of this function and analyze the…
In this paper we propose and realize (the code is publicly available at https://github.com/Thrawn1985/2D-Partition-Function) an algorithm for exact calculation of partition function for planar graph models with binary spins. The complexity…