Given an integer $n$ the number of partitions of $n$ into two colors can be represented as $$p_2(n)=\sum_{k=0}^n p(k)p(n-k)$$ where $p(k)$ counts the number of ordinary partitions …

The Ramanujan conjecture states that the coefficients $\tau(n)$ in the identity $$q\prod_{m=1}^\infty(1-q^m)^{24}=\sum_{n=1}^\infty\tau(n)q^n$$ satisfy the inequality $|\tau(n)|\ …

A few years ago I first read about the marvelous Euler identity: $\sum_{n\in\mathbb{N}}p(n)z^n=\prod_{k\geq1}\frac{1}{1-z^k}$, where $p(n)$ is the number of partitions of $n$ ($p …

I want to gather facts and questions related to 3D generalizations of permutations, RSK correspondence, contingency tables, etc. One reason I am interested in this is because it is …

You are given $n$ numbers between $-n$ and $n$, the sum of numbers is $0$. Divide the given sequence on disjoint subsequences in such a way that each subsequence has zero sum. Each …

Say, we have a semimagic square $X$, that is, an $n\times n$ square matrix with entries from natural numbers, such that each row and column of it sums up to the same natural number …

Let $G$ be a graph -- possibly infinite, but I will be glad to learn a positive result even in the finite case. Then the trivial partition (i.e., one cell coinciding with the whole …

Who was the first to develop the asymptotic formulae for the distinct parts version of $p(n)?$

How many of the partitions of a natural number $n$ are comprised only of its divisors? That is, if $$p(n)=\sum_{\sum_{1}^n kj_k=n:j_k\geq 0} 1_{[j_1,j_2,...]},$$ is the ordinary pa …

For a set $X$, let $|X|$ denote its cardinality. A block of a partition is a non-empty element of the partition. Let $P$ and $Q$ be two partitions of a set $X$. If $|P| < …

Fix an arithmetic progression $R=(a, a+m, a+2m, \ldots)$, and assume that $gcd(a,m)=1$. Define $q_R(n)$ as the following coefficients: $$\prod_{i=0}^\infty (1+ t^{a+mi}) = \sum_{n …

If we write a partition $n=k_1+...+k_r$, then we can create a $(k_1,...,k_r)$-cycle in $S_n$ with order equal to the least common multiple of the $k_i$'s. It is clear that every cy …

Is there any known formula for the number of compositions of an integer k (partitions with considering the order of the parts) of length m (exactly m parts) where the parts do not …

Let $(a_n)$, $n\in\mathbb{N}$, be a sequence of complex numbers, then formally one has (1) $$\prod_{1}^{\infty}\left(1-a_nx^n\right)^{-1}=1+\sum_{1}^{\infty}\left(\sum_{j_1+2j_2+ …

I know Major Macmahon conjectured the formula $$ \prod_{m=1}^\infty \frac{1}{(1-q^m)^m}=1 + \sum_{n=1}^\infty PL(n)q^n$$ but who was the first to prove it?