The Absolute Orders on the Coxeter Groups $A_n$ and $B_n$ are Sperner

Lawrence H. Harper; Gene B. Kim; Neal Livesay

paper

The Absolute Orders on the Coxeter Groups $A_{n}$ and $B_{n}$ are Sperner

arXiv:1902.08334

Abstract

Over 50 years ago, Rota posted the following celebrated `Research Problem': prove or disprove that the partial order of partitions on an $n$ -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 $A_{n}$ and $B_{n}$ are strong Sperner.

6 pages, 2 tikz figures

The Absolute Orders on the Coxeter Groups An​ and Bn​ are Sperner

Abstract

The Absolute Orders on the Coxeter Groups $A_{n}$ and $B_{n}$ are Sperner