The absolute orders on the Coxeter groups A_n and B_n are Sperner

From MaRDI portal
(Redirected from Publication:783067)
The absolute orders on the Coxeter groups \(A n\) and \(B n\) 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.


Summary: There are several classes of ranked posets related to reflection groups which are known to have the Sperner property, including the Bruhat orders and the generalized noncrossing partition lattices (i.e., the maximal intervals in absolute orders). \textit{L. H. Harper} and \textit{G. Kim} [``Is the symmetric group Sperner?, Preprint, \url{arXiv:1901.00197}] proved that the absolute orders on the symmetric groups are (strongly) Sperner. In this paper, we give an alternate proof that extends to the signed symmetric groups and the dihedral groups. Our simple proof uses techniques inspired by Ford-Fulkerson's theory of networks and flows, and a product theorem.











This page was built for publication: The absolute orders on the Coxeter groups \(A_n\) and \(B_n\) are Sperner

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q783067)