4 papers
How is a Chordal Graph like a Supersolvable Binary Matroid?
Raul Cordovil, David Forge, Sulamita Klein
Let G be a finite simple graph. From the pioneering work of R. P. Stanley it is known that the cycle matroid of G is supersolvable iff G is chordal (rigid): this is another way to…
Diagonal bases in Orlik-Solomon type algebras
Raul Cordovil, David Forge
To encode an important property of the "no broken circuit bases" of the Orlik-Solomon-Terao algebras, Andras Szenes has introduced a particular type of bases, the so called "diagon…
Quadratic Orlik-Solomon algebras of graphic matroids
Raul Cordovil, David Forge
In this note we introduce a sufficient condition for the Orlik-Solomon algebra associated to a matroid M to be l-adic and we prove that this condition is necessary when M is binary…
Groebner and diagonal bases in Orlik-Solomon type algebras
Raul Cordovil, David Forge
The Orlik-Solomon algebra of a matroid M is the quotient of the exterior algebra on the points by the ideal I(M) generated by the boundaries of the circuits of the matroid. There i…