Cardinalities of \(k\)-distance sets in Minkowski spaces

DOI10.1016/S0012-365X(99)90143-7zbMath0939.52007arXiv0712.0953MaRDI QIDQ1292877

Konrad J. Swanepoel

Publication date: 2 July 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0712.0953

zbMATH Keywords

Minkowski space; \(k\)-distance set; Erdős distance problem

Mathematics Subject Classification ID

52C10: Erd?s problems and related topics of discrete geometry

51K05: General theory of distance geometry

Related Items

The geometry of Minkowski spaces -- a survey. I, Upper bounds for edge-anitpodal and subequilateral polytopes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Abschätzungen für die Anzahl der konvexen Körper, die einen konvexen Körper berühren
• On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
• The number of different distances determined by n points in the plane
• Combinatorial complexity bounds for arrangements of curves and spheres
• An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
• An upper bound for the cardinality of an s-distance subset in real euclidean space
• The number of different distances determined by a set of points in the Euclidean plane
• Unsolved problems in geometry
• Alternative proof of Sine's theorem on the size of a regular polygon in \(\mathbb{R}{}^ n\) with the \(\ell{}_ \infty\)-metric
• Minimal surfaces, crystals, shortest networks, and undergraduate research
• Paired calibrations applied to soap films, immiscible fluids, and surfaces or networks minimizing other norms
• Three distinct distances in the plane
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry
• Equilateral Sets in Minkowski Spaces
• On Sets of Distances of n Points