Distinct volume subsets
From MaRDI portal
Abstract: Suppose that and are positive integers with . Let be the largest integer such that any set of points in contains a subset of points for which all the non-zero volumes of the subsets of order are distinct. Beginning with ErdH{o}s in 1957, the function has been closely studied and is known to be at least a power of . We improve the best known bound for and show that is at least a power of for all and .
Recommendations
Cites work
- scientific article; zbMATH DE number 3167519 (Why is no real title available?)
- scientific article; zbMATH DE number 3572315 (Why is no real title available?)
- scientific article; zbMATH DE number 863486 (Why is no real title available?)
- A note on distinct distance subsets
- Distinct Triangle Areas in a Planar Point Set
- Distinct distances determined by subsets of a point set in space
- Linear problems in combinatorial number theory
- Near optimal bounds for the Erdős distinct distances problem in high dimensions
- No l Grid-Points in Spaces of Small Dimension
- On Sets of Distances of n Points
- On a problem in combinatorial geometry
- On the Erdős distinct distances problem in the plane
- On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space
- Point sets with distinct distances
- Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
- Some Remarks on Set Theory
- Some extremal problems in geometry
- The Directions Determined by n Points in the Plane
- The Minimum Number of Distinct Areas of Triangles Determined by a Set of n Points in the Plane
Cited in
(5)
This page was built for publication: Distinct volume subsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5251621)