Symmetric Chain Decompositions and the Strong Sperner Property for Noncrossing Partition Lattices

We prove that the noncrossing partition lattices associated with the complex reflection groups G(d, d, n) for d, n ≥ 2 admit a decomposition into saturated chains that are symmetric about the middle ranks. A consequence of this result is that these lattices have the strong Sperner property, which as...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete mathematics and theoretical computer science Ročník DMTCS Proceedings, 28th...
Hlavný autor:	Mühle, Henri
Médium:	Journal Article Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	DMTCS 22.04.2020 Discrete Mathematics & Theoretical Computer Science
Predmet:	[math.math-co]mathematics [math]/combinatorics [math.co] Combinatorics Mathematics Combinatorics
ISSN:	1365-8050, 1462-7264, 1365-8050
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!