I. Bárány, H. Bunting, D.G. Larman, J. Pach  Home/Search
Context
Related
| nyu.edu/~pach/publications/helen.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: nyu.edu/~pach/publications/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Introduction Given an arrangement of n hyperplanes in IR we call a cell of the arrangement rich if its boundary contains a piece of each of the hyperplanes, i.e. it has n facets, one supported by each hyperplane. Here in sections 2-5 we nd bounds for f(d; n) the maximum number of rich cells over all such arrangements, we found f(2; n) precisely and prove the following theorem. Supported in part by Hungarian National Science Foundation grant number 1907 and 1909 Supported by SERC... (Update)
Active bibliography (related documents): More All
0.2: Crossing Numbers - Pach (Correct)
0.2: Maximum Number of Different Distance Counts - Csizmadia, Ismailescu (Correct)
0.2: Combinatorial Geometry Problems - In Pattern Recognition (Correct)
Similar documents based on text: More All
0.3: Hausdorff dimension estimates by use of a tubular.. - Gelfert, Leonov.. (Correct)
0.3: Ramsey-Type Results for Geometric Graphs. II - Károlyi, Pach, Tóth, Valtr (Correct)
0.2: Covering Lattice Points by Subspaces - Bárány, Harcos, Pach, Tardos (Correct)
BibTeX entry: (Update)
@misc{ ny-rich,
author = "I. Bárány and H. Bunting and D.G. Larman and J. Pach",
title = "Rich Cells in an Arrangement of Hyperplanes",
url = "citeseer.ist.psu.edu/587120.html" }
Citations (may not include all citations):51 London Math (context) - On, equivalent et al. - 1963
9 unbaum Convex Polytopes (context) - Gr - 1967
5 Welzl Combinatorial complexity bounds for arrangements of cu.. (context) - Clarkson, Edelsbrunner et al. - 1990
1 Pollack Foundations of a Theory of Convexity on Ane Grassman.. (context) - Goodman
1 Klee Helly's theorem and its relatives Proc (context) - Danzer, Grunbaum - 1963
1 Trotter Extremal Problems in discrete geometry Combinatorica (context) - Szemer - 1983
1 London Math (context) - Hamilton, tournaments et al. - 1986
Documents on the same site (http://www.math.nyu.edu/~pach/publications/): More
An Algorithm for Finding Many Disjoint Monochromatic Edges in.. - Károlyi, al. (Correct)
Cellular Telephone Networks and Random Maps in Hypergraphs - Halpert, Lengyel, Pach (1999) (Correct)
A generalization of the Erdös-Szekeres theorem to disjoint.. - Pach, Tóth (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC