Monomial Bases for Broken Circuit Complexes

dc.creatorBrown, Jason
dc.creatorSagan, Bruce
dc.date2006-01-25
dc.date.accessioned2026-07-07T06:59:18Z
dc.date.available2026-07-07T06:59:18Z
dc.descriptionLet F be a field and let G be a finite graph with a total ordering on its edge set. Richard Stanley noted that the Stanley-Reisner ring F(G) of the broken circuit complex of G is Cohen-Macaulay. Jason Brown gave an explicit description of a homogeneous system of parameters for F(G) in terms of fundamental cocircuits in G. So F(G) modulo this hsop is a finite dimensional vector space. We conjecture an explicit monomial basis for this vector space in terms of the circuits of G and prove that the conjecture is true for two infinite families of graphs. We also explore an application of these ideas to bounding the number of acyclic orientations of G from above.
dc.identifierhttps://arxiv.org/abs/math/0601619
dc.identifierhttp://arxiv.org/abs/math/0601619
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/107697
dc.subjectCombinatorics
dc.subjectCommutative Algebra
dc.subjectPrimary 05E99; Secondary 05C99, 13A02
dc.titleMonomial Bases for Broken Circuit Complexes
dc.typetext

Files

Collections