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

DOI10.37236/8874zbMATH Open1444.05150arXiv1902.08334OpenAlexW3046027510MaRDI QIDQ783067FDOQ783067

Authors: Lawrence H. Harper, Gene B. Kim, Neal Livesay 

Publication date: 30 July 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1902.08334

Recommendations

• The absolute order of a permutation representation of a Coxeter group
• The order of a finite Coxeter group
• scientific article; zbMATH DE number 3955215
• A result on the Bruhat order of a Coxeter group
• The absolute order on the symmetric group, constructible partially ordered sets and Cohen-Macaulay complexes
• Maximal order Abelian subgroups of Coxeter groups
• On the Sperner property for the absolute order on complex reflection groups
• The sorting order on a Coxeter group
• A splitting criterion for the bruhat orderings on coxeter groups
• Bases for the Bruhat-Chevalley order on all finite Coxeter groups

Mathematics Subject Classification ID

Reflection and Coxeter groups (group-theoretic aspects) (20F55) Extremal set theory (05D05) Ordered groups (06F15) Ordered groups (group-theoretic aspects) (20F60) Combinatorial aspects of groups and algebras (05E16)

Cites Work

• Product partial orders with the Sperner property
• Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
• Non-crossing partitions for classical reflection groups
• Generalized noncrossing partitions and combinatorics of Coxeter groups
• On the structure of the lattice of noncrossing partitions
• Symmetric decompositions and the strong Sperner property for noncrossing partition lattices
• The morphology of partially ordered sets
• Representations of $\mathfrak{sl}( 2,\mathbb{C} )$ on Posets and the Sperner Property
• The absolute order on the hyperoctahedral group
• The global theory of flows in networks
• On a problem of Rota
• On the Sperner property for the absolute order on complex reflection groups
• The weak Bruhat order on the symmetric group is Sperner
• Morphisms for the strong Sperner property of Stanley and Griggs

Cited In (5)

• On the Sperner property for the absolute order on complex reflection groups
• Sperner properties for groups and relations
• The absolute order on the hyperoctahedral group
• The symmetric group, ordered by refinement of cycles, is strongly Sperner
• A combinatorial \(\mathfrak{sl}_2\)-action and the Sperner property for the weak order

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)