Unique path partitions: characterization and congruences (Q2441384)

Let \(\mu = (a_1, a_2, \dots, a_k)\), with \(a_1\geqslant a_2\geqslant\dots\geqslant a_k>0\), and \(\lambda\) be partitions of a positive integer \(n\). A \(\mu\)-path in \(\lambda\) is a sequence of partitions, \(\lambda= \lambda_0, \lambda_1, \dots, \lambda_k = (0)\), where \(\lambda_i\) is obtained by removing an \(a_i\)-hook from \(\lambda_{i-1}\). A partition \(\mu\) is called a up-partition (unique path partition) for \(\lambda\) if the number of \(\mu\)-paths in \(\lambda\) is at most 1. It is a up-partition if it is a up-partition for all partitions of \(n\). The number of up-partitions of a positive integer \(n\) is denoted by \(u(n)\). Suppose also that \(w(n)=\frac{u(2n)}{2}\). Giving a classification of up-partitions, the authors investigate arithmetical properties of \(u(n)\). As the ultimate goal, they obtain full information on the congruences modulo 8 for the sequence \(u(n)\) via the following two results on the sequence \(w(n)\) modulo 8 and 4, respectively. The first result states that \(w(2^k)\equiv k\pmod8\) if \(k\) is odd and is \(k+1\), otherwise. The second result says that if \(n=\sum_{i=0}^k 2^{n_i}\), with \(n_0<n_1<\dots<n_k\), is not a power of 2 then \(w(n)\equiv 0\pmod4\) whenever \(n_0\equiv 3\pmod4\) or \(n_0\equiv 0\pmod4\) and \(n_k\) is even or \(n_0\equiv 2\pmod4\) and \(n_k\) is odd, and \(w(n)\equiv 2\pmod4\), otherwise.