Explicit semisymmetric chain decomposition of the partition lattice

Autor:	Murali K. Srinivasan, Rajendra S. Deodhar
Rok vydání:	2000
Předmět:	Discrete mathematics Carry (arithmetic) Partition lattice Automorphism Set Partitions Order-Matchings Theoretical Computer Science Combinatorics Symmetric Chain Decomposition Semisymmetric Chain Decomposition Chain decomposition Order (group theory) Discrete Mathematics and Combinatorics Mathematics
Zdroj:	Discrete Mathematics. 219(1-3):259-264
ISSN:	0012-365X
DOI:	10.1016/s0012-365x(00)00023-6
Popis:	Loeb et al. (J. Combin. Theory Ser. A. 65 (1994) 151-157) gave an explicit semisymmetric chain decomposition of Pi(n). In this paper we give a second explicit semisymmetric chain decomposition and show that it is different from the one given in Loeb et al. (1995) in the sense that no order automorphism of Pi(n) can carry one to another. (C) 2000 . MSC: primary 05D05; secondary 06A07; 05A18; 05B35.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5064bd44253183e220aaf27a4c691dc2 Zobrazit plný text záznamu Full Text from ScienceDirect