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 o...

Full description

Bibliographic Details
Main Author: Stanley, Richard P (Contributor)
Other Authors: Massachusetts Institute of Technology. Department of Mathematics (Contributor)
Format: Article
Language:English
Published: Springer US, 2016-10-06T20:11:16Z.
Subjects:
Online Access:Get fulltext
LEADER 01559 am a22001813u 4500
001 104656
042 |a dc 
100 1 0 |a Stanley, Richard P  |e author 
100 1 0 |a Massachusetts Institute of Technology. Department of Mathematics  |e contributor 
100 1 0 |a Stanley, Richard P  |e contributor 
245 0 0 |a Valid Orderings of Real Hyperplane Arrangements 
260 |b Springer US,   |c 2016-10-06T20:11:16Z. 
856 |z Get fulltext  |u http://hdl.handle.net/1721.1/104656 
520 |a 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. 
520 |a National Science Foundation (U.S.) (Grant DMS-1068625) 
546 |a en 
655 7 |a Article 
773 |t Discrete & Computational Geometry