Record Details

Explicit semisymmetric chain decomposition of the partition lattice

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Explicit semisymmetric chain decomposition of the partition lattice
 
Creator DEODHAR, RS
SRINIVASAN, MK
 
Subject order-matchings
set partitions
symmetric chain decomposition
semisymmetric chain decomposition
 
Description 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.
 
Publisher ELSEVIER SCIENCE BV
 
Date 2011-07-25T01:37:08Z
2011-12-26T12:49:05Z
2011-12-27T05:34:46Z
2011-07-25T01:37:08Z
2011-12-26T12:49:05Z
2011-12-27T05:34:46Z
2000
 
Type Article
 
Identifier DISCRETE MATHEMATICS, 219(1-3), 259-264
0012-365X
http://dx.doi.org/10.1016/S0012-365X(00)00023-6
http://dspace.library.iitb.ac.in/xmlui/handle/10054/6595
http://hdl.handle.net/10054/6595
 
Language en