167,168 research outputs found
The cyclic coloring complex of a complete k-uniform hypergraph
In this paper, we study the homology of the cyclic coloring complex of three
different types of -uniform hypergraphs. For the case of a complete
-uniform hypergraph, we show that the dimension of the
homology group is given by a binomial coefficient. Further, we discuss a
complex whose -faces consist of all ordered set partitions where none of the contain a hyperedge of the complete
-uniform hypergraph and where . It is shown that the
dimensions of the homology groups of this complex are given by binomial
coefficients. As a consequence, this result gives the dimensions of the
multilinear parts of the cyclic homology groups of \C[x_1,...,x_n]/
\{x_{i_1}...x_{i_k} \mid i_{1}...i_{k} is a hyperedge of . For the other
two types of hypergraphs, star hypergraphs and diagonal hypergraphs, we show
that the dimensions of the homology groups of their cyclic coloring complexes
are given by binomial coefficients as well
- β¦