Record Details

Boolean packings in Dowling geometries

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Boolean packings in Dowling geometries
 
Creator SRINIVASAN, MK
 
Subject combinatorial geometry
partition lattice
radon transforms
matchings
 
Description A Boolean packing of a finite graded poset P is a partitioning of P into disjoint Boolean algebras subject to the conditions that the difference between the ranks, in P, of the top and bottom elements of each Boolean algebra is equal to the rank of the Boolean algebra and that the sum of the ranks, in P, of the top and bottom elements of each Boolean algebra is greater than or equal to the rank of P. Bjorner [1, Exercise 7.36(b)] asked whether every geometric lattice has a Boolean packing. In this paper we give explicit Boolean packings for the class of Dowling lattices. As a consequence we obtain an identity expanding the rank numbers of Dowling lattices in terms of the binomial coefficients.
 
Publisher ACADEMIC PRESS LTD
 
Date 2011-07-12T20:31:02Z
2011-12-26T13:02:45Z
2011-12-27T05:49:35Z
2011-07-12T20:31:02Z
2011-12-26T13:02:45Z
2011-12-27T05:49:35Z
1998
 
Type Article
 
Identifier EUROPEAN JOURNAL OF COMBINATORICS, 19(6), 727-731
0195-6698
http://dx.doi.org/10.1006/eujc.1998.0230
http://dspace.library.iitb.ac.in/xmlui/handle/10054/3522
http://hdl.handle.net/10054/3522
 
Language en