Related papers: Addition-deletion theorem for free hyperplane arra…
In Terao [24], Hiroaki Terao defined and studied "admissible map", which is a generalization of "social welfare function" in the context of hyperplane arrangements. Using this, he proved a generalized Arrow's Impossibility Theorem using…
We study the nonresonance phenomenon for complex rank-one local systems on complements of hyperplane arrangements. We refine the method of Cohen, Dimca, and Orlik and obtain a combinatorial sufficient condition for nonresonance. As an…
Building on work of Brandt and Terao in their study of $k$-formality, we introduce a co-chain complex associated to a multi-arrangement and prove that its cohomologies determine freeness of the associated module of multi-derivations. This…
Let $\A$ be a free arrangement of $d$ lines in the complex projective plane, with exponents $d_1\leq d_2$. Let $m$ be the maximal multiplicity of points in $\A$. In this note, we describe first the simple cases $d_1 \leq m$. Then we study…
We consider the behaviour of logarithmic differential forms on arrangements and multiarrangements of hyperplanes under the operations of deletion and restriction, extending early work of G\"unter Ziegler. The restriction of logarithmic…
We give lower bounds for the degree of multiplicative combinations of iterates of rational functions (with certain exceptions) over a general field, establishing the multiplicative independence of said iterates. This leads to a…
The study of geometric group theory has suggested several theorems related to subdivision tilings that have a natural hyperbolic structure. However, few examples exist. We construct subdivision tilings for the complement of every…
We generalise the existence of combinatorial designs to the setting of subset sums in lattices with coordinates indexed by labelled faces of simplicial complexes. This general framework includes the problem of decomposing hypergraphs with…
We will consider some characterizations of freeness of a hyperplane arrangement, in terms of the following properties: locally freeness, factorization of characteristic polynomial and freeness of restricted multiarrangement. In the case of…
An arrangement of hyperplanes is called formal, if the relations between the hyperplanes are generated by relations in codimension 2. Formality is not a combinatorial property, raising the question for a characterization for combinatorial…
We show that there are only finitely many combinatorial types of free real line arrangements with only double, triple and quadruple intersection points, and we enlist all admissible weak-combinatorics of them. Then we classify all real…
We study a relation between roots of characteristic polynomials and intersection points of line arrangements. Using these results, we obtain a lot of applications for line arrangements. Namely, we give (i) a generalized addition theorem for…
This paper considers a hyperplane arrangement constructed with a subset of a set of all simple paths in a graph. A connection of the constructed arrangement to the maximum matching problem is established. Moreover, the problem of finding…
The intersection data of a hyperplane arrangement is described by a geometric lattice, or equivalently a simple matroid. There is a rich interplay between this combinatorial structure and the topology of the arrangement complement. In this…
We amalgamate two generalizations of Ramsey's Theorem--Ramsey classes and the Erd\H{o}s-Rado Theorem--into the notion of a combinatorial Erd\H{o}s-Rado class. These classes are closely related to Erd\H{o}s-Rado classes, which are those from…
Let $\mathcal C :f=0$ be a curve arrangement in the complex projective plane. If $\mathcal C$ contains a curve subarrangement consisting of at least three members in a pencil, then one obtains an explicit syzygy among the partial…
In this paper, we recover the characteristic polynomial of an arrangement of hyperplanes by computing the rational equivalence class of the variety defined by the logarithmic ideal of the arrangement. The logarithmic ideal was introduced in…
We show that the characteristic polynomial of a hyperplane arrangement can be recovered from the class in the Grothendieck group of varieties of the complement of the arrangement. This gives a quick proof of a theorem of Orlik and Solomon…
The main purpose of this paper is to provide combinatorial constraints on the constructability of free and nearly free arrangements of smooth plane conics admitting certain ${\rm ADE}$ singularites.
A rigorous geometric proof of the Lie's Theorem on nonlinear superposition rules for solutions of non-autonomous ordinary differential equations is given filling in all the gaps present in the existing literature. The proof is based on an…