Subcontests
(6)Poset on subsets of 2n element set
Let n be a nonnegative integer. Determine the number of ways that one can choose (n+1)2 sets Si,j⊆{1,2,…,2n}, for integers i,j with 0≤i,j≤n, such that:[*] for all 0≤i,j≤n, the set Si,j has i+j elements; and
[*] Si,j⊆Sk,l whenever 0≤i≤k≤n and 0≤j≤l≤n.
Proposed by Ricky Liu