arXiv Analytics

Sign in

arXiv:1901.00197 [math.CO]AbstractReferencesReviewsResources

Is the Symmetric Group Sperner?

Larry H. Harper, Gene B. Kim

Published 2019-01-01Version 1

An antichain A in a poset P is a subset of P in which no two elements are comparable. Sperner showed that the maximal antichain in the Boolean lattice, B_n, is the largest rank (of size n choose n/2). This type of problem has since been generalized, and a graded poset P is said to be Sperner if the largest rank of P 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.

Comments: 7 pages, 7 figures
Categories: math.CO
Subjects: 05A05, 05E99, 60F05
Related articles: Most relevant | Search more
arXiv:0706.1405 [math.CO] (Published 2007-06-11, updated 2008-01-07)
The absolute order on the symmetric group, constructible partially ordered sets and Cohen-Macaulay complexes
arXiv:1701.06750 [math.CO] (Published 2017-01-24)
On equivalence between maximal and maximum antichains over range-restricted vectors with integral coordinates and the number of such maximal antichains
arXiv:1506.03332 [math.CO] (Published 2015-06-10)
Absolute order in general linear groups