On the number of simplicial complexes in R^ d
From MaRDI portal
Publication:1370935
DOI10.1016/S0925-7721(97)00007-2zbMATH Open0889.68147MaRDI QIDQ1370935FDOQ1370935
Authors: N. R. Shah, Tamal K. Dey
Publication date: 28 October 1997
Published in: Computational Geometry (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
- Many triangulated spheres
- On counting triangulations in \(d\) dimensions
- The Upper Bound Conjecture and Cohen-Macaulay Rings
- Title not available (Why is that?)
- On Dedekind's Problem: The Number of Monotone Boolean Functions
- Empty Simplices in Euclidean Space
- Crossing-Free Subgraphs
- Triangulated n-manifolds are determined by their \([n/2]+1\)-skeletons
- Counting triangle crossings and halving planes
Cited In (8)
- On the nonexistence of \(k\)-reptile simplices in \(\mathbb R^3\) and \(\mathbb R^4\)
- Hardness of embedding simplicial complexes in \(\mathbb R^d\)
- Many triangulated spheres
- $d$-representability of simplicial complexes of fixed dimension
- Dissection of the path-simplex in \(\mathbb {R}^n\) into \(n\) path-subsimplices
- Title not available (Why is that?)
- Representability and boxicity of simplicial complexes
- Title not available (Why is that?)
This page was built for publication: On the number of simplicial complexes in \(\mathbb{R}^ d\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1370935)