منابع مشابه
On Incidences Between Points and Hyperplanes∗
We show that if the number I of incidences between m points and n planes in R is sufficiently large, then the incidence graph (that connects points to their incident planes) contains a large complete bipartite subgraph involving r points and s planes, so that rs ≥ I2 mn−a(m+n), for some constant a > 0. This is shown to be almost tight in the worst case because there are examples of arbitrarily ...
متن کاملSeparating Points by Parallel Hyperplanes - Characterization Problem
This paper deals with partitions of a discrete set S of points in a d-dimensional space, by h parallel hyperplanes. Such partitions are in a direct correspondence with multilinear threshold functions which appear in the theory of neural networks and multivalued logic. The characterization (encoding) problem is studied. We show that a unique characterization (encoding) of such multilinear partit...
متن کاملAbc Estimate, Integral Points, and Geometry of P minus Hyperplanes
Let K be a field and H be a set of hyperplanes in P n(K). When K is a function field, we show that the following are equivalent. (a) H is nondegenerate over K. (b) The height of the (S,H)-integral points of P n(K) − H is bounded. (c) P n K − H is an abc variety. When K is a number field and H is nondegenerate over K, we establish an explicit bound on the number of (S,H)-integral points of P n(K...
متن کاملSelecting distances in arrangements of hyperplanes spanned by points
In this paper we consider a problem of distance selection in the arrangement of hyperplanes induced by n given points. Given a set of n points in d-dimensional space and a number k, 1 k (n d ) , determine the hyperplane that is spanned by d points and at distance ranked by k from the origin. For the planar case we present an O(n log2 n) runtime algorithm using parametric search partly different...
متن کاملAggregate Processing of Planar Points
Aggregate window queries return summarized information about objects that fall inside a query rectangle (e.g., the number of objects instead of their concrete ids). Traditional approaches for processing such queries usually retrieve considerable extra information, thus compromising the processing cost. The paper addresses this problem for planar points from both theoretical and practical points...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Časopis pro pěstování matematiky
سال: 1961
ISSN: 0528-2195
DOI: 10.21136/cpm.1961.117362