Related papers: Derivation degree sequences of non-free arrangemen…
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…
This paper studies the algebraic structure of a new class of hyperplane arrangement $A$ obtained by deleting two hyperplanes from a free arrangement. We provide information on the minimal free resolutions of the logarithmic derivation…
We study a generalized version of Terao's famous addition theorem for free arrangements to the category of those with projective dimension one. Namely, we give a criterion to determine the algebraic structure of logarithmic derivation…
We establish a general theory for projective dimensions of the logarithmic derivation modules of hyperplane arrangements. That includes the addition-deletion and restriction theorem, Yoshinaga-type result, and the division theorem for…
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…
The addition-deletion theorems for hyperplane arrangements, which were originally shown in [H. Terao, Arrangements of hyperplanes and their freeness I, II. J. Fac. Sci. Univ. Tokyo Sect. IA Math. 27 (1980), 293--320], provide useful ways to…
This is a survey and research note on the modified Orlik conjecture derived from the division theorem introduced in [2]. The division theorem is a generalization of classical addition-deletion theorems for free arrangements. The division…
In these notes we study hyperplane arrangements having at least one logarithmic derivation of degree two that is not a combination of degree one logarithmic derivations. It is well-known that if a hyperplane arrangement has a linear…
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…
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…
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…
Saito's criterion is a foundational result that algebraically characterizes free hyperplane arrangements via the determinant of a square matrix of logarithmic derivations. It is natural to ask whether this criterion can be generalized to…
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 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…
A graphic arrangement is a subarrangement of the braid arrangement whose set of hyperplanes is determined by an undirected graph. A classical result due to Stanley, Edelman and Reiner states that a graphic arrangement is free if and only if…
We present new degree-sequence lower bounds on the expected size of an independent set from the hard-core model. For arbitrary graphs, we establish a multivariate lower bound inspired by a conjecture of the first author and Kang and a…
We study the joint degree counts in proportional attachment random graphs and find a simple representation for the limit distribution in infinite sequence space. We show weak convergence with respect to the p-norm topology for appropriate p…
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…
We study the relation between additivity and deduction theorems in the algebraic semantics of congruential modal logic. Additivity of the modal operator is well-known to imply the local deduction-detachment theorem. Our main theme is that…
The degree sequence optimization problem is to find a subgraph of a given graph which maximizes the sum of given functions evaluated at the subgraph degrees. Here we study this problem by replacing degree sequences, via suitable nonlinear…