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

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…

We exploit transformations relating generalized $q$-series, infinite products, sums over integer partitions, and continued fractions, to find partition-theoretic formulas to compute the values of constants such as $\pi$, and to connect sums…

For a subset $\mathcal A\subset \mathbb N$, let $p_{\mathcal A}(n)$ denote the restricted partition function which counts partitions of $n$ with all parts lying in $\mathcal A$. In this paper, we use a variation of the Hardy-Littlewood…

We improve the estimates in the restriction problem in dimension $n \ge 4$. To do so, we establish a weak version of a $k$-linear restriction estimate for any $k$. The exponents in this weak $k$-linear estimate are sharp for all $k$ and…

An integral formula is developed which applies to an essentially arbitrary function. An application is made to the Riemann zeta function.

In this note, we obtain a formula which leads to a practical and efficient method to calculate the number of partitions of n into parts not divisible by m for given natural numbers n and m.

We give some new formulas about factorizations of $K$-$k$-Schur functions $g^{(k)}_{\lambda}$, analogous to the $k$-rectangle factorization formula $s^{(k)}_{R_t\cup\lambda}=s^{(k)}_{R_t}s^{(k)}_{\lambda}$ of $k$-Schur functions, where…

We propose a new approximate method for counting the number of the solutions for constraint satisfaction problem (CSP). The method derives from the partition function based on introducing the free energy and capturing the relationship of…

The partition function, $p_A(n)$, is defined to be the number of partitions of $n$ with parts in the set A, where $n$ is a positive integer and $A$ is a set of positive integers. It is well documented that: if A is a finite set with…

We prove an explicit formula to count the partitions of $n$ whose product of the summands is at most $n$. In the process, we also deduce a result to count the multiplicative partitions of $n$.

We offer some partition functions related to ternary quadratic forms, and note on their upper bounds and related properties. We offer these results as an application of a simple method related to conjugate Bailey pairs presented in a prior…

We present a natural extension of Andrews' multiple sums counting partitions with difference 2 at distance $k-1$, by deriving the generating function for $K$-restricted jagged partitions. A jagged partition is a collection of non-negative…

MacMahon showed that the generating function for partitions into at most $k$ parts can be decomposed into a partial fractions-type sum indexed by the partitions of $k$. In this present work, a generalization of MacMahon's result is given,…

Motivated by string theory connection, a covariant procedure for perturbative calculation of the partition function of the two-dimensional generalized $\sigma$-model is considered. The importance of a consistent regularization of the…

Recently, we have proposed a new diffusive representation for fractional derivatives and, based on this representation, suggested an algorithm for their numerical computation. From the construction of the algorithm, it is immediately…

The Riemann theta function is a complex-valued function of g complex variables. It appears in the construction of many (quasi-) periodic solutions of various equations of mathematical physics. In this paper, algorithms for its computation…

We say that a function is rare-case hard against a given class of algorithms (the adversary) if all algorithms in the class can compute the function only on an $o(1)$-fraction of instances of size $n$ for large enough $n$. Starting from any…

We study the complexity of estimating the partition function $\mathsf{Z}(\beta)=\sum_{x\in\chi} e^{-\beta H(x)}$ for a Gibbs distribution characterized by the Hamiltonian $H(x)$. We provide a simple and natural lower bound for quantum…

In this paper, we introduce the generating functions of partition sequences. Partition sequences have a one-to-one correspondence with partitions. Therefore, the generating function has no multiplicity and appears meaningless initially.…

We introduce an efficient algorithm, called partition of unity extension or PUX, to construct an extension of desired regularity of a function given on a complex multiply connected domain in $2D$. Function extension plays a fundamental role…