# vector partition

I am interested in partitioning a vector with nonnegative integer entries into a sum of vectors with nonnegative integral entries. For example the partitions like (2,2) = (1,1)+(1,1) = (2,0)+(0,2) = (1,0)+(0,1)+(1,1) = ... .

I have the following questions:

1. Given a vector $\textbf{b} \ne \textbf{0}$ whether the number of such partitions is known in the literature?

2. What is the combinatorial significance of this number?

Kindly share your views on these questions and thanks for your valuable time.

Have a good day.

• I'm presuming you want your vectors to be nonzero. Here's the 1-dimensional case: oeis.org/A000041 – Billy Mar 1 '18 at 16:53
• @Billy I have edited the nonzero condition part. – GA316 Mar 1 '18 at 17:00
• For some references, see arxiv.org/pdf/math/0202253.pdf and its bibliography. – Richard Stanley Mar 2 '18 at 4:10
• @RichardStanley Dear sir, Thanks for the nice reference. – GA316 Mar 4 '18 at 8:03

For rather trivial reasons, $$1+\sum_{(k,l)\ne (0,0)}p(k,l)x^ky^l=\prod_{(p,q)\ne(0,0)}\frac{1}{1-x^py^q} .$$ Since these numbers include, as $p(n,0)$, the one-dimensional partition numbers, you cannot really find a "closed" formula.