Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the partition of R^n by hyperplanes

Published 31 Jul 2013 in cs.DM and math.CO | (1308.0311v2)

Abstract: The partitioning of space by hyperplanes in the context of discrete classification problem is considered. We obtain some relations for the number of partitions and establish a recurrence relation for the maximal number of partitions of Rn by m hyperplanes. We rederive an explicit formula for the number of components into which the space can be partitioned by m hyperplanes.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.