Related papers: Broken circuit complexes and hyperplane arrangemen…
Let $\mathcal{A}$ be an affine hyperplane arrangement, $L(\mathcal{A})$ its intersection poset, and $\chi_{\mathcal{A}}(t)$ its characteristic polynomial. This paper aims to propose combinatorial structures for the factorization of…
Star configurations are certain unions of linear subspaces of projective space that have been studied extensively. We develop a framework for studying a substantial generalization, which we call matroid configurations, whose ideals…
We consider the fundamental Matroid Theory problem of finding a circuit in a matroid spanning a set T of given terminal elements. For graphic matroids this corresponds to the problem of finding a simple cycle passing through a set of given…
The Orlik-Solomon algebra of a matroid can be considered as a quotient ring over the exterior algebra E. At first we study homological properties of E-modules as e.g. complexity, depth and regularity. In particular, we consider modules with…
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 is an isomorphism between the Orlik-Solomon algebra of a…
We study the number of hamiltonian circuits, containing a fixed basis, and the number of hyperplanes, which do not contain a fixed basis in perfect matroid designs. Projective and affine finite geometries are considered as examples of such…
Let A be a collection of n linear hyperplanes in k^l, where k is an algebraically closed field. The Orlik-Terao algebra of A is the subalgebra R(A) of the rational functions generated by reciprocals of linear forms vanishing on hyperplanes…
We prove that there exist uniform $(+,\times,/)$-circuits of size $O(n^3)$ to compute the basis generating polynomial of regular matroids on $n$ elements. By tropicalization, this implies that there exist uniform $(\max,+,-)$-circuits and…
A classical problem in Distance Geometry, with multiple practical applications (in molecular structure determination, sensor network localization etc.) is to find the possible placements of the vertices of a graph with given edge lengths.…
We prove the torsion freeness of the decomposable Orlik--Solomon algebra of a simple matroid on ground set $[n]$. In the class of hypersolvable \& non-supersolvable complex hyperplane arrangements, the torsion freeness, in a certain degree,…
Using the tools of algebraic Morse theory, and the thin poset approach to constructing homology theories, we give a categorification of Whitney's broken circuit theorem for the chromatic polynomial, and for Stanley's chromatic symmetric…
We consider arrangements of tropical hyperplanes where the apices of the hyperplanes are taken to infinity in certain directions. Such an arrangement defines a decomposition of Euclidean space where a cell is determined by its `type' data,…
A family C of circuits of a matroid M is a linear class if, given a modular pair of circuits in C}, any circuit contained in the union of the pair is also in C. The pair (M,C) can be seen as a matroidal generalization of a biased graph. We…
Infinite hyperplane arrangements whose vertices form a lattice are studied from the point of view of commutative algebra. The quotient of such an arrangement modulo the lattice action represents the minimal free resolution of the associated…
We investigate arrangements of hyperplanes whose normal vectors are given by connected subgraphs of a fixed graph. These include the resonance arrangement and certain ideal subarrangements of Weyl arrangements. We characterize those which…
This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite and infinite matroids whose ground set have some canonical symmetry, for example row and column symmetry and transposition symmetry. For (a)…
Given a matroid $M=(E,{\cal I})$, and a total ordering over the elements $E$, a broken circuit is a circuit where the smallest element is removed and an NBC independent set is an independent set in ${\cal I}$ with no broken circuit. The set…
The emergence of Boij-S\"oderberg theory has given rise to new connections between combinatorics and commutative algebra. Herzog, Sharifan, and Varbaro recently showed that every Betti diagram of an ideal with a k-linear minimal resolution…
Matroid theory provides a unifying framework for studying dependence across combinatorics, geometry, and applications ranging from rigidity to statistics. In this work, we study circuit varieties of matroids, defined by their minimal…
We show that various combinatorial invariants of matroids such as Chow rings and Orlik--Solomon algebras may be assembled into "operad-like" structures. Specifically, one obtains several operads over a certain Feynman category which we…