Symplectic analogs of the distributive lattices \(L(m,n)\) (Q1818211)

Given a (finite) poset \((P,\leq)\), let \(J(P)\) be the collection of order-ideals \(I\) \((y\in I\) and \(x\leq y\) implies \(x\in I)\) ordered by set inclusion and so generating a lattice whose properties are induced by the properties of the original poset. As the collection of posets is very rich, so is the collection of lattices of order-ideals of posets. Let \(P(a,b)\) be the product poset of chains \(\{1<\cdots<a\}=C_a\) and \(C_b\). For \(1\leq k\leq n\), let \(P_C^{KN}(k,2n-k)=P(k,2n-k)\) with the usual order relation ``enlarged'' by the transitive closure of that relation and \((r,c)\leq(s,d)\) if \(r>c\) and \((s,d)= (c,2n-2k+r)\), while \(L_C^{KN}(k,2n-k)=J(P_C^{KN}(k,2n-k))\). Also \(L_G^{DeC} (k,2n-k)= J(P^{DeC}(k,2n-k))\), where \(P_C^{DeC}(k,2n-k)\) differs from \(P_C^{KN} (k,2n-k)\) in that the extra relation is \((r,c)\leq(s,d)\) if \(r<c-n+k\) with \((s,d) =(c-n+k, r+n-k)\) and \(n-k+1\leq c\leq n\). Having carefully defined these (symplectic) analogs of the lattices \(L(m,n)\) of partitions whose shapes fit inside an \(m\times n\) box, ordered by refinement, the author is able to conclude that these lattices have desirable properties, i.e., they are rank-symmetric, rank-unimodal, strongly Sperner distributive lattices. He describes how both of these families can be used to explicitly realize the fundamental representations of the Lie algebras sl\((2,C)\), a realization which also permits him to utilize a known technique due to Proctor along with his technically skilled combinatorial derivation of the rank generation functions in the proof of his main assertions concerning their nature, so completing a conjecture of Andrews and Stanton in the \(KN\) case.