Cell Complexities in Hyperplane Arrangements
نویسندگان
چکیده
منابع مشابه
On Cell Complexities in Hyperplane Arrangements
Let H be a collection of n hyperplanes in d-space. We will assume that the planes are in general position, meaning that any k planes meet in a d− k-flat, if k = 1, . . . , d, and not at all if k > d. It is not difficult to see that worst-case cell complexity can always be achieved by planes in general position. Let P be a set of m points, not lying on any hyperplane. Denote by K (d) j (P,H) the...
متن کاملComplexity of Many Cells and Sum of Squares of Cell Complexities in Hyperplane Arrangements Too long
Let H be a collection of n hyperplanes in d-space. We will assume that the planes are in general position, meaning that any k planes meet in a d− k-flat, if k = 1, . . . , d, and not at all if k > d. It is not difficult to see that worst-case cell complexity can always be achieved by planes in general position. comBoris says: True, or only asymptotically true?ment Let P be ←− Work on this paper...
متن کاملComplex Hyperplane Arrangements
We were fortunate to spend the 2004 fall semester in residence at MSRI, participating in the program on Hyperplane Arrangements and Applications. It was an intense, stimulating, productive, enlightening, eventful and most enjoyable experience. It was especially so for us long-timers in the field because the program truly marked a coming-of-age in the evolution of the subject from relative obscu...
متن کاملHodge Spectrum of Hyperplane Arrangements
In this article there are two main results. The first result gives a formula, in terms of a log resolution, for the graded pieces of the Hodge filtration on the cohomology of a unitary local system of rank one on the complement of an arbitrary divisor in a smooth projective complex variety. The second result is an application of the first. We give a combinatorial formula for the spectrum of a h...
متن کاملRandom Walk and Hyperplane Arrangements
Let C be the set of chambers of a real hyperplane arrangement. We study a random walk on C introduced by Bidigare, Hanlon, and Rockmore. This includes various shuuing schemes used in computer science, biology, and card games. It also includes random walks on zonotopes and zonotopal tilings. We nd the stationary distributions of these Markov chains, give good bounds on the rate of convergence to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete and Computational Geometry
سال: 2004
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-003-0854-z