Related papers: Formulas for Partition $k$-Tuples with $t$-Cores

We derive a formula for $p(n)$ (the number of partitions of $n$) in terms of the partial Bell polynomials using Fa\`{a} di Bruno's formula and Euler's pentagonal number theorem.

Let $n$ be a non-negative integer and $A=\{a_1,\ldots,a_k\}$ be a multi-set with $k$ not necessarily distinct members, where $a_1\leqslant\ldots\leqslant a_k$. We denote by $\Delta(n,A)$ the number of ways to partition $n$ as the form…

We derive new formulas for the number of unordered (distinct) factorizations with $k$ parts of a positive integer $n$ as sums over the partitions of $k$ and an auxiliary function, the number of partitions of the prime exponents of $n$,…

In this short note, we prove several new congruences for the overcubic partition triples function, using both elementary techniques and the theory of modular forms. These extend the recent list of such congruences given by Nayaka,…

Let $\alpha_k(\lambda)$ denote the number of $k$-hooks in a partition $\lambda$ and let $b(n,k)$ be the maximum value of $\alpha_k(\lambda)$ among partitions of $n$. Amdeberhan posed a conjecture on the generating function of $b(n,1)$. We…

Using elementary methods, we prove new formulas for $\operatorname{pp}(n)$, the number of plane partitions of $n$, $\operatorname{pp}_r(n)$, the number of plane partitions of $n$ with at most $r$ rows, $\operatorname{pp}^s(n)$, the number…

In this paper, we study the $n$-point function of $t$-core partitions. The main tool is the topological vertex, originally developed to study the topological string theory for toric Calabi--Yau 3-folds. By virtue of the topological vertex,…

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…

Let $p_{k,3}(n)$ enumerate the number of 2-color partition triples of $n$ where one of the colors appears only in parts that are multiples of $k$. In this paper, we prove several infinite families of congruences modulo powers of 3 for…

Let $b_{\ell, k}(n), b_{\ell, k, r}(n)$ count the number of $(\ell, k)$, $(\ell, k, r)$-regular partitions respectively. In this paper we shall derive infinite families of congruences for $b_{\ell, k}(n)$ modulo $2$ when $ (\ell, k) =…

Hooks are prominent in representation theory (of symmetric groups) and they play a role in number theory (via cranks associated to Ramanujan's congruences). A partition of a positive integer $n$ has a Young diagram representation. To each…

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 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$.

In this paper we prove that Amdeberhan's conjecture on the largest size of $(t, t+1, t+2)$-core partitions is true. We also show that the number of $(t, t + 1, t + 2)$-core partitions with the largest size is $1$ or $2$ based on the parity…

We study M(n,k,r), the number of orbits of {(a_1,...,a_k)\in Z_n^k | a_1+...+a_k = r (mod n)} under the action of S_k. Equivalently, M(n,k,r) sums the partition numbers of an arithmetic sequence: M(n,k,r) = sum_{t \geq 0} p(n-1,k,r+nt),…

An asymptotic formula for the number of partitions into p-cores is derived. As a byproduct some integer valued trigonometric sums are found

This paper shows that the number of hooks of length k contained in all partitions of n equals k times the number of parts of length k in all partitions of n. It contains also formulas for the moments (under uniform distribution) of k-th…

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 prove three variations of recent results due to Andrews on congruences for $NT(m,k,n)$, the total number of parts in the partitions of $n$ with rank congruent to $m$ modulo $k$. We also conjecture new congruences and relations for…

We give Euler-like recursive formulas for the $t$-colored partition function when $t=2$ or $t=3,$ as well as for all $t$-regular partition functions. In particular, we derive an infinite family of ``triangular number" recurrences for the…