Mathematics – Combinatorics
Scientific paper
2008-08-17
Mathematics
Combinatorics
final version, to appear in the The Australasian Journal of Combinatorics
Scientific paper
In this paper we provide an explicit formula for calculating the boolean number of a Ferrers graph. By previous work of the last two authors, this determines the homotopy type of the boolean complex of the graph. Specializing to staircase shapes, we show that the boolean numbers of the associated Ferrers graphs are the Genocchi numbers of the second kind, and obtain a relation between the Legendre-Stirling numbers and the Genocchi numbers of the second kind. In another application, we compute the boolean number of a complete bipartite graph, corresponding to a rectangular Ferrers shape, which is expressed in terms of the Stirling numbers of the second kind. Finally, we analyze the complexity of calculating the boolean number of a Ferrers graph using these results and show that it is a significant improvement over calculating by edge recursion.
Claesson Anders
Kitaev Sergey
Ragnarsson Kari
Tenner Bridget Eileen
No associations
LandOfFree
Boolean complexes for Ferrers graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Boolean complexes for Ferrers graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Boolean complexes for Ferrers graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-580954