Maximum antichains in the product of chains (Q2266031)

Let P be the product \(k_ 1\times...\times k_ n\) which is a product of chains, where \(n\geq 1\) and \(k_ 1\geq...\geq k_ n\geq 2\). Theorem: The maximum ranks of P are its only maximum antichains if and only if either \(n=1\) or \(k_ 1-1\leq \sum^{n}_{i=2}(k_ i-1)\). This is a generalization of \textit{E. Sperner}'s Theorem [Math. Z. 27, 544-548 (1928; JFM 54.0090.06)]. The numbers and location of the maximum ranks of P are also determined.