arXiv Analytics

Sign in

arXiv:math/0507314 [math.CO]AbstractReferencesReviewsResources

Link complexes of subspace arrangements

Axel Hultman

Published 2005-07-15, updated 2005-09-02Version 2

Given a simplicial hyperplane arrangement H and a subspace arrangement A embedded in H, we define a simplicial complex Delta_{A,H} as the subdivision of the link of A induced by H. In particular, this generalizes Steingrimsson's coloring complex of a graph. We do the following: (1) When A is a hyperplane arrangement, Delta_{A,H} is shown to be shellable. As a special case, we answer affirmatively a question of Steingrimsson on coloring complexes. (2) For H being a Coxeter arrangement of type A or B we obtain a close connection between the Hilbert series of the Stanley-Reisner ring of Delta_{A,H} and the characteristic polynomial of A. This extends results of Steingrimsson and provides an interpretation of chromatic polynomials of hypergraphs and signed graphs in terms of Hilbert polynomials.

Comments: 10 pages; updated reference for Theorem 4.1 (thanks to E. Delucchi)
Categories: math.CO, math.AC
Subjects: 13F55, 14N20
Related articles: Most relevant | Search more
arXiv:1904.06443 [math.CO] (Published 2019-04-12)
A rotation group whose subspace arrangement is not from a reflection group
arXiv:1012.3847 [math.CO] (Published 2010-12-17, updated 2011-06-07)
Chromatic polynomials of complementary (n,k)-clique pairs
arXiv:1611.09728 [math.CO] (Published 2016-11-29)
Stapledon Decompositions and Inequalities for Coefficients of Chromatic Polynomials