相关论文: On Popoviciu type tormulas for generalized restric…

For two sets $A$ and $M$ of positive integers and for a positive integer $n$, let $p(n,A,M)$ denote the number of partitions of $n$ with parts in $A$ and multiplicities in $M$, that is, the number of representations of $n$ in the form…

We derive a combinatorial multisum expression for the number $D(n,k)$ of partitions of $n$ with Durfee square of order $k$. An immediate corollary is therefore a combinatorial formula for $p(n)$, the number of partitions of $n$. We then…

The restricted partition function $p_{N}(n)$ counts the partitions of $n$ into at most $N$ parts. In the nineteenth century Sylvester showed that these partitions can be expressed as a sum of $k$-periodic quasi-polynomials ($1\leq k\leq N$)…

We show how Andrews' generating functions for generalized Frobenius partitions can be understood within the theory of Eichler and Zagier as specific coefficients of certain Jacobi forms. This reformulation leads to a recursive process which…

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 present an elementary proof of a general version of Montel's theorem in several variables which is based on the use of tensor product polynomial interpolation. We also prove a Montel-Popoviciu's type theorem for functions…

Let $r\geq 1$ be an integer, $\mathbf a=(a_1,\ldots,a_r)$ a vector of positive integers and let $D\geq 1$ be a common multiple of $a_1,\ldots,a_r$. We study two natural determinants of order $rD$ with Bernoulli polynomials and we present…

A new recursive procedure for calculation of restricted partition function is suggested. An explicit formula for the restricted partition function is found based on this procedure.

In this note we will give various exact formulas for functions on integer partitions including the functions $p(n)$ and $p(n,k)$ of the number of partitions of $n$ and the number of such partitions into exactly $k$ parts respectively. For…

Let A and M be nonempty sets of positive integers. A partition of the positive integer n with parts in A and multiplicities in M is a representation of n in the form n = \sum_{a\in A} m_a a, where m_a is in M U {0} for all a in A, and m_a…

We derive the asymptotic formula for $p_n(N,M)$, the number of partitions of integer $n$ with part size at most $N$ and length at most $M$. We consider both $N$ and $M$ are comparable to $\sqrt{n}$. This is an extension of the classical…

We show that the partition function on a generalised conifold $C_{m,n}$ with ${m+n \choose m}$ crepant resolutions can be equivalently computed on the compound du Val singularity $A_{m+n-1}\times \mathbb C$ with a unique crepant resolution.

We introduce the notion of arithmetic progression blocks or AP-blocks of $\mathbb{Z}_n$, which can be represented as sequences of the form $(x, x+m, x+2m, ..., x+(i-1)m) \pmod n$. Then we consider the problem of partitioning $\mathbb{Z}_n$…

We study certain arithmetic properties of an analogue $B(n)$ of Lin's restricted partition function that counts the number of partition triples $\pi=(\pi_1,\pi_2,\pi_3)$ of $n$ such that $\pi_1$ and $\pi_2$ comprise distinct odd parts and…

The main result of the paper is the Fibonacci-like property of the partition function. The partition function $p(n)$ has a property: $p(n) \leq p(n-1) + p(n-2)$. Our result shows that if we impose certain restrictions on the partition, then…

For a polynomial f: {-1, 1}^n --> C, we define the partition function as the average of e^{lambda f(x)} over all points x in {-1, 1}^n, where lambda in C is a parameter. We present a quasi-polynomial algorithm, which, given such f, lambda…

We define an $f$-restricted partition $p_f(n,k)$ of fixed length $k$ given by the bivariate generating series \begin{align*} Q_f(z,u) \coloneqq 1+\sum_{n=1}^{\infty}\sum_{k=1}^{\infty} p_f(n,k) u^kz^n…

Recently, Amdeberhan, Sellers, and Singh introduced the notion of a generalized cubic partition function $a_c(n)$ and proved two isolated congruences via modular forms, namely, $a_3(7n+4)\equiv 0\pmod{7}$ and $a_5(11n+10)\equiv 0\pmod{11}$.…

In this paper we revisit the work of E.T. Bell concerning partition polynomials in order to introduce the reciprocal partition polynomials. We give their explicit formulas and apply the result to compute closed formulae for some well-known…

In a recent paper (Tran et al., Ann.Phys.311(2004)204), some asymptotic number theoretical results on the partitioning of an integer were derived exploiting its connection to the quantum density of states of a many-particle system. We…