On the Partition of Space by Hyperplanes
DOI:
https://doi.org/10.29020/nybg.ejpam.v16i2.4713Keywords:
hyperplane arrangement, number of regions, binomial coefficientsAbstract
We consider the problem of partitioning of space by hyperplanes that arises in many application areas, where the number of regions the space is divided into is required to be determined, such as speech/pattern recognition, various classification problems, data analysis. We obtain some relations for the number of divisions and establish a recurrence relation for the maximum number of regions in d-dimensional Euclidean space cut by n hyperplanes. We also re-derive an explicit formula for the number of regions into which the space can be partitioned by n hyperplanes.
Downloads
Published
Issue
Section
License
Copyright (c) 2023 European Journal of Pure and Applied Mathematics
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.