Cardinalities of k-distance sets in Minkowski spaces

DOI10.1016/S0012-365X(99)90143-7zbMATH Open0939.52007arXiv0712.0953OpenAlexW4210665939MaRDI QIDQ1292877FDOQ1292877

Konrad J. Swanepoel

Publication date: 2 July 2000

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

Abstract: A subset of a metric space is a k-distance set if there are exactly k non-zero distances occuring between points. We conjecture that a k-distance set in a d-dimensional Banach space (or Minkowski space), contains at most (k+1)^d points, with equality iff the unit ball is a parallelotope. We solve this conjecture in the affirmative for all 2-dimensional spaces and for spaces where the unit ball is a parallelotope. For general spaces we find various weaker upper bounds for k-distance sets.

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

Recommendations

• An upper bound for the cardinality of an \(s\)-distance set in Euclidean space
• ON THE MINKOWSKI DIMENSION OF CERTAIN KAKEYA SETS
• scientific article; zbMATH DE number 3149575
• scientific article; zbMATH DE number 3895787
• On the Minkowski distances and products of sum sets
• scientific article; zbMATH DE number 500324
• scientific article; zbMATH DE number 468618
• On the Hausdorff dimensions of distance sets
• Diametrically complete sets in Minkowski spaces
• \((m, n)\)-equidistant sets in \(\mathbb{R}^{k},\mathbb{S}^{k}\), and \(\mathbb P^k\)

zbMATH Keywords

Minkowski space\(k\)-distance set[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Erd%EF%BF%BD%EF%BF%BDs+distance+problem&go=Go Erd��s distance problem]

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) General theory of distance geometry (51K05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Unsolved problems in geometry
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry
• Title not available (Why is that?)
• On Sets of Distances of n Points
• On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
• Combinatorial complexity bounds for arrangements of curves and spheres
• The number of different distances determined by a set of points in the Euclidean plane
• The number of different distances determined by n points in the plane
• Paired calibrations applied to soap films, immiscible fluids, and surfaces or networks minimizing other norms
• Equilateral Sets in Minkowski Spaces
• 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
• Title not available (Why is that?)
• Minimal surfaces, crystals, shortest networks, and undergraduate research
• Abschätzungen für die Anzahl der konvexen Körper, die einen konvexen Körper berühren
• Title not available (Why is that?)
• Alternative proof of Sine's theorem on the size of a regular polygon in \(\mathbb{R}{}^ n\) with the \(\ell{}_ \infty\)-metric
• Title not available (Why is that?)
• Three distinct distances in the plane

Cited In (9)

• General embedding problems and two-distance sets in Minkowski planes
• Upper bounds for edge-anitpodal and subequilateral polytopes
• Few distance sets in \(\ell_p\) spaces and \(\ell_p\) product spaces
• The geometry of Minkowski spaces -- a survey. I
• Pairwise intersecting homothets of a convex body
• Max-norm Ramsey theory
• An upper bound for the cardinality of an \(s\)-distance set in Euclidean space
• Odd-distance sets and right-equidistant sequences in the maximum and Manhattan metrics
• Odd-distance and right-equidistant sets in the maximum and Manhattan metrics

This page was built for publication: Cardinalities of \(k\)-distance sets in Minkowski spaces

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