Broken circuit complexes and hyperplane arrangements (Q2435044): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
RedirectionBot (talk | contribs)
Changed an Item
Property / reviewed by
 
Property / reviewed by: Kelly Jeanne Pearson / rank
 
Normal rank

Revision as of 21:10, 28 February 2024

scientific article
Language Label Description Also known as
English
Broken circuit complexes and hyperplane arrangements
scientific article

    Statements

    Broken circuit complexes and hyperplane arrangements (English)
    0 references
    0 references
    0 references
    3 February 2014
    0 references
    The authors study the Orlik-Terao algebra of a hyperplane arrangement which is the commutative analog of the much-studied Orlik-Solomon algebra. The authors utilize a connection to the broken circuit algebra associated to an arrangement; this algebra was studied in [\textit{N. Proudfoot} and \textit{D. Speyer}, Beitr. Algebra Geom. 47, No. 1, 161--166 (2006; Zbl 1095.13024)]. From the authors' abstract: ``We study Stanley-Reisner ideals of broken circuit complexes and characterize those ones admitting linear resolutions or being complete intersections. These results will then be used to characterize hyperplane 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 a matroid with a complete instruction broken circuit complex, the super solvability of the matroid is equivalent to the Koszulness of its Orlik-Solomon algebra.''
    0 references
    broken circuit complex
    0 references
    complete intersection
    0 references
    hyperplane arrangement
    0 references
    matroid
    0 references
    Orlik-Terao algebra
    0 references
    resolution
    0 references

    Identifiers