Related papers: Addition-deletion theorem for free hyperplane arra…
Let $B$ be an arrangement of linear complex hyperplanes in $C^d$. Then a classical result by Orlik \& Solomon asserts that the cohomology algebra of the complement can be constructed from the combinatorial data that are given by the…
In this series of three articles, we give an exposition of various results and open problems in three areas of algebraic and geometric combinatorics: totally non-negative matrices, representations of the symmetric group, and hyperplane…
We study the change of the minimal degree of a logarithmic derivation of a hyperplane arrangement under the addition or the deletion of a hyperplane, and give a number of applications. First, we prove the existence of Tjurina maximal line…
We consider arrangements of axis-aligned rectangles in the plane. A geometric arrangement specifies the coordinates of all rectangles, while a combinatorial arrangement specifies only the respective intersection type in which each pair of…
Many classical theorems in combinatorics establish the emergence of substructures within sufficiently large collections of objects. Well-known examples are Ramsey's theorem on monochromatic subgraphs and the Erd\H{o}s-Rado sunflower lemma.…
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…
Associated to an arrangement of projective hyperplanes A is the module D(A), which consists of derivations tangent to A. We study D(A) when A is a configuration of lines in the projective plane. In this setting, we relate the…
Additive combinatorics asks for lower bounds on sumsets and restricted sumsets over finite fields. Central examples are the Cauchy-Davenport theorem and the Erd\H{o}s-Heilbronn conjecture. In this note, we develop Das's linear algebraic…
We uncover a close relationship between combinatorial and syntactic proofs for first-order logic (without equality). Whereas syntactic proofs are formalized in a deductive proof system based on inference rules, a combinatorial proof is a…
Wei's celebrated Duality Theorem is generalized in several ways, expressed as duality theorems for linear codes over division rings and, more generally, duality theorems for matroids. These results are further generalized, resulting in two…
We present a concise proof for the supporting hyperplane theorem. We then observe that the proof not only establishes the supporting hyperplane theorem but also extends it to a hyperplane separation theorem for certain non-convex sets. The…
Over the complex numbers, the complement of a collection of hyperplanes is a widely-studied object; the cohomology ring, in particular, is known to have a structure depending only on the combinatorial properties of the intersection of…
We introduce combinatorial types of arrangements of convex bodies, extending order types of point sets to arrangements of convex bodies, and study their realization spaces. Our main results witness a trade-off between the combinatorial…
A Weyl arrangement is the arrangement defined by the root system of a finite Weyl group. When a set of positive roots is an ideal in the root poset, we call the corresponding arrangement an ideal subarrangement. Our main theorem asserts…
In this paper we describe a parallel algorithm for generating all non-isomorphic rank $3$ simple matroids with a given multiplicity vector. We apply our implementation in the HPC version of GAP to generate all rank $3$ simple matroids with…
We consider the vanishing ideal of an arrangement of linear subspaces in a vector space and investigate when this ideal can be generated by products of linear forms. We introduce a combinatorial construction (blocker duality) which yields…
A rough structure theorem is proved for graphs $G$ containing no copy of a bounded degree tree $T$: from any such $G$, one can delete $o(|G||T|)$ edges in order to get a subgraph all of whose connected components have a cover of order…
For each pair $(Q_i,Q_j)$ of reference points and each real number $r$ there is a unique hyperplane $h \perp Q_iQ_j$ such that $d(P,Q_i)^2 - d(P,Q_j)^2 = r$ for points $P$ in $h$. Take $n$ reference points in $d$-space and for each pair…
Arrangement theory plays an essential role in the study of the unfolding model used in many fields. This paper describes how arrangement theory can be usefully employed in solving the problems of counting (i) the number of admissible…
This paper illustrates the combinatorial approach to vertex algebra - study of vertex algebras presented by generators and relations. A necessary ingredient of this method is the notion of free vertex algebra. Borcherds \cite{bor} was the…