No Arabic abstract
We study the combinatorics of tropical hyperplane arrangements, and their relationship to (classical) hyperplane face monoids. We show that the refinement operation on the faces of a tropical hyperplane arrangement, introduced by Ardila and Develin in their definition of a tropical oriented matroid, induces an action of the hyperplane face monoid of the classical braid arrangement on the arrangement, and hence on a number of interesting related structures. Along the way, we introduce a new characterization of the types (in the sense of Develin and Sturmfels) of points with respect to a tropical hyperplane arrangement, in terms of partial bijections which attain permanents of submatrices of a matrix which naturally encodes the arrangement.
We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong $sigma$-Grobner bases. Moreover, we prove that the Teraos conjecture over finite fields implies the conjecture over the rationals.
There is a trinity relationship between hyperplane arrangements, matroids and convex polytopes. We expand it as resolving the complexity issue expected by Mnevs universality theorem and conduct combinatorializing so the theory over fields becomes realization of our combinatorial theory. A main theorem is that for n less than or equal to 9 a specific and general enough kind of matroid tilings in the hypersimplex Delta(3,n) extend to matroid subdivisions of Delta(3,n) with the bound n=9 sharp. As a straightforward application to realizable cases, we solve an open problem in algebraic geometry proposed in 2008.
In this article, we study the weak and strong Lefschetz properties, and the related notion of almost revlex ideal, in the non-Artinian case, proving that several results known in the Artinian case hold also in this more general setting. We then apply the obtained results to the study of the Jacobian algebra of hyperplane arrangements.
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.
We introduce a new algebra associated with a hyperplane arrangement $mathcal{A}$, called the Solomon-Terao algebra $mbox{ST}(mathcal{A},eta)$, where $eta$ is a homogeneous polynomial. It is shown by Solomon and Terao that $mbox{ST}(mathcal{A},eta)$ is Artinian when $eta$ is generic. This algebra can be considered as a generalization of coinvariant algebras in the setting of hyperplane arrangements. The class of Solomon-Terao algebras contains cohomology rings of regular nilpotent Hessenberg varieties. We show that $mbox{ST}(mathcal{A},eta)$ is a complete intersection if and only if $mathcal{A}$ is free. We also give a factorization formula of the Hilbert polynomials when $mathcal{A}$ is free, and pose several related questions, problems and conjectures.