2000 character limit reached
On the partition of R^n by hyperplanes (1308.0311v2)
Published 31 Jul 2013 in cs.DM and math.CO
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
