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

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 An and Bn are strong Sperner.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…