Minimum number of affine simplices of given dimension
From MaRDI portal
Publication:476315
DOI10.1016/J.DAM.2014.07.025zbMATH Open1303.05204arXiv1309.6491OpenAlexW2056508758MaRDI QIDQ476315FDOQ476315
Authors: István Szalkai, Zsolt Tuza
Publication date: 28 November 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1309.6491
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- What we know and what we do not know about Turán numbers
- Logarithmic order of free distributive lattice
- On generalized graphs
- On the Minimal Density of Triangles in Graphs
- Title not available (Why is that?)
- Triangles in an Ordinary Graph
- A short proof of Sperner's lemma
- Title not available (Why is that?)
- Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
- Title not available (Why is that?)
- Upper bounds for Turán numbers
- Counting simplexes in \(\mathbb{R}^3\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Counting minimal reactions with specific conditions in \(\mathbb R^4\)
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)