Supersolvability and Freeness for ψ-Graphical Arrangements

Let G be a simple graph on the vertex set {v[subscript 1],…,v[subscript n]} with edge set E. Let K be a field. The graphical arrangement A[subscript G] in K[superscript n] is the arrangement x[subscript i]−x[subscript j]=0,v[subscript i]v[subscript j] ∈ E. An arrangement A is supersolvable if the intersection lattice L(c(A)) of the cone c(A) contains a maximal chain of modular elements. The second author has shown that a graphical arrangement A[subscript G] is supersolvable if and only if G is a chordal graph. He later considered a generalization of graphical arrangements which are called ψ-graphical arrangements. He conjectured a characterization of the supersolvability and freeness (in the sense of Terao) of a ψ-graphical arrangement. We provide a proof of the first conjecture and state some conditions on free ψ-graphical arrangements.China Scholarship CouncilNational Science Foundation (U.S.) (Grant DMS-1068625

Valid Orderings of Real Hyperplane Arrangements

Given a real finite hyperplane arrangement A and a point p not on any of the hyperplanes, we define an arrangement vo(A,p), called the valid order arrangement, whose regions correspond to the different orders in which a line through p can cross the hyperplanes in A. If A is the set of affine spans of the facets of a convex polytope P and p lies in the interior of P, then the valid orderings with respect to p are just the line shellings of P where the shelling line contains p. When p is sufficiently generic, the intersection lattice of vo(A,p) is the Dilworth truncation of the semicone of A. Various applications and examples are given. For instance, we determine the maximum number of line shellings of a d-polytope with m facets when the shelling line contains a fixed point p. If P is the order polytope of a poset, then the sets of facets visible from a point involve a generalization of chromatic polynomials related to list colorings.National Science Foundation (U.S.) (Grant DMS-1068625