The symmetric group, ordered by refinement of cycles, is strongly Sperner

DOI10.1090/proc/15183OpenAlexW3159130094MaRDI QIDQ4990332

Gene B. Kim, Lawrence H. Harper

Publication date: 28 May 2021

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/proc/15183

zbMATH Keywords

symmetric grouprefinementabsolute orderSpernerflow morphism

Mathematics Subject Classification ID

Partitions of sets (05A18) Combinatorics of partially ordered sets (06A07) Algebraic combinatorics (05E99) Extremal set theory (05D05) Symmetric groups (20B30)

Related Items (2)

On the Sperner property for the absolute order on complex reflection groups ⋮ The intermediate orders of a Coxeter group

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The absolute orders on the Coxeter groups \(A_n\) and \(B_n\) are Sperner
• The global theory of flows in networks
• The morphology of partially ordered sets
• On a problem of Rota
• The size of the largest antichain in the partition lattice
• Generalized noncrossing partitions and combinatorics of Coxeter groups
• Representations of $\mathfrak{sl}( 2,\mathbb{C} )$ on Posets and the Sperner Property
• Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
• Large antichains in the partition lattice
• A combinatorial 𝔰𝔩₂-action and the Sperner property for the weak order
• Stirling Behavior is Asymptotically Normal
• Some Results on Matching in Bipartite Graphs
• On a lemma of Littlewood and Offord

This page was built for publication: The symmetric group, ordered by refinement of cycles, is strongly Sperner