June 23, 2014
In the category of free arrangements, inductively and recursively free arrangements are important. In particular, in the former, the conjecture by Terao asserting that freeness depends only on combinatorics holds true. A long standing problem whether all free arrangements are recursively free or not is settled by Cuntz and Hoge very recently, by giving a free but non-recursively free plane arrangement consisting of 27 planes. In this paper, we construct a free but non-recur...
July 22, 2017
In this article we show that any free hyperplane arrangement with exponents 1's and 2's is a supersolvable arrangement. We conjecture that any free arrangement with exponents 1's, 2's and exactly one 3, is also supersolvable, and we show this conjecture for hyperplane arrangements of ranks 4 and 5, and for inductively free arrangements of any rank.
June 20, 2023
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, then at least one of two among them is free. When $\mathcal{A}$ is in the three dimensional arrangement, we show a stronger statement.
January 17, 2013
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 arrangements. This first part is an introduction to hyperplane arrangements from a combinatorial point of view. ----- En esta serie de tres articulos, damos una exposicion de varios resultados y problemas abiertos en tres areas de la combinator...
November 28, 2015
We show that all the possible pairs of integers occur as exponents for free or nearly free irreducible plane curves and line arrangements, by producing only two types of simple families of examples. The topology of the complements of these curves and line arrangements is also discussed, and many of them are shown not to be $K(\pi,1)$ spaces.
November 22, 2011
The fundamental group of the complement of a hyperplane arrangement plays an important role in studying the corresponding arrangements. In particular, for large families of hyperplane arrangements, this fundamental group, being isomorphic to the fundamental group of a complement of a line arrangement, has some remarkable properties: either it is a direct sum of free groups and a free abelian group, or it has a conjugation-free geometric presentation. In this paper, we first...
May 21, 2017
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 characterize m-freeness for product arrangements, while we prove that all localizations of an m-free arrangement are m-free. From these results, we give answers to Holm's questions.
July 8, 2020
In this note we study curves (arrangements) in the complex projective plane which can be considered as generalizations of free curves. We construct families of arrangements which are nearly free and possess interesting geometric properties. More generally, we study $3$-syzygy arrangements and we present examples that admit unexpected curves.
March 27, 2018
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}$.
November 1, 2021
In this paper, we introduce the notion of a complete hypertetrahedral arrangement $\mathcal{A}$ in $\mathbb{P}^{n}$. We address two basic problems. First, we describe the local freeness of $\mathcal{A}$ in terms of smaller complete hypertetrahedral arrangements and graph theory properties, specializing the Musta\c{t}\u{a}-Schenck criterion. As an application, we obtain that general complete hypertetrahedral arrangements are not locally free. In the second part of this paper, ...