Homology of the Boolean complex

DOI10.1007/S10801-011-0285-5zbMATH Open1242.05122arXiv1005.4411OpenAlexW1974774113MaRDI QIDQ644698FDOQ644698

Kári Ragnarsson, Bridget Eileen Tenner

Publication date: 7 November 2011

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Abstract: We construct and analyze an explicit basis for the homology of the boolean complex of a Coxeter system. This gives combinatorial meaning to the spheres in the wedge sum describing the homotopy type of the complex. We assign a set of derangements to any finite simple graph. For each derangement, we construct a corresponding element in the homology of the complex, and the collection of these elements forms a basis for the homology of the boolean complex. In this manner, the spheres in the wedge sum describing the homotopy type of the complex can be represented by a set of derangements. We give an explicit, closed-form description of the derangements that can be obtained from any graph, and compute this set for several families of graphs. In the cases of complete graphs and Ferrers graphs, these calculations give bijective proofs of previously obtained enumerative results.

Full work available at URL: https://arxiv.org/abs/1005.4411

Recommendations

• Homotopy type of the Boolean complex of a Coxeter system.
• On the topology of a Boolean representable simplicial complex
• Connectivity of \(h\)-complexes.
• Boolean complexes for Ferrers graphs
• Boolean formulae, hypergraphs and combinatorial topology

zbMATH Keywords

homologycomplete graphderangementCoxeter systemFerrers graphBoolean complexstaircase shape

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Combinatorial aspects of simplicial complexes (05E45) Reflection and Coxeter groups (group-theoretic aspects) (20F55)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On Lexicographically Shellable Posets
• Pattern avoidance and the Bruhat order.
• Posets, regular CW complexes and Bruhat order
• The excedance set of a permutation
• Homotopy type of the Boolean complex of a Coxeter system.
• Complexes of injective words and their commutation classes
• The combinatorics of the bar resolution in group cohomology
• Boolean complexes for Ferrers graphs
• Title not available (Why is that?)

Cited In (12)

• Enumerating in Coxeter Groups (Survey)
• Boolean algebra of two-dimensional continua with arbitrarily complex topology
• Connectivity of \(h\)-complexes.
• Prism permutations in the Bruhat order
• Boolean intersection ideals of permutations in the Bruhat order
• Star factorizations and noncrossing partitions
• A bijection for the Boolean numbers of Ferrers graphs
• The range of repetition in reduced decompositions
• Intersecting principal Bruhat ideals and grades of simple modules
• On modular homology in the Boolean algebra
• A poset fiber theorem for doubly Cohen-Macaulay posets and its applications.
• Title not available (Why is that?)

Uses Software

• OEIS

This page was built for publication: Homology of the Boolean complex

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q644698)