2 problems

Let $n$ be a prime power and let $k$ be a positive integer. Let $\Lambda_n^k$ be the indexing set of partitions used in the paper, let $|\lambda|$ denote the size of $\lambda$, let…

Let $P$ and $Q$ be posets with $n$ elements whose Hasse diagrams are trees. Let $\overline{K}_{P}(\mathbf{x})$ denote the strict $P$-partition enumerator, and specialize…