Boolean complexes for Ferrers graphs

Tools

Claesson, Anders and Kitaev, Sergey and Ragnarsson, Kari and Tenner, Bridget Eileen (2010) Boolean complexes for Ferrers graphs. Australasian Journal of Combinatorics, 48. pp. 159-173. ISSN 1034-4942

Full text not available in this repository.Request a copy

Abstract

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.

ORCID iDs

Claesson, Anders ORCID logoORCID: https://orcid.org/0000-0001-5797-8673, Kitaev, Sergey ORCID logoORCID: https://orcid.org/0000-0003-3324-1647, Ragnarsson, Kari and Tenner, Bridget Eileen;
CORE (COnnecting REpositories)