加载中…
Over 50 years ago, Rota posted the following celebrated `Research Problem’: prove or disprove that the partial order of partitions on an -set (i.e., the refinement order) is Sperner. A counterexample was eventually discovered by Canfield in 1978. However, Harper and Kim recently proved that a closely related order — i.e., the refinement order on the symmetric group — is not only Sperner, but strong Sperner. Equivalently, the well-known absolute order on the symmetric group is strong Sperner. In this paper, we extend these results by giving a concise, elegant proof that the absolute orders on the Coxeter groups and are strong Sperner.

生成讲解博客的中文版本

生成AI智能校验的中文版本