相关论文: MAT-Freeness is not combinatorial
In this paper, we study the class of free hyperplane arrangements. Specifically, we investigate the relations between freeness over a field of finite characteristic and freeness over $\mathbb{Q}$.
The freeness of hyperplane arrangements in a three dimensional vector space over finite field is discussed. We prove that if the number of hyperplanes is greater than some bound, then the freeness is determined by the characteristic…
In this paper, we study the class of free multiarrangements of hyperplanes. Specifically, we investigate the relations between freeness over a field of finite characteristic and freeness over the rationals.
We construct counterexamples to the conjecture that every free arrangement is recursively free in characteristic zero. The intersection lattice of our smallest example has a realization over a finite field which is recursively free, thus…
We show that the deletion theorem of a free arrangement is combinatorial, i.e., whether we can delete a hyperplane from a free arrangement keeping freeness depends only on the intersection lattice. In fact, we give an explicit sufficient…
We introduce the class of MAT-free hyperplane arrangements which is based on the Multiple Addition Theorem by Abe, Barakat, Cuntz, Hoge, and Terao. We also investigate the closely related class of MAT2-free arrangements based on a recent…
We study the free path problem, i.e., if we are given two free arrangements of hyperplanes, then we can connect them by free arrangements or not. We prove that if an arrangement $\mathcal{A}$ and $\mathcal{A} \setminus \{H,L\}$ are free,…
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,…
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…
In the theory of hyperplane arrangements, the most important and difficult problem is the combinatorial dependency of several properties. In this atricle, we prove that Terao's celebrated addition-deletion theorem for free arrangements is…
We introduce a combinatorial characterization of simpliciality for arrangements of hyperplanes. We then give a sharp upper bound for the number of hyperplanes of such an arrangement in the projective plane over a finite field, and present…
A central arrangement $\A$ of hyperplanes in an $\ell$-dimensional vector space $V$ is said to be {\it totally free} if a multiarrangement $(\A, m)$ is free for any multiplicity $ m : \A\to \Z_{> 0}$. It has been known that $\A$ is totally…
An m-free hyperplane arrangement is a generalization of a free arrangement. Holm asked the following two questions: (1)Does m-free imply (m+1)-free for any arrangement? (2)Are all arrangements m-free for m large enough? In this paper, we…
We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…
We consider the triple $(\mathcal{A},\mathcal{A}',\mathcal{A}^H)$ of hyperplane arrangements and the division of their characteristic polynomials. We show that the freeness of $\mathcal{A}^H$ and the division of $\chi(\mathcal{A};t)$ by…
We prove Terao conjecture saying that the freeness is determined by the combinatorics for arrangements of 13 lines in the complex projective plane and that the property of being nearly free is combinatorial for line arrangements of up to 12…
In this paper we study Cynk-Szemberg octic hyperplane arrangements from the perspective of homological properties of their derivation modules. In particular, we define the notion of the type of hyperplane arrangements that will be used in…
In this article we describe two new characterizations of freeness for hyperplane arrangements via the study of the generic initial ideal and of the sectional matrix of the Jacobian ideal of arrangements.
In the study of free arrangements, the most useful result to construct/check free arrangements is the addition-deletion theorem. Recently, the multiple version of the addition theorem is proved, called the multiple addition theorem (MAT) to…