arXiv · 1211.5318
Broken circuit complexes and hyperplane arrangements
Abstract
We study Stanley-Reisner ideals of broken circuits complexes and characterize those ones admitting a linear resolution or being complete intersections. These results will then be used to characterize arrangements whose Orlik-Terao ideal has the same properties. As an application, we improve a result of Wilf on upper bounds for the coefficients of the chromatic polynomial of a maximal planar graph. We also show that for an ordered matroid with disjoint minimal broken circuits, the supersolvability of the matroid is equivalent to the Koszulness of its Orlik-Solomon algebra.
Explore related subjects
Keep this discovery
Le Van Dinh, Tim Roemer. 2012-11-22. Broken circuit complexes and hyperplane arrangements. https://doi.org/10.1007/s10801-013-0435-z
Cite the original work for its findings. Save a collection to share your selection of sources.