Sets in R^d determining k taxicab distances
From MaRDI portal
Publication:2192425
DOI10.2140/INVOLVE.2020.13.487zbMATH Open1446.52012arXiv1911.08067OpenAlexW2990431409MaRDI QIDQ2192425FDOQ2192425
Authors: Vajresh Balaji, Olivia Edwards, Anne Marie Loftin, Solomon Mcharo, Lo Phillips, Alex Rice, Bineyam Tsegaye
Publication date: 17 August 2020
Published in: Involve (Search for Journal in Brave)
Abstract: We address an analog of a problem introduced by ErdH{o}s and Fishburn, itself an inverse formulation of the famous ErdH{o}s distance problem, in which the usual Euclidean distance is replaced with the metric induced by the -norm, commonly referred to as the . Specifically, we investigate the following question: given , what is the maximum size of a subset of that determines at most distinct taxicab distances, and can all such optimal arrangements be classified? We completely resolve the question in dimension , as well as the case in dimension , and we also provide a full resolution in the general case under an additional hypothesis.
Full work available at URL: https://arxiv.org/abs/1911.08067
Recommendations
Erd?s problems and related topics of discrete geometry (52C10) General theory of distance geometry (51K05)
Cites Work
- On the Erdős distinct distances problem in the plane
- On Sets of Distances of n Points
- The Erdős distance problem
- Maximum planar sets that determine \(k\) distances
- Uniqueness of maximum planar five-distance sets
- A proof of Erdős-Fishburn's conjecture for \(g(6)=13\)
- Embedding into rectilinear spaces
- Equilateral dimension of the rectilinear space
Cited In (7)
- Distinct distances with \(\ell_p\) metrics
- The additive structure of Cartesian products spanning few distinct distances
- Distinct Distances in Three and Higher Dimensions
- A reduction for the distinct distances problem in \(\mathbb{R}^d\)
- On the Erdős distinct distances problem in the plane
- A note on distinct distances in rectangular lattices
- Distinct distances in homogeneous sets in Euclidean space
This page was built for publication: Sets in \(\mathbb{R}^d\) determining \(k\) taxicab distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2192425)