Homology of the Boolean complex

DOI10.1007/S10801-011-0285-5MaRDI QIDQ644698zbMATH OpenOpenAlexFDO

Authors Kári Ragnarsson, Bridget Eileen Tenner

Publication date 7 November 2011

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

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

zbMATH Keywords

Boolean complexcomplete graphCoxeter systemderangementFerrers graphhomologystaircase 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)

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.

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

Cites work

• Boolean complexes for Ferrers graphs
• Complexes of injective words and their commutation classes
• Homotopy type of the Boolean complex of a Coxeter system.
• scientific article; zbMATH DE number 3647758 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• scientific article; zbMATH DE number 2103273 (Why is no real title available?)
• On Lexicographically Shellable Posets
• Pattern avoidance and the Bruhat order.
• Posets, regular CW complexes and Bruhat order
• The combinatorics of the bar resolution in group cohomology
• The excedance set of a permutation

Cited in

(18)

• Connectivity of \(h\)-complexes.
• On modular homology in the Boolean algebra
• Star factorizations and noncrossing partitions
• A bijection for the Boolean numbers of Ferrers graphs
• The range of repetition in reduced decompositions
• A poset fiber theorem for doubly Cohen-Macaulay posets and its applications.
• On the topology of a Boolean representable simplicial complex
• Boolean complexes for Ferrers graphs
• Intersecting principal Bruhat ideals and grades of simple modules
• Boolean algebra of two-dimensional continua with arbitrarily complex topology
• Enumerating in Coxeter groups (survey)
• scientific article; zbMATH DE number 4196900 (Why is no real title available?)
• Boolean intersection ideals of permutations in the Bruhat order
• Prism permutations in the Bruhat order
• Runs and RSK tableaux of Boolean permutations
• Boolean formulae, hypergraphs and combinatorial topology
• Homotopy type of the Boolean complex of a Coxeter system.
• The discrete fundamental group of the order complex of B_n

Describes a project that uses

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)