Counting simplexes in R^3

MaRDI QIDQ1130438zbMATH OpenFDO

Authors Claude Laflamme, István Szalkai

Publication date 30 August 1998

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://www.emis.de/journals/EJC/Volume_5/Abstracts/v5i1r40.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

minimal dependent setssimplices

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Extremal combinatorics (05D99) Gale and other diagrams (52B35)

Review text

The authors study the minimum number of simplices determined by a set of \(n\) vectors in dimension three which is full-dimensional and does not contain two collinear vectors. Here a simplex is just a minimal linearly dependent set, so the simplices need not be full-dimensional. Without the noncollinearity assumption, or if the set is planar, this problem is simple; for dimension three the extremal sets turn out to consist of \(n-2\) vectors in one plane, one of them coplanar with the remaining two vectors, with some exceptional configurations for \(n=3,4,7\). The minimal number of simplices then is \({n-2\choose 3} + {n-3\choose 2} +1\) for \(n\geq 4\). The authors also state some conjectures on the higher-dimensional analogues.

Recommendations

• Minimum number of affine simplices of given dimension
• On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space
• scientific article; zbMATH DE number 3626171
• scientific article; zbMATH DE number 3907270
• Hitting simplices with points in \(\mathbb R^{3}\)

Cited in

(2)

• Minimum number of affine simplices of given dimension
• Hitting simplices with points in \(\mathbb R^{3}\)

This page was built for publication: Counting simplexes in \(\mathbb{R}^3\)

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