Hopf algebra of building sets. (Q1953353)

Let \(X\) be a finite set. A building set on \(X\) is a collection \(B\) of subsets of \(X\) such that: 1. \(S,S'\in B\) and \(S\cap S'\neq\emptyset\), then \(S\cup S'\in B\). 2. For all \(x\in X\), \(\{x\}\in B\). For example, if \(X\) is the set of vertices of a simple graph \(X\), the collection \(B\) of subsets \(Y\) of \(X\) such that the subgraph \(Y\) is connected is a building set on \(X\): in this sense, simple graphs are building sets, and, conversely, if \(B\) is a building set on \(X\), then \(X\) can be given a structure of a hypergraph. A commutative, cocommutative combinatorial Hopf algebra on building sets is here defined. Several connections with graphs and chromatic symmetric functions are studied, and generalized Dehn-Sommerville relations are given. More precisely: 1. By \textit{M. Aguiar, N. Bergeron} and \textit{F. Sottile}, [Compos. Math. 142, No. 1, 1-30 (2006; Zbl 1092.05070)], we obtain a Hopf algebra morphism \(\Psi\) from building sets to quasi-symmetric functions. If we see building sets as hypergraphs, we recover in this way the chromatic symmetric function. 2. A family of Hopf algebra morphisms indexed by integers \(n\geq 2\) from graphs to building sets is defined. For \(n\geq 2\), the composition with \(\Psi\) gives the chromatic symmetric function of the graph; if \(n\geq 3\), this morphism may allow to distinguish nonisomorphic graphs with the same chromatic symmetric function. 3. The generalized Dehn-Sommerville relations are given for a certain family of building sets, called Eulerian building sets, which are geometrically characterized.