In 1985 Crapo introduced in \cite{Crapo} a new mathematical object that he called $\textit{geometry of circuits}$. Four years later, in 1989, Manin and Schechtman defined in \cite{MS} the same object and called it $\textit{discriminantal arrangement}$, the name by which it is known now a days. Those discriminantal arrangements $\mathcal{B}(n,k,\mathcal{A}^0)$ are builded from an arrangement $\mathcal{A}^0$ of $n$ hyperplanes in general position in a $k$-dimensional space and their combinatorics depends on the arrangement $\mathcal{A}^0$. On this basis, in 1997 Bayer and Brandt (see \cite{BB}) distinguished two different type of arrangements $\mathcal{A}^0$ calling $\textit{very generic}$ the ones for which the intersection lattice of $\mathcal{B}(n,k,\mathcal{A}^0)$ has maximum cardinality and $\textit{non-very generic}$ the others. Results on the combinatorics of $\mathcal{B}(n,k,\mathcal{A}^0)$ in the very generic case already appear in Crapo \cite{Crapo} and in 1997 in Athanasiadis \cite{Atha} while the first known result on non-very generic case is due to Libgober and the first author in 2018. In their paper \cite{LS} they provided a necessary and sufficient condition on $\mathcal{A}^0$ for which the cardinality of rank 2 intersections in $\mathcal{B}(n,k,\mathcal{A}^0)$ is not maximal anymore. In this paper we further develop their result providing a sufficient condition on $\mathcal{A}^0$ for which the cardinality of rank r, $r \geq 2$, intersections in $\mathcal{B}(n,k,\mathcal{A}^0)$ decreases.
In this article we give a computational study of combinatorics of the discriminantal arrangements. The discriminantal arrangements are parametrized by two positive integers n and k such that n>k. The intersection lattice of the discriminantal arrangement with the parameter (n,k) is isomorphic to the intersection lattice of the hyperplane arrangement generated by n generic points in the d-dimensional vector space where d=n-k-1. The combinatorics of the discriminantal arrangements is very hard, except for the special cases of the Boolean arrangements (k=0) and the braid arrangements (k=1). We re…
In this article we prove two main results. Firstly, we show that any six-line arrangement, consisting of three pairs of mutually perpendicular lines, does not give rise to a "very generic or sufficiently general" discriminantal arrangement in the sense of C. A. Athanasiadis \cite{MR1720104}. We give two proofs of the first result. The second result is as follows. The codimension-one boundary faces of (a region) a convex cone of a very generic discriminantal arrangement has not been characterized and is not known even though the intersection lattice of a very generic discriminantal arrangement …
The discriminantal arrangement is the space of configurations of $n$ hyperplanes in generic position in a $k$ dimensional space (see \cite{MS}). Differently from the case $k=1$ in which it corresponds to the well known braid arrangement, the discriminantal arrangement in the case $k>1$ has a combinatorics which depends from the choice of the original $n$ hyperplanes. It is known that this combinatorics is constant in an open Zariski set $\mathcal{Z}$, but to assess wether or not $n$ fixed hyperplanes in generic position belongs to $\mathcal{Z}$ proved to be a nontrivial problem. Even to simply…
We show that points in specific degree 2 hypersurfaces in the Grassmannian $Gr(3, n)$ correspond to generic arrangements of $n$ hyperplanes in $\mathbb{C}^3$ with associated discriminantal arrangement having intersections of multiplicity three in codimension two.
We relate the cohomology of the Orlik-Solomon algebra of a discriminantal arrangement to the local system cohomology of the complement. The Orlik-Solomon algebra of such an arrangement (viewed as a complex) is shown to be a linear approximation of a complex arising from the fundamental group of the complement, the cohomology of which is isomorphic to that of the complement with coefficients in an arbitrary complex rank one local system. We also establish the relationship between the cohomology support loci of the complement of a discriminantal arrangement and the resonant varieties of its Orli…
We give an explicit description of the multiplicities of codimension two strata of discriminantal arrangements introduced by Manin and Schechtman. As applications, we discuss the connection of these results with properties of Gale transform and we calculate the fundamental groups of the complements to discriminantal arrangements.
We calculate the skew-symmetric cohomology of the complement of a discriminantal hyperplane arrangement with coefficients in local systems arising in the context of the representation theory of the Lie algebra sl_2. For a discriminantal arrangement in C^k, the skew-symmetric cohomology is nontrivial in dimension k-1 precisely when the "master function" which defines the local system on the complement has nonisolated critical points. In symmetric coordinates, the critical set is a union of lines. Generically, the dimension of this nontrivial skew-symmetric cohomology group is equal to the numbe…
Indian Institute of Information Technology, Manipur（印度信息技术学院曼尼普尔分校）；Institute for Chemical Reaction Design and Discovery, Hokkaido University（北海道大学化学反应用设计发现研究所）；Torino University
In this article we prove in the main theorem that, there is a bijection between the isomorphism classes of a certain type of real hyperplane arrangements on the one hand, and the antipodal pairs of convex cones of an associated discriminantal arrangement on the other hand. The type of hyperplane arrangements considered and the isomorphism classes have been defined precisely. As a consequence we enumerate such isomorphism classes by computing the characteristic polynomial of the discriminantal arrangement. With a certain restriction, the enumerated value is shown to be independent of the discri…
We consider hyperplane arrangements generated by generic points and study their intersection lattices. These arrangements are known to be equivalent to discriminantal arrangements. We show a fundamental structure of the intersection lattices by decomposing the poset ideals as direct products of smaller lattices corresponding to smaller dimensions. Based on this decomposition we compute the Möbius functions of the lattices and the characteristic polynomials of the arrangements up to dimension six.
We construct bundles $E_k(\A,\F) \to M$ over the complement $M$ of a complex hyperplane arrangement \A, depending on an integer $k \geq 1$ and a set $\F=\{f_1, \ldots, f_μ\}$ of continuous functions $f_i \colon M \to \C$ whose differences are nonzero on $M$, generalizing the configuration space bundles arising in the Lawrence-Krammer-Bigelow representation of the pure braid group. We display such families \F\ for rank two arrangements, reflection arrangements of types $A_\ell$, $B_\ell$, $D_\ell$, $F_4$, and for arrangements supporting multinet structures with three classes, with the resulting…
Given an $\Bbb{F}$-represented matroid $(M,ρ)$ with the ground set $[m]$, the representation $ρ$ naturally defines a hyperplane arrangement $\mathcal{A}_ρ$. We will study its parallel translates $\mathcal{A}_{ρ,{g}}$ of $\mathcal{A}_ρ$ for all ${ g}\in \mathbb{F}^m$. Its intersection semi-lattices $L(\mathcal{A}_{ρ,{ g}})$ and the characteristic polynomials $χ(\mathcal{A}_{ρ,{ g}},t)$ will be classified by the intersection lattice of the derived arrangement $\mathcal{A}_{δρ}$, which is a hyperplane arrangement associated with the derived matroid $(δM,δρ)$ and also known as the discriminantal a…
In this paper we study intersections of quadrics, components of the hypersurface in Grassmannian $Gr(3, \CC^n)$ introduced in \cite{SoSuSi}. This lead to an alternative statement and proof of Pappus's Theorem retrieving Pappus's and Hesse configurations of lines as special points in complex projective Grassmannian. This new connection is obtained through a third purely combinatorial object, the intersection lattice of Discriminantal arrangement.
Hetyei recently introduced a hyperplane arrangement (called the homogenized Linial arrangement) and used the finite field method of Athanasiadis to show that its number of regions is a median Genocchi number. These numbers count a class of permutations known as Dumont derangements. Here, we take a different approach, which makes direct use of Zaslavsky's formula relating the intersection lattice of this arrangement to the number of regions. We refine Hetyei's result by obtaining a combinatorial interpretation of the Möbius function of this lattice in terms of variants of the Dumont permutation…
Stan Wagon asked the following in 2000. Is every zonohedron face 3-colorable when viewed as a planar map? An equivalent question, under a different guise, is the following: is the arrangement graph of great circles on the sphere always vertex 3-colorable? (The arrangement graph has a vertex for each intersection point, and an edge for each arc directly connecting two intersection points.) Assume that no three circles meet at a point, so that this arrangement graph is 4-regular. In this note we have shown that all arrangement graphs defined as above are 3-colorable.
We study the intersection lattice of a hyperplane arrangement recently introduced by Hetyei who showed that the number of regions of the arrangement is a median Genocchi number. Using a different method, we refine Hetyei's result by providing a combinatorial interpretation of the coefficients of the characteristic polynomial of the intersection lattice of this arrangement. We also show that the Möbius invariant of the intersection lattice is a (nonmedian) Genocchi number. The Genocchi numbers count a class of permutations known as Dummont permutations and the median Genocchi numbers count the …
A topological hyperplane is a subspace of R^n (or a homeomorph of it) that is topologically equivalent to an ordinary straight hyperplane. An arrangement of topological hyperplanes in R^n is a finite set H such that k topological hyperplanes in H, if their intersection is nonempty, meet in a subspace that is a topological hyperplane in the intersection of any k-1 of them; but two topological hyperplanes that do intersect need not cross each other. If every intersecting pair does cross, the arrangement is affine. The number of regions formed by an arrangement of topological hyperplanes has the …
We study a relation between roots of characteristic polynomials and intersection points of line arrangements. Using these results, we obtain a lot of applications for line arrangements. Namely, we give (i) a generalized addition theorem for line arrangements, (ii) a generalization of Faenzi-Vallès' theorem over a field of arbitrary characteristic, (iii) a partial result on the conjecture of Terao of line arrangements, and (iv) a new sufficient condition for freeness over finite fields. Also, a higher dimensional version of main results is considered.
An arrangement of circles in which circles intersect only in angles of $π/2$ is called an \emph{arrangement of orthogonal circles}. We show that in the case that no two circles are nested, the intersection graph of such an arrangement is planar. The same result holds for arrangement of circles that intersect in an angle of at most $π/2$. For the general case we prove that the maximal number of edges in an intersection graph of an arrangement of orthogonal circles lies in between $4n - O\left(\sqrt{n}\right)$ and $\left(4+\frac{5}{11}\right)n$, for $n$ being the number of circles. Based on the …
For any triple given by a positive integer n, a finite group G, and a faithful representation V of G, one can describe a subspace arrangement whose intersection lattice is a generalized Dowling lattice in the sense of Hanlon. In this paper we construct the minimal De Concini-Procesi wonderful model associated to this subspace arrangement and give a description of its boundary. Our aim is to point out the nice poset provided by the intersections of the irreducible components in the boundary, which provides a geometric realization of the nested set poset of this generalized Dowling lattice. It c…
We study the intersection lattice of the arrangement $\mathcal{A}^G$ of subspaces fixed by subgroups of a finite linear group $G$. When $G$ is a reflection group, this arrangement is precisely the hyperplane reflection arrangement of $G$. We generalize the notion of finite reflection groups. We say that a group $G$ is generated (resp. strictly generated) in codimension $k$ if it is generated by its elements that fix point-wise a subspace of codimension at most $k$ (resp. precisely $k$). If $G$ is generated in codimension two, we show that the intersection lattice of $\mathcal{A}^G$ is atomic. …
We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. For positive we have a construction which shows that all chordal graphs that can be represented as intersection graph of subpaths on a tree are pseudosegment intersection graphs. We then study the limits of representability. We describe a family of intersection graphs of substars of a star which is not representable as intersection graph of pseudosegments. The degree of the substars in this example, however, has to get large. A more intricate analysis involving a Ramsey argument shows that even …
Each labeled rooted tree is associated with a hyperplane arrangement, which is free with exponents given by the depths of the vertices of this tree. The intersection lattices of these arrangements are described through posets of forests. These posets are used to define coalgebras, whose dual algebras are shown to have a simple presentation by generators and relations.
We prove that the posets of connected components of intersections of toric and elliptic arrangements defined by root systems are EL-shellable and we compute their homotopy type. Our method rests on Bibby's description of such posets by means of "labeled partitions": after giving an EL-labeling and counting homology chains for general posets of labeled partitions, we obtain the stated results by considering the appropriate subposets.
We prove the conjecture of A. Postnikov that (A) the number of regions in the inversion hyperplane arrangement associated with a permutation $w\in \Sn$ is at most the number of elements below $w$ in the Bruhat order, and (B) that equality holds if and only if $w$ avoids the patterns 4231, 35142, 42513 and 351624. Furthermore, assertion (A) is extended to all finite reflection groups. A byproduct of this result and its proof is a set of inequalities relating Betti numbers of complexified inversion arrangements to Betti numbers of closed Schubert cells. Another consequence is a simple combinator…
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 recursive freeness is not a combinatorial property of the intersection lattice of an arrangement.
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 supersolvable if the intersection lattice $L(c(\mathcal{A}))$ of the cone $c(\mathcal{A})$ contains a maximal chain of modular elements. The second author has shown that a graphical arrangement $\mathcal{A}_G$ is supersolvable if and only if $G$ is a chordal graph. He later considered a generalization of graphical arrangements which are called $ψ$-graphical arrangem…
An integral coefficient matrix determines an integral arrangement of hyperplanes in R^m. After modulo q reduction, the same matrix determines an arrangement A_q of "hyperplanes" in Z^m. In the special case of central arrangements, Kamiya, Takemura and Terao [J. Algebraic Combin., to appear] showed that the cardinality of the complement of A_q in Z_q^m is a quasi-polynomial in q. Moreover, they proved in the central case that the intersection lattice of A_q is periodic from some q on. The present paper generalizes these results to the case of non-central arrangements. The paper also studies the…
The shard intersection order is a new lattice structure on a finite Coxeter group W which encodes the geometry of the reflection arrangement and the lattice theory of the weak order. In the case where W is the symmetric group, we characterize shard intersections as certain pre-orders which we call permutation pre-orders. We use this combinatorial characterization to determine properties of the shard intersection order. In particular, we give an EL-labeling.
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, of this combinatorially defined object, associated to the intersection lattice of the arrangement, impacts on the first non-vanishing higher homotopy group of the complement of the arrangement.
The famous Szemerédi-Trotter theorem states that any arrangement of $n$ points and $n$ lines in the plane determines $O(n^{4/3})$ incidences, and this bound is tight. In this paper, we prove the following Turán-type result for point-line incidence. Let $\mathcal{L}_1$ and $\mathcal{L}_2$ be two sets of $t$ lines in the plane and let $P=\{\ell_1 \cap \ell_2 : \ell_1 \in \mathcal{L}_1, \ell_2 \in \mathcal{L}_2\}$ be the set of intersection points between $\mathcal{L}_1$ and $\mathcal{L}_2$. We say that $(P, \mathcal{L}_1 \cup \mathcal{L}_2)$ forms a \emph{natural $t\times t$ grid} if $|P| =t^2$,…
Improving a result of Károlyi, Pach and Tóth, we construct an arrangement of $n$ segments in the plane with at most $n^{\log{8} / \log{169}}$ pairwise crossing or pairwise disjoint segments. We use the recursive method based on flattenable arrangements which was established by Larman, Matoušek, Pach and Törőcsik. We also show that not every arrangement can be flattened, by constructing an intersection graph of segments which cannot be realized by an arrangement of segments crossing a common line. Moreover, we also construct an intersection graph of segments crossing a common line which cannot …
Two arrangements with the same combinatorial intersection lattice but whose complements have different fundamental groups are called a Zariski pair. This work finds that there are at most nine such pairs amongst all ten line arrangements whose intersection points are doubles or triples. This result is obtained by considering the moduli space of a given configuration table which describes the intersection lattice. A complete combinatorial classification is given of all arrangements of this type under a suitable assumption, producing a list of seventy-one described in a table, most of which do n…
The vanishing ideal I of a subspace arrangement is an intersection of linear ideals. We give a formula for the Hilbert polynomial of I if the subspaces meet transversally. We also give a formula for the Hilbert series of a product J of the linear ideals without any assumptions on the subspace arrangement. It turns out that the Hilbert series of J is a combinatorial invariant of the subspace arrangement: it only depends on the intersection lattice and the dimension function. The graded Betti numbers of J are determined by the Hilbert series, so they are combinatorial invariants as well. The res…
We study enumerative questions on the moduli space $\mathcal{M}(L)$ of hyperplane arrangements with a given intersection lattice $L$. Mnëv's universality theorem suggests that these moduli spaces can be arbitrarily complicated; indeed it is even difficult to compute the dimension $D =\dim \mathcal{M}(L)$. Embedding $\mathcal{M}(L)$ in a product of projective spaces, we study the degree $N=\mathrm{deg} \mathcal{M}(L)$, which can be interpreted as the number of arrangements in $\mathcal{M}(L)$ that pass through $D$ points in general position. For generic arrangements $N$ can be computed combinat…
Given a rank 3 real arrangement $\mathcal A$ of $n$ lines in the projective plane, the Dirac-Motzkin conjecture (proved by Green and Tao in 2013) states that for $n$ sufficiently large, the number of simple intersection points of $\mathcal A$ is greater than or equal to $n/2$. With a much simpler proof we show that if $\mathcal A$ is supersolvable, then the conjecture is true for any $n$ (a small improvement of original conjecture). The Slope problem (proved by Ungar in 1982) states that $n$ non-collinear points in the real plane determine at least $n-1$ slopes; we show that this is equivalent…
Any collection of $n$ compact convex planar sets $K_1,\dots, K_n$ defines a vector of ${n\choose 2}$ mixed areas $V(K_i,K_j)$ for $1\leq i<j\leq n$. We show that for $n\geq 4$ these numbers satisfy certain Plücker-type inequalities. Moreover, we prove that for $n=4$ these inequalities completely describe the space of all mixed area vectors $(V(K_i,K_j) : 1\leq i<j\leq 4)$. For arbitrary $n\geq 4$ we show that this space has a semialgebraic closure of full dimension. As an application, we obtain an inequality description for the smallest positive homogeneous set containing the configuration spa…
This article presents a study of an algebra spanned by the faces of a hyperplane arrangement. The quiver with relations of the algebra is computed and the algebra is shown to be a Koszul algebra. It is shown that the algebra depends only on the intersection lattice of the hyperplane arrangement. A complete system of primitive orthogonal idempotents for the algebra is constructed and other algebraic structure is determined including: a description of the projective indecomposable modules; the Cartan invariants; projective resolutions of the simple modules; the Hochschild homology and cohomology…
We introduce a new family of hyperplane arrangements inspired by the homogenized Linial arrangement (which was recently introduced by Hetyei), and show that the intersection lattices of these arrangements are isomorphic to the bond lattices of Ferrers graphs. Using recent work of Lazar and Wachs we are able to give combinatorial interpretations of the characteristic polynomials of these arrangements in terms of permutation enumeration. For certain infinite families of these hyperplane arrangements, we are able to give generating function formulas for their characteristic polynomials. To do so,…
The purpose of this note is to study configurations of lines in projective planes over arbitrary fields having the maximal number of intersection points where three lines meet. We give precise conditions on ground fields F over which such extremal configurations exist. We show that there does not exist a field admitting a configuration of 11 lines with 17 triple points, even though such a configuration is allowed combinatorially. Finally, we present an infinite series of configurations which have a high number of triple intersection points.
A generalized Terao Conjecture for line arrangements
Université Côte d’Azur, CNRS, LJAD（法国蔚蓝海岸大学）；Simion Stoilow Institute of Mathematics（罗马尼亚科学院西奥多·斯托伊洛数学研究所）；Department of Mathematics, UKEN Krakow（克拉科夫雅盖隆大学数学系）
We construct counterexamples to Yoshinaga's conjecture that every free arrangement is either inductively free or rigid in characteristic zero. The smallest example has $13$ hyperplanes, its intersection lattice has a one dimensional moduli space, and it is free but not recursively free.
