2013/09/25 by István Szalkai, Szalkai, Istvan, Źsolt Tuza +1
Mathematics · #Advanced Optimization Algorithms Research #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #Metric Geometry (math.MG) #Point processes and geometric inequalities
paper · doi:10.48550/arxiv.1309.6491
openalex publication_date 2013/09/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we formulate and solve extremal problems in the d-dimensional Euclidean space 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. A function related to Sperners theorem and the YBLM inequality is also considered and its relation to hypergraph Turan problems is discussed.