Minimum number of affine simplices of given dimension

DOI10.1016/J.DAM.2014.07.025MaRDI QIDQ476315zbMATH OpenOpenAlexFDO

Authors István Szalkai, Zsolt Tuza

Publication date 28 November 2014

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1309.6491

zbMATH Keywords

stoichiometrylinear hypergraphextremal set theoryEuclidean affine simplexminimal linear dependency

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05)

Abstract: 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.

Recommendations

• Counting simplexes in \(\mathbb{R}^3\)
• scientific article; zbMATH DE number 3626171
• Similar simplices in a \(d\)-dimensional point set
• Hitting simplices with points in \(\mathbb R^{3}\)
• The number of congruent simplices in a point set

Cites work

• scientific article; zbMATH DE number 5942358 (Why is no real title available?)
• scientific article; zbMATH DE number 5138821 (Why is no real title available?)
• scientific article; zbMATH DE number 736291 (Why is no real title available?)
• scientific article; zbMATH DE number 736306 (Why is no real title available?)
• scientific article; zbMATH DE number 878901 (Why is no real title available?)
• scientific article; zbMATH DE number 3224335 (Why is no real title available?)
• scientific article; zbMATH DE number 3185004 (Why is no real title available?)
• A short proof of Sperner's lemma
• Counting minimal reactions with specific conditions in \(\mathbb R^4\)
• Counting simplexes in \(\mathbb{R}^3\)
• Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
• Logarithmic order of free distributive lattice
• On generalized graphs
• On the Minimal Density of Triangles in Graphs
• Triangles in an Ordinary Graph
• Upper bounds for Turán numbers
• What we know and what we do not know about Turán numbers

This page was built for publication: Minimum number of affine simplices of given dimension

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476315)