Related papers: Broken circuit complexes and hyperplane arrangemen…
This paper introduces two new notions of graded linear resolution and graded linear quotients, which generalize the concepts of linear resolution property and linear quotient for modules over the polynomial ring $A=k[x_1, \dots ,x_n]$.…
It is proved that the broken circuit complex of an ordered matroid is Gorenstein if and only if it is a complete intersection. Several characterizations for a matroid that admits such an order are then given, with particular interest in the…
Given a matroid M represented by a linear subspace L in n-space (equivalently by an arrangement of n hyperplanes in L), we define a graded ring R(L) which degenerates to the Stanley-Reisner ring of the broken circuit complex for any choice…
In this article we construct a combinatorial quasi-free differential graded model for the Orlik-Solomon algebra of supersolvable matroids, which generalizes in a matroidal setting the cdga of admissible graphs introduced by M. Kontsevich…
A root ideal arrangement $A_I$ is the set of reflecting hyperplanes corresponding to the roots in an order ideal $I$ of the root poset on the positive roots of a finite crystallographic root system. A characterisation of supersolvable root…
We primarily investigate the properties of characteristic polynomials of semimatroids. In particular, we provide a combinatorial interpretation of their coefficients, generalizing the Whitney's Broken Circuit Theorem. We also prove that the…
We construct minimal cellular resolutions of squarefree monomial ideals arising from hyperplane arrangements, matroids and oriented matroids. These are Stanley-Reisner ideals of complexes of independent sets, and of triangulations of…
We construct a combinatorial generalization of the Leray models for hyperplane arrangement complements. Given a matroid and some combinatorial blowup data, we give a presentation for a bigraded (commutative) differential-graded algebra. If…
We establish a broad generalization of Whitney's broken circuit theorem on the chromatic polynomial of a graph to sums of type $\sum_{A\subseteq S} f(A)$ where $S$ is a finite set and $f$ is a mapping from the power set of $S$ into an…
Brown has shown that the Stanley-Reisner ring of the broken circuit complex of a graph has a linear system of parameters which is defined in terms of the circuits and cocircuits of the graph. Later on Brown and Sagan conjectured a special…
Let 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…
We study the exactness of certain combinatorially defined complexes which generalize the Orlik-Solomon algebra of a geometric lattice. The main results pertain to complex reflection arrangements and their restrictions. In particular, we…
Motivated by the Gray code interpretation of Hamiltonian cycles in Cayley graphs, we investigate the existence of Hamiltonian cycles in tope graphs of hyperplane arrangements, with a focus on simplicial, reflection, and supersolvable…
We give a combinatorial characterization of isotropic subspaces in the Orlik- Solomon algebra of a hyperplane arrangement in terms of decorations of its intersection lattice. We then use this characterization to prove a result that relates…
Supersolvable hyperplane arrangements and matroids are known to give rise to certain Koszul algebras, namely their Orlik-Solomon algebras and graded Varchenko-Gel'fand algebras. We explore how this interacts with group actions, particularly…
Given the complement of a hyperplane arrangement, let $\Gamma$ be the closure of the graph of the map inverting each of its defining linear forms. The characteristic polynomial manifests itself in the Hilbert series of $\Gamma$ in two…
There is a one-to-one correspondence between geometric lattices and the intersection lattices of arrangements of homotopy spheres. When the arrangements are essential and fully partitioned, Zaslavsky's enumeration of the cells of the…
The image of a linear space under inversion of some coordinates is an affine variety whose structure is governed by an underlying hyperplane arrangement. In this paper, we generalize work by Proudfoot and Speyer to show that circuit…
The $OS$ algebra $A$ of a matroid $M$ is a graded algebra related to the Whitney homology of the lattice of flats of $M$. In case $M$ is the underlying matroid of a hyperplane arrangement \A in $\C^r$, $A$ is isomorphic to the cohomology…
The problem of covering the ground set of two matroids by a minimum number of common independent sets is notoriously hard even in very restricted settings, i.e.\ when the goal is to decide if two common independent sets suffice or not.…