Characteristic quasi-polynomials are the enumerative functions counting the number of elements in the complement of hyperplane arrangements modulo positive integers. A notable phenomenon in this context is period collapse, where the quasi-polynomial reduces to a polynomial or has a smaller period than the lcm period. In this paper, we compute the characteristic quasi-polynomials of the restriction of the Shi arrangement of type B by one given hyperplane. As a corollary, we completely determine whether period collapse occurs in the characteristic quasi-polynomial of the deletion of the Shi arrangement of type B. This implies the solution for the conjecture posed by Higashitani, Tran and Yoshinaga in this case.
We study the notion of a nice partition or factorization of a hyperplane arrangement due to Terao from the early 1990s. The principal aim of this note is an analogue of Terao's celebrated addition-deletion theorem for free arrangements for the class of nice arrangements. This is a natural setting for the stronger property of an inductive factorization of a hyperplane arrangement by Jambu and Paris. In addition, we show that supersolvable arrangements are inductively factored and that inductively factored arrangements are inductively free. Combined with our addition-deletion theorem this leads …
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 prove the ideal-free theorem. The aim of this article is to give the deletion version of MAT, the multiple deletion theorem (MDT). Also, we can generalize MAT from the viewpoint of our new proof. Moreover, we introduce their restriction version, a multiple restriction theorem (MRT). Applications of them including the combinatorial freeness of the extended C…
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 combinatorial, i.e., whether you can apply it depends only on the intersection lattice of arrangements. The proof is based on a classical technique. Since some parts are already completed recently, we prove the rest part, i.e., the combinatoriality of the addition theorem. As a corollary, we can define a new class of free arrangements called the additionally …
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 and necessary condition for the deletion theorem in terms of characteristic polynomials. This gives a lot of corollaries including the existence of free filtrations. The proof is based on the result about the form of minimal generators of a logarithmic derivation module of a multiarrangement which satisfies the $b_2$-equality.
The Euler multiplicity and addition-deletion theorems for multiarrangements
超平面构形的增删定理最初在[H. Terao，超平面的排列及其自由度I，II。J. Fac. Sci. Univ. Tokyo Sect. IA Math.27（1980），293- 320]，提供了构造自由排列的例子的有用方法。在这篇文章中，我们证明了添加删除定理的多重安排。推广的一个关键是定义一个新的多重性，称为欧拉多重性，一个受限制的多重排列。我们在许多情况下计算欧拉多重数。然后，我们应用添加删除定理，以各种安排，包括超可解安排和Coxeter安排类型$A_{3}$，以构建自由和非自由的多重安排。
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 arrangements in a lot of new situations. Then, starting with Ziegler's example of a pair of arrangements of $d=9$ lines with $n_3=6$ triple points in addition to some double points, having the same combinatorics, but distinct minimal degree of a logarithmic derivation, we construct new examples of such pairs, for any number $d\geq 9$ of lines, and any number …
We give a long exact sequence for the homology of a graded atomic lattice equipped with a sheaf of modules, in terms of the deleted and restricted lattices. This is then used to compute the homology of the arrangement lattice of a hyperplane arrangement equipped with the natural sheaf. This generalises an old result of Lusztig.
A basis construction for the Shi arrangement of the type $B_{\ell}$ or $C_{\ell}$
Shi排列是由Weyl排列的超平面和它们的平行移动组成的超平面的仿射排列。它是由J. Y. Shi在仿射外尔群的Kazhdan-Lusztig表示的研究中取得了重要的成就。M.吉永表明，圆锥体在每个施安排是免费的。本文构造了$B_{\ell}$或$C_{\ell}$型Shi型安排上锥的导子模的一个显式基.
In this article we prove that the ideal-Shi arrangements are free central arrangements of hyperplanes satisfying the dual-partition formula. Then it immediately follows that there exists a saturated free filtration of the cone of any affine Weyl arrangement such that each filter is a free subarrangement satisfying the dual-partition formula. This generalizes the main result in \cite{ABCHT} which affirmatively settled a conjecture by Sommers and Tymoczko \cite{SomTym}.
We generalize valuations on polyhedral cones to valuations on fans. For fans induced by hyperplane arrangements, we show a correspondence between rotation-invariant valuations and deletion-restriction invariants. In particular, we define a characteristic polynomial for fans in terms of spherical intrinsic volumes and show that it coincides with the usual characteristic polynomial in the case of hyperplane arrangements. This gives a simple deletion-restriction proof of a result of Klivans-Swartz. The metric projection of a cone is a piecewise-linear map, whose underlying fan prompts a generaliz…
Associated with the $r$-Shi arrangement and $r$-Catalan arrangement in $\Bbb{R}^n$, we introduce a cubic matrix for each region to establish two bijections in a uniform way. Firstly, the positions of minimal positive entries in column slices of the cubic matrix will give a bijection from regions of the $r$-Shi arrangement to $O$-rooted labeled $r$-trees. Secondly, the numbers of positive entries in column slices of the cubic matrix will give a bijection from regions of the $r$-Catalan arrangement to pairings of permutation and $r$-Dyck path. Moreover, the numbers of positive entries in row sli…
The number of flats of a hyperplane arrangement is considered as a generalization of the Bell number and the Stirling number of the second kind. Robert Gill gave the exponential generating function of the number of flats of the extended Catalan arrangements, using species. In this article, we introduce the species of flats of the extended Catalan and Shi arrangements and they are given by iterated substitution of species of sets and lists. Moreover, we enumerate the flats of these arrangements in terms of infinite matrices.
In 1986, Shi derived the famous formula $(n+1)^{n-1}$ for the number of regions of the Shi arrangement, a hyperplane arrangement in $\mathbb{R}^n$. There are at least two different bijective explanations of this formula, one by Pak and Stanley, another by Athanasiadis and Linusson. In 1996, Athanasiadis used the finite field method to derive a formula for the number of $k$-dimensional faces of the Shi arrangement for any $k$. Until now, the formula of Athanasiadis did not have a bijective explanation. In this paper, we extend a bijection for regions defined by Bernardi to obtain a bijection be…
In 1983, Lusztig defined a map $σ$ from affine permutations of $n$ to partitions of $n$. He conjectured that for any partition $λ$ of $n$, $σ^{-1}(λ)$ is a two-sided cell. Shi, in 1986, proved part of this conjecture. As a byproduct, he introduced the Shi arrangement of hyperplanes and found a few of its remarkable properties. The Shi arrangement has since become a central object in algebraic combinatorics. This article is intended to be a fairly gentle introduction to the Shi arrangement, intended for readers with a modest background in combinatorics, algebra, and Euclidean geometry.
A finite simple graph $Γ$ determines a quotient $P_Γ$ of the pure braid group, called a graphic arrangement group. We analyze homomorphisms of these groups defined by deletion of sets of vertices, using methods developed in prior joint work with R. Randell. We show that, for a $K_4$-free graph $Γ$, a product of deletion maps is injective, embedding $P_Γ$ in a product of free groups. Then $P_Γ$ is residually free, torsion-free, residually torsion-free nilpotent, and acts properly on a CAT(0) cube complex. We also show $P_Γ$ is of homological finiteness type $F_{m-1}$, but not $F_m$, where $m$ i…
Back in the nineties Pak and Stanley introduced a labeling of the regions of a k-Shi arrangement by k-parking functions and proved its bijectivity. Duval, Klivans, and Martin considered a modification of this construction associated with a graph G. They introduced the G-Shi arrangement and a labeling of its regions by G-parking functions. They conjectured that their labeling is surjective, i.e. that every G-parking function appears as a label of a region of the G-Shi arrangement. Later Hopkins and Perkinson proved this conjecture. In particular, this provided a new proof of the bijectivity of …
The \emph{Shi arrangement} is the set of all hyperplanes in $\mathbb R^n$ of the form $x_j - x_k = 0$ or $1$ for $1 \le j < k \le n$. Shi observed in 1986 that the number of regions (i.e., connected components of the complement) of this arrangement is $(n+1)^{n-1}$. An unrelated combinatorial concept is that of a \emph{parking function}, i.e., a sequence $(x_1, x_2, ..., x_n)$ of positive integers that, when rearranged from smallest to largest, satisfies $x_k \le k$. (There is an illustrative reason for the term \emph{parking function}.) It turns out that the number of parking functions of len…
We introduce a new family of hyperplane arrangements in dimension $n\geq3$ that includes both the Shi arrangement and the Ish arrangement. We prove that all the members of a given subfamily have the same number of regions - the connected components of the complement of the union of the hyperplanes - which can be bijectively labeled with the Pak-Stanley labeling. In addition, we show that, in the cases of the Shi and the Ish arrangements, the number of labels with reverse centers of a given length is equal, and conjecture that the same happens with all of the members of the family.
We establish counting formulas and bijections for deformations of the braid arrangement. Precisely, we consider real hyperplane arrangements such that all the hyperplanes are of the form $x\_i-x\_j=s$ for some integer $s$. Classical examples include the braid, Catalan, Shi, semiorder and Linial arrangements, as well as graphical arrangements. We express the number of regions of any such arrangement as a signed count of decorated plane trees. The characteristic and coboundary polynomials of these arrangements also have simple expressions in terms of these trees. We then focus on certain "well-b…
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 projective dimensions of hyperplane arrangements. They are generalizations of the free arrangement cases, that can be regarded as the special case of our result when the projective dimension is zero. The keys to prove them are several new methods to determine the surjectivity of the Euler and the Ziegler restriction maps, that is combinatorial when the projective…
A barred preferential arrangement is a preferential arrangement, onto which in-between the blocks of the preferential arrangement a number of identical bars are inserted. We offer a generalisation of barred preferential arrangements by making use of the generalised Stirling numbers proposed by Hsu and Shiue (1998). We discuss how these generalised barred preferential arrangements offer a unified combinatorial interpretation of geometric polynomials. We also discuss asymptotic properties of these numbers.
