The Absolute Orders on the Coxeter Groups A_n and B_n are Sperner
classification
🧮 math.CO
keywords
spernerorderabsolutestrongcoxetergroupgroupsorders
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.