Is the Symmetric Group Sperner?

arXiv1901.00197MaRDI QIDQ6311897FDOQ6311897

Authors: L. H. Harper, Gene B. Kim 

Publication date: 1 January 2019

Abstract: An antichain $mathcalA$ in a poset $mathcalP$ is a subset of $mathcalP$ in which no two elements are comparable. Sperner showed that the maximal antichain in the Boolean lattice, $mathcal{B}_n=left{0<1ight}^n$, is the largest rank (of size $$). This type of problem has been since generalized, and a graded poset $mathcalP$ is said to be Sperner if the largest rank of $mathcalP$ is its maximal antichain. In this paper, we will show that the symmetric group $S_n$, partially ordered by refinement (or equivalently by absolute order), is Sperner.

Mathematics Subject Classification ID

Algebraic combinatorics (05E99) Extremal set theory (05D05)

This page was built for publication: Is the Symmetric Group Sperner?

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