相关论文: Freeness of hyperplane arrangements associated wit…
We define specific multiplicities on the braid arrangement by using edge-bicolored graphs. To consider their freeness, we introduce the notion of bicolor-eliminable graphs as a generalization of Stanley's classification theory of free…
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…
In this article, we study freeness of hyperplane arrangements. One of the most investigated arrangement is a graphic arrangement. Stanley proved that a graphic arrangement is free if and only if the corresponding graph is chordal and Dirac…
Every subarrangement of Weyl arrangements of type $ B_{\ell} $ is represented by a signed graph. Edelman and Reiner characterized freeness of subarrangements between type $ A_{\ell-1} $ and type $ B_{\ell} $ in terms of graphs. Recently,…
We prove a characterization of freeness, conjectured by Athanasiadis, for the family of hyperplane arrangements which lie between the Coxeter and the Catalan arrangement of type $A_\ell$. One direction was already proved in [2]. Here we…
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…
Let $ G $ be a simple graph of $ \ell $ vertices $ \{1, \dots, \ell \} $ with edge set $ E_{G} $. The graphical arrangement $ \mathcal{A}_{G} $ consists of hyperplanes $ \{x_{i}-x_{j}=0\} $, where $ \{i, j \} \in E_{G} $. It is well known…
We introduce a new class of arrangements of hyperplanes, called (strictly) plus-one generated arrangements, from algebraic point of view. Plus-one generatedness is close to freeness, i.e., plus-one generated arrangements have their…
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}$.
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,…
The class of subarrangements of the well-studied braid arrangement, so-called graphic hyperplane arrangements, is important for analysing new concepts and properties in hyperplane arrangement theory. While there is a nice characterization…
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…
This is the expanded notes of the lecture by the author in "Arrangements in Pyrenees", June 2012. We are discussing relations of freeness and splitting problems of vector bundles, several techniques proving freeness of hyperplane…
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.
Recently, Cuntz and K\"uhne introduced a particular class of hyperplane arrangements stemming from a given graph $G$, so called connected subgraph arrangements $A_G$. In this note we strengthen some of the result from their work and prove…
We study Pythagorean hyperplane arrangements, originally defined by Zaslavsky. In this first part of a series on such arrangements, we introduce a new notion of genericity for such arrangements. Using this notion we construct an auxiliary…
Flips of diagonals in colored triangle-free triangulations of a convex polygon are interpreted as moves between two adjacent chambers in a certain graphic hyperplane arrangement. Properties of geodesics in the associated flip graph are…
We introduce the use of liaison addition to the study of hyperplane arrangements. For an arrangement, $\mathcal A$, of hyperplanes in $\mathbb P^n$, $\mathcal A$ is free if $R/J$ is Cohen-Macaulay, where $J$ is the Jacobian ideal of…
Let $G$ be a simple graph on the vertex set $\{v_1,\dots,v_n\}$ with edge set $E$. Let $K$ be a field. The graphical arrangement $\mathcal{A}_G$ in $K^n$ is the arrangement $x_i-x_j=0, v_iv_j \in E$. An arrangement $\mathcal{A}$ is…
We define a chain complex for generalized splines on graphs, analogous to that introduced by Billera and refined by Schenck-Stillman for splines on polyhedral complexes. The hyperhomology of this chain complex yields bounds on the…