
doi: 10.1007/bf02573966
The author proves the following theorem: For any fixed \(n\)-simplex \(S\) in \(\mathbb{R}^ n\) there exists a partition of \(\mathbb{R}^ n\) into countably many pieces none of which contains an \(n\)-simplex similar to \(S\). The proof uses the Axiom of Choice.
partition of \(\mathbb{R}^ n\), Polyhedra and polytopes; regular figures, division of spaces, Axiom of choice and related propositions, Convex sets in \(n\) dimensions (including convex hypersurfaces)
partition of \(\mathbb{R}^ n\), Polyhedra and polytopes; regular figures, division of spaces, Axiom of choice and related propositions, Convex sets in \(n\) dimensions (including convex hypersurfaces)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 6 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
