Abstract
In this paper we formulate and solve extremal problems in the Euclidean space Rd and further in hypergraphs, originating from problems in stoichiometry and elementary linear algebra. The notion of affine simplex is the bridge between the original problems and the presented extremal theorem on set systems. As a sample corollary, it follows that if no triple is collinear in a set S of n points in R3, then S contains at least n4−cn3 affine simplices for some constant c. A function related to Sperner’s Theorem and its well-known extension to reciprocal sums is also considered and its relation to Turán’s hypergraph problems is discussed.
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.
