Abstract
In this article we consider S to be a set of points in d-space with the property that any d points of S span a hyperplane and not all the points of S are contained in a hyperplane. The aim of this article is to introduce the function \(e_d(n)\), which denotes the minimal number of hyperplanes meeting S in precisely d points, minimising over all such sets of points S with \(|S|=n\).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
