Link complexes of subspace arrangements

DOI10.1016/J.EJC.2005.12.006zbMATH Open1113.52038OpenAlexW1970863601MaRDI QIDQ872034FDOQ872034

Authors: Axel Hultman 

Publication date: 27 March 2007

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: 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.

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

Recommendations

• scientific article; zbMATH DE number 1254148
• Intersection homology of linkage spaces
• Subspace Arrangements and Cherednik Algebras
• Subspaces of knot spaces
• The homology of real subspace arrangements
• Affine connection complexes
• scientific article; zbMATH DE number 1886612
• Linking numbers and boundaries of varieties
• On the Homology of Complements of Arrangements of Subspaces and Spheres
• Link homology and Frobenius extensions

zbMATH Keywords

hyperplane arrangementCoxeter arrangementSteingrímsson's coloring complex of a graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Shellability for polytopes and polyhedra (52B22)

Cites Work

• Oriented Matroids
• Signed graph coloring
• \(q\)-Eulerian polynomials arising from Coxeter groups
• On the foundations of combinatorial theory I. Theory of M�bius Functions
• Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems.
• The Geometry of Root Systems and Signed Graphs
• Hilbert polynomials in combinatorics
• The Koszul property in affine semigroup rings
• The topology of the coloring complex
• The coloring ideal and coloring complex of a graph
• Homotopy types of subspace arrangements via diagrams of spaces
• A Partial Order on the Regions of R n Dissected by Hyperplanes

Cited In (10)

• Shellable complexes and topology of diagonal arrangements
• Hypergraph coloring complexes
• The Hodge structure of the coloring complex of a hypergraph
• Hyperoctahedral Eulerian idempotents, Hodge decompositions, and signed graph coloring complexes
• The coloring complex and cyclic coloring complex of a complete \(k\)-uniform hypergraph
• Bounds on the coefficients of tension and flow polynomials
• Edge colored hypergraphic arrangements
• Coloring complexes and combinatorial Hopf monoids
• Coloring complexes and arrangements
• On Cohen-Macaulay Hopf monoids in species

This page was built for publication: Link complexes of subspace arrangements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q872034)