Skip to Main content Skip to Navigation
Conference papers

Boolean complexes and boolean numbers

Abstract : The Bruhat order gives a poset structure to any Coxeter group. The ideal of elements in this poset having boolean principal order ideals forms a simplicial poset. This simplicial poset defines the boolean complex for the group. In a Coxeter system of rank n, we show that the boolean complex is homotopy equivalent to a wedge of (n-1)-dimensional spheres. The number of these spheres is the boolean number, which can be computed inductively from the unlabeled Coxeter system, thus defining a graph invariant. For certain families of graphs, the boolean numbers have intriguing combinatorial properties. This work involves joint efforts with Claesson, Kitaev, and Ragnarsson. \par
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Monday, August 24, 2015 - 3:45:50 PM
Last modification on : Thursday, July 4, 2019 - 2:10:03 PM
Long-term archiving on: : Wednesday, November 25, 2015 - 5:04:32 PM


Publisher files allowed on an open archive




Bridget Eileen Tenner. Boolean complexes and boolean numbers. 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010), 2010, San Francisco, United States. pp.1049-1056, ⟨10.46298/dmtcs.2833⟩. ⟨hal-01186261⟩



Record views


Files downloads